World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
50
Citations
12822
World Ranking
5532
National Ranking
2528

Research.com Recognitions

  • 2019 - Fellow of the American Association for the Advancement of Science (AAAS)
  • 2013 - ACM Fellow For contributions to algorithmic approaches to program reliability, bioinformatics, and for service to the computer science research community.

Overview

Sampath Kannan is affiliated with the University of Pennsylvania in the United States. Their research contributions span several domains in computer science, with notable focus areas including economics and econometrics, management science and operations research, computational theory and mathematics, molecular biology, and statistics and probability.

Their work covers multiple topics, including:

  • Game Theory and Voting Systems
  • Auction Theory and Applications
  • Complexity and Algorithms in Graphs
  • Advanced Bandit Algorithms Research
  • Topological and Geometric Data Analysis
  • Sports Analytics and Performance
  • Optimization and Search Problems

Among the recent papers authored or co-authored by Sampath Kannan are:

  • "Best vs. All: Equity and Accuracy of Standardized Test Score Reporting," 2022, published at the 2022 ACM Conference on Fairness, Accountability, and Transparency
  • "Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation," 2020, published on arXiv (Cornell University)
  • "Best vs. All: Equity and Accuracy of Standardized Test Score Reporting," 2021, published on arXiv (Cornell University)
  • "Algorithmic Collusion Without Threats," 2024, published on arXiv (Cornell University)
  • "Pipeline Interventions," 2022, published in Mathematics of Operations Research

Sampath Kannan frequently collaborates with other researchers in their field. Their most frequent co-authors include:

  • Aaron Roth
  • Eshwar Ram Arunachaleswaran
  • Juba Ziani
  • Mingzi Niu
  • Rakesh Vohra

The primary venues for their publications are:

  • arXiv (Cornell University)
  • 2022 ACM Conference on Fairness, Accountability, and Transparency
  • Mathematics of Operations Research
  • Computational and Structural Biotechnology Journal
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Sampath Kannan has been recognized with awards such as Fellow of the American Association for the Advancement of Science (AAAS) in 2019 and ACM Fellow in 2013. The ACM Fellow designation was awarded for contributions to algorithmic approaches to program reliability, bioinformatics, and service to the computer science research community.

Best Publications

  • Secure data interchange

    Frederick S. M. Herz;Walter Paul Labys;David C. Parkes;Sampath Kannan

  • Designing programs that check their work

    Manuel Blum;Sampath Kannan

  • On graph problems in a semi-streaming model

    Joan Feigenbaum;Sampath Kannan;Andrew McGregor;Siddharth Suri

  • Checking the correctness of memories

    M. Blum;W. Evans;P. Gemmell;S. Kannan

  • Checking the correctness of memories

    M. Blum;W. Evans;P. Gemmell;S. Kannan

  • Designing programs that check their work

    M. Blum;S. Kanna

  • An Approximate L 1 -Difference Algorithm for Massive Data Streams

    Joan Feigenbaum;Sampath Kannan;Martin J. Strauss;Mahesh Viswanathan

  • Implicit representation of graphs

    Sampath Kannan;Moni Naor;Steven Rudich

  • Java-MaC: A Run-Time Assurance Approach for Java Programs

    Moonzoo Kim;Mahesh Viswanathan;Sampath Kannan;Insup Lee

  • Java-MaC: A Run-time Assurance Tool for Java Programs

    Moonjoo Kim;Sampath Kannan;Insup Lee;Oleg Sokolsky

  • Randomized pursuit-evasion in a polygonal environment

    V. Isler;S. Kannan;S. Khanna

  • An approximate L/sup 1/-difference algorithm for massive data streams

    J. Feigenbaum;S. Kannan;M. Strauss;M. Viswanathan

  • Oracles and Queries That Are Sufficient for Exact Learning

    Nader H. Bshouty;Richard Cleve;Ricard Gavaldà;Sampath Kannan

  • A robust model for finding optimal evolutionary trees

    Martin Farach;Sampath Kannan;Tandy J. Warnow

  • Runtime Assurance Based On Formal Specifications

    Insup Lee;Sampath Kannan;Moonjoo Kim;Oleg Sokolsky

  • The relationship between public key encryption and oblivious transfer

    Y. Gertner;S. Kannan;T. Malkin;O. Reingold

  • Formally specified monitoring of temporal properties

    Moonjoo Kim;M. Viswanathan;H. Ben-Abdallah;S. Kannan

  • Communicating Hierarchical State Machines

    Rajeev Alur;Sampath Kannan;Mihalis Yannakakis

  • Graph Distances in the Data-Stream Model

    Joan Feigenbaum;Sampath Kannan;Andrew McGregor;Siddharth Suri

  • Reconstructing strings from random traces

    Tuǧkan Batu;Sampath Kannan;Sanjeev Khanna;Andrew McGregor

  • Spot-checkers

    Funda Ergün;Sampath Kannan;S. Ravi Kumar;Ronitt Rubinfeld

Frequent Co-Authors

Insup Lee
Insup Lee University of Pennsylvania
Mahesh Viswanathan
Mahesh Viswanathan University of Illinois at Urbana-Champaign
Oleg Sokolsky
Oleg Sokolsky University of Pennsylvania
Tandy Warnow
Tandy Warnow University of Illinois at Urbana-Champaign
Sanjeev Khanna
Sanjeev Khanna University of Pennsylvania
Aaron Roth
Aaron Roth University of Pennsylvania
Joan Feigenbaum
Joan Feigenbaum Yale University
Volkan Isler
Volkan Isler University of Minnesota
Andrew McGregor
Andrew McGregor University of Massachusetts Amherst
Martin Farach
Martin Farach New York University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring alternative online degrees and study options can open up numerous career pathways in Computer Science and related fields. Whether you’re looking for a flexible education route or wish to accelerate your entry into the tech workforce, there are several programs to consider.

If you prefer a shorter program, you might be interested in short certificate programs that pay well. These certifications often require less time to complete and can quickly qualify you for high-demand tech jobs.

For those seeking a more advanced credential in a shorter time frame, the shortest masters degree options are available in fields like Computer Science, Data Science, and Cybersecurity. Completing a master's degree swiftly can help you stand out in a competitive job market.

It’s important to choose a program with proven value. The list of most useful graduate degrees highlights programs that employers actively seek, ensuring your investment pays off.

If you’re starting your academic journey, an online associate degree provides foundational knowledge and a stepping stone toward a bachelor’s or entry-level tech roles.

Best Scientists Citing Sampath Kannan

Trending Scientists