| 2025 | SODA | Nearly Tight Bounds on Testing of Metric Properties. | Yiqiao Bao, Sampath Kannan, Erik Waingarten |
| 2024 | ICLR | Oracle Efficient Algorithms for Groupwise Regret. | Krishna Acharya, Eshwar Ram Arunachaleswaran, Sampath Kannan, Aaron Roth, Juba Ziani |
| 2023 | ALT | Reconstructing Ultrametric Trees from Noisy Experiments. | Eshwar Ram Arunachaleswaran, Anindya De, Sampath Kannan |
| 2021 | CCS | Packet Scheduling with Optional Client Privacy. | Andrew Beams, Sampath Kannan, Sebastian Angel |
| 2020 | ICALP | Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation. | Yu Chen, Sampath Kannan, Sanjeev Khanna |
| 2020 | WWW | Near-Perfect Recovery in the One-Dimensional Latent Space Model. | Yu Chen, Sampath Kannan, Sanjeev Khanna |
| 2020 | SODA | Quantifying the Burden of Exploration and the Unfairness of Free Riding. | Christopher Jung, Sampath Kannan, Neil Lutz |
| 2020 | SP | Private resource allocators and their applications. | Sebastian Angel, Sampath Kannan, Zachary B. Ratliff |
| 2019 | RV | A Retrospective Look at the Monitoring and Checking (MaC) Framework. | Sampath Kannan, Moonzoo Kim, Insup Lee, Oleg Sokolsky, Mahesh Viswanathan |
| 2016 | CSL | Hedging Bets in Markov Decision Processes. | Rajeev Alur, Marco Faella, Sampath Kannan, Nimit Singhania |
| 2015 | ICALP | Near-Linear Query Complexity for Graph Inference. | Sampath Kannan, Claire Mathieu, Hang Zhou |
| 2015 | SODA | Approximately Stable, School Optimal, and Student-Truthful Many-to-One Matchings (via Differential Privacy). | Sampath Kannan, Jamie Morgenstern, Aaron Roth, Zhiwei Steven Wu |
| 2013 | LATA | On the Complexity of Shortest Path Problems on Discounted Cost Graphs. | Rajeev Alur, Sampath Kannan, Kevin Tian, Yifei Yuan |
| 2012 | EMNLP | Dynamic Programming for Higher Order Parsing of Gap-Minding Trees. | Emily Pitler, Sampath Kannan, Mitchell Marcus |
| 2012 | FOCS | The Exponential Mechanism for Social Welfare: Private, Truthful, and Nearly Optimal. | Zhiyi Huang, Sampath Kannan |
| 2011 | FOCS | Algorithms for the Generalized Sorting Problem. | Zhiyi Huang, Sampath Kannan, Sanjeev Khanna |
| 2009 | ISAAC | Reconstructing Numbers from Pairwise Function Values. | Shiteng Chen, Zhiyi Huang, Sampath Kannan |
| 2007 | ICALP | Checking and Spot-Checking the Correctness of Priority Queues. | Matthew Chu, Sampath Kannan, Andrew McGregor |
| 2006 | RECOMB | Efficient Enumeration of Phylogenetically Informative Substrings. | Stanislav Angelov, Boulos Harb, Sampath Kannan, Sanjeev Khanna, Junhyong Kim |
| 2006 | SODA | Weighted isotonic regression under the | Stanislav Angelov, Boulos Harb, Sampath Kannan, Li-San Wang |
| 2006 | TACAS | Simulation-Based Graph Similarity. | Oleg Sokolsky, Sampath Kannan, Insup Lee |
| 2005 | ISIT | More on reconstructing strings from random traces: insertions and deletions. | Sampath Kannan, Andrew McGregor |
| 2005 | SODA | Graph distances in the streaming model: the value of space. | Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang |
| 2004 | COLT | Inferring Mixtures of Markov Chains. | Tugkan Batu, Sudipto Guha, Sampath Kannan |
| 2004 | ICALP | On Graph Problems in a Semi-streaming Model. | Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang |
| 2004 | IROS | Sampling based sensor-network deployment. | Volkan Isler, Sampath Kannan, Kostas Daniilidis |
| 2004 | SODA | Reconstructing strings from random traces. | Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andrew McGregor |
| 2004 | SODA | Randomized pursuit-evasion with limited visibility. | Volkan Isler, Sampath Kannan, Sanjeev Khanna |
| 2004 | WABI | Genome Identification and Classification by Short Oligo Arrays. | Stanislav Angelov, Boulos Harb, Sampath Kannan, Sanjeev Khanna, Junhyong Kim, Li-San Wang |
| 2004 | WAFR | Locating and Capturing an Evader in a Polygonal Environment. | Volkan Isler, Sampath Kannan, Sanjeev Khanna |
| 2003 | ICRA | Local exploration: online algorithms and a probabilistic framework. | Volkan Isler, Sampath Kannan, Kostas Daniilidis |
| 2003 | SODA | Selection with monotone comparison cost. | Sampath Kannan, Sanjeev Khanna |
| 2000 | FOCS | The Relationship between Public Key Encryption and Oblivious Transfer. | Yael Gertner, Sampath Kannan, Tal Malkin, Omer Reingold, Mahesh Viswanathan |
| 2000 | ICALP | A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols. | Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson |
| 2000 | SODA | Testing and spot-checking of data streams (extended abstract). | Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan |
| 1999 | ECRTS | Formally specified monitoring of temporal properties. | Moonjoo Kim, Mahesh Viswanathan, Hanne Ben-Abdallah, Sampath Kannan, Insup Lee, Oleg Sokolsky |
| 1999 | FOCS | An Approximate L | Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan |
| 1999 | ICALP | Communicating Hierarchical State Machines. | Rajeev Alur, Sampath Kannan, Mihalis Yannakakis |
| 1999 | PDPTA | Runtime Assurance Based On Formal Specifications. | Insup Lee, Sampath Kannan, Moonjoo Kim, Oleg Sokolsky, Mahesh Viswanathan |
| 1998 | STOC | Spot-Checkers. | Funda Ergn, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, Mahesh Viswanathan |
| 1998 | STACS | Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract). | Joan Feigenbaum, Sampath Kannan, Moshe Y. Vardi, Mahesh Viswanathan |
| 1997 | FOCS | Nearly Tight Bounds on the Learnability of Evolution. | Andris Ambainis, Richard Desper, Martin Farach, Sampath Kannan |
| 1997 | RECOMB | On the complexity and approximation of syntenic distance. | Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li, Z. Sweedyk |
| 1996 | ICALP | A Formal Framework for Evaluating Heuristic Programs. | Lenore Cowen, Joan Feigenbaum, Sampath Kannan |
| 1996 | STOC | Efficient Algorithms for Inverting Evolution. | Martin Farach, Sampath Kannan |
| 1995 | CPM | Of Chicken Teeth and Mouse Eyes, or Generalized Character Compatibility. | Craig J. Benham, Sampath Kannan, Tandy J. Warnow |
| 1995 | SODA | Register Allocation in Structured Programs. | Sampath Kannan, Todd A. Proebsting |
| 1995 | SODA | Counting and Random Generation of Strings in Regular Languages. | Sampath Kannan, Z. Sweedyk, Stephen R. Mahaney |
| 1995 | SODA | A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies when the Number of Character States is Fixed. | Sampath Kannan, Tandy J. Warnow |
| 1995 | SODA | Computing the Local Consensus of Trees. | Sampath Kannan, Tandy J. Warnow, Shibu Yooseph |
| 1994 | COLT | Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract). | Nader H. Bshouty, Richard Cleve, Sampath Kannan, Christino Tamon |
| 1994 | POPL | Call Forwarding: A Simple Interprocedural Optimization Technique for Dynamically Typed Languages. | Koenraad De Bosschere, Saumya K. Debray, David Gudeman, Sampath Kannan |
| 1994 | SODA | Matching Nuts and Bolts. | Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky |
| 1993 | COLT | On the Query Complexity of Learning. | Sampath Kannan |
| 1993 | CPM | An Algorithm for Locating Non-Overlapping Regions of Maximum Alignment Score. | Sampath Kannan, Eugene W. Myers |
| 1993 | STOC | A robust model for finding optimal evolutionary trees. | Martin Farach, Sampath Kannan, Tandy J. Warnow |
| 1993 | WADS | Tree Reconstruction from Partial Orders. | Sampath Kannan, Tandy J. Warnow |
| 1992 | ICLP | Weighted Decision Trees. | Saumya K. Debray, Sampath Kannan, Mukul Paithane |
| 1991 | FOCS | Checking the Correctness of Memories | Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor |
| 1991 | ICALP | Program Checkers for Probability Generation. | Sampath Kannan, Andrew Chi-Chih Yao |
| 1991 | SODA | Triangulating Three-Colored Graphs. | Sampath Kannan, Tandy J. Warnow |
| 1990 | FOCS | Inferring Evolutionary History from DNA Sequences (Extended Abstract) | Sampath Kannan, Tandy J. Warnow |
| 1990 | SODA | Determining the Evolutionary Tree. | Sampath Kannan, Eugene L. Lawler, Tandy J. Warnow |
| 1989 | STOC | Designing Programs That Check Their Work | Manuel Blum, Sampath Kannan |
| 1988 | STOC | Implicit Representation of Graphs | Sampath Kannan, Moni Naor, Steven Rudich |
| 1985 | CRYPTO | A Framework for the Study of Cryptographic Protocols. | Richard Berger, Sampath Kannan, Ren Peralta |