default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSampath Kannan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c98]Eshwar Ram Arunachaleswaran, Natalie Collina, Sampath Kannan, Aaron Roth, Juba Ziani:
Algorithmic Collusion Without Threats. ITCS 2025: 10:1-10:21- [c97]Yiqiao Bao, Sampath Kannan, Erik Waingarten:
Nearly Tight Bounds on Testing of Metric Properties. SODA 2025: 403-445 - 2024
- [c96]Krishna Acharya, Eshwar Ram Arunachaleswaran, Sampath Kannan, Aaron Roth, Juba Ziani:
Oracle Efficient Algorithms for Groupwise Regret. ICLR 2024 - [i28]Eshwar Ram Arunachaleswaran, Natalie Collina, Sampath Kannan, Aaron Roth, Juba Ziani:
Algorithmic Collusion Without Threats. CoRR abs/2409.03956 (2024) - [i27]Yiqiao Bao, Sampath Kannan, Erik Waingarten:
Nearly Tight Bounds on Testing of Metric Properties. CoRR abs/2411.08989 (2024) - 2023
- [c95]Eshwar Ram Arunachaleswaran, Anindya De, Sampath Kannan:
Reconstructing Ultrametric Trees from Noisy Experiments. ALT 2023: 82-114 - [c94]Krishna Acharya, Eshwar Ram Arunachaleswaran, Sampath Kannan, Aaron Roth
, Juba Ziani:
Wealth Dynamics Over Generations: Analysis and Interventions. SaTML 2023: 42-57 - [i26]Krishna Acharya, Eshwar Ram Arunachaleswaran, Sampath Kannan, Aaron Roth, Juba Ziani:
Oracle Efficient Algorithms for Groupwise Regret. CoRR abs/2310.04652 (2023) - 2022
- [j49]Eshwar Ram Arunachaleswaran, Sampath Kannan, Aaron Roth, Juba Ziani:
Pipeline Interventions. Math. Oper. Res. 47(4): 3207-3238 (2022) - [c93]Mingzi Niu, Sampath Kannan, Aaron Roth, Rakesh Vohra:
Best vs. All: Equity and Accuracy of Standardized Test Score Reporting. FAccT 2022: 574-586 - [i25]Eshwar Ram Arunachaleswaran, Anindya De, Sampath Kannan:
Reconstructing Ultrametric Trees from Noisy Experiments. CoRR abs/2206.07672 (2022) - [i24]Krishna Acharya, Eshwar Ram Arunachaleswaran, Sampath Kannan, Aaron Roth, Juba Ziani:
Wealth Dynamics Over Generations: Analysis and Interventions. CoRR abs/2209.07375 (2022) - 2021
- [c92]Andrew Beams, Sampath Kannan, Sebastian Angel:
Packet Scheduling with Optional Client Privacy. CCS 2021: 3415-3430 - [c91]Eshwar Ram Arunachaleswaran, Sampath Kannan, Aaron Roth, Juba Ziani:
Pipeline Interventions. ITCS 2021: 8:1-8:20 - [i23]Sampath Kannan, Mingzi Niu, Aaron Roth, Rakesh Vohra:
Best vs. All: Equity and Accuracy of Standardized Test Score Reporting. CoRR abs/2102.07809 (2021) - 2020
- [c90]Christopher Jung, Sampath Kannan, Neil Lutz:
Service in Your Neighborhood: Fairness in Center Location. FORC 2020: 5:1-5:15 - [c89]Yu Chen, Sampath Kannan, Sanjeev Khanna:
Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation. ICALP 2020: 30:1-30:19 - [c88]Christopher Jung, Sampath Kannan, Changhwa Lee, Mallesh M. Pai, Aaron Roth, Rakesh Vohra:
Fair Prediction with Endogenous Behavior. EC 2020: 677-678 - [c87]Christopher Jung, Sampath Kannan, Neil Lutz:
Quantifying the Burden of Exploration and the Unfairness of Free Riding. SODA 2020: 1892-1904 - [c86]Sebastian Angel, Sampath Kannan, Zachary B. Ratliff:
Private resource allocators and their applications. SP 2020: 372-391 - [c85]Yu Chen, Sampath Kannan, Sanjeev Khanna:
Near-Perfect Recovery in the One-Dimensional Latent Space Model. WWW 2020: 1932-1942 - [i22]Eshwar Ram Arunachaleswaran, Sampath Kannan, Aaron Roth, Juba Ziani:
Pipeline Interventions. CoRR abs/2002.06592 (2020) - [i21]Christopher Jung, Sampath Kannan, Changhwa Lee, Mallesh M. Pai, Aaron Roth, Rakesh Vohra:
Fair Prediction with Endogenous Behavior. CoRR abs/2002.07147 (2020) - [i20]Yu Chen, Sampath Kannan, Sanjeev Khanna:
Near-Perfect Recovery in the One-Dimensional Latent Space Model. CoRR abs/2006.04351 (2020) - [i19]Yu Chen, Sampath Kannan, Sanjeev Khanna:
Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation. CoRR abs/2006.05490 (2020) - [i18]Sebastian Angel, Sampath Kannan, Zachary B. Ratliff:
Private resource allocators and their applications. IACR Cryptol. ePrint Arch. 2020: 287 (2020)
2010 – 2019
- 2019
- [j48]Sampath Kannan, Kevin Tian:
Locating Errors in Faulty Formulas. ACM Trans. Algorithms 15(3): 34:1-34:13 (2019) - [c84]Sampath Kannan, Aaron Roth, Juba Ziani:
Downstream Effects of Affirmative Action. FAT 2019: 240-248 - [c83]Sampath Kannan, Moonzoo Kim, Insup Lee, Oleg Sokolsky, Mahesh Viswanathan:
A Retrospective Look at the Monitoring and Checking (MaC) Framework. RV 2019: 1-14 - [i17]Christopher Jung, Sampath Kannan, Neil Lutz:
A Center in Your Neighborhood: Fairness in Facility Location. CoRR abs/1908.09041 (2019) - 2018
- [j47]Sampath Kannan, Claire Mathieu, Hang Zhou:
Graph Reconstruction and Verification. ACM Trans. Algorithms 14(4): 40:1-40:30 (2018) - [j46]Sampath Kannan, Jamie Morgenstern, Ryan Rogers, Aaron Roth:
Private Pareto Optimal Exchange. ACM Trans. Economics and Comput. 6(3-4): 12:1-12:25 (2018) - [c82]Sampath Kannan, Elchanan Mossel, Swagato Sanyal, Grigory Yaroslavtsev:
Linear Sketching over F_2. CCC 2018: 8:1-8:37 - [c81]Sampath Kannan, Jamie Morgenstern, Aaron Roth, Bo Waggoner, Zhiwei Steven Wu:
A Smoothed Analysis of the Greedy Algorithm for the Linear Contextual Bandit Problem. NeurIPS 2018: 2231-2241 - [i16]Sampath Kannan, Jamie Morgenstern, Aaron Roth, Bo Waggoner, Zhiwei Steven Wu:
A Smoothed Analysis of the Greedy Algorithm for the Linear Contextual Bandit Problem. CoRR abs/1801.03423 (2018) - [i15]Sampath Kannan, Aaron Roth, Juba Ziani:
Downstream Effects of Affirmative Action. CoRR abs/1808.09004 (2018) - [i14]Christopher Jung, Sampath Kannan, Neil Lutz:
Quantifying the Burden of Exploration and the Unfairness of Free Riding. CoRR abs/1810.08743 (2018) - 2017
- [c80]Sampath Kannan, Michael J. Kearns, Jamie Morgenstern, Mallesh M. Pai, Aaron Roth, Rakesh V. Vohra, Zhiwei Steven Wu:
Fairness Incentives for Myopic Agents. EC 2017: 369-386 - [i13]John M. Abowd, Lorenzo Alvisi, Cynthia Dwork, Sampath Kannan, Ashwin Machanavajjhala, Jerome P. Reiter:
Privacy-Preserving Data Analysis for the Federal Statistical Agencies. CoRR abs/1701.00752 (2017) - [i12]Sampath Kannan, Michael J. Kearns, Jamie Morgenstern, Mallesh M. Pai, Aaron Roth, Rakesh V. Vohra, Zhiwei Steven Wu:
Fairness Incentives for Myopic Agents. CoRR abs/1705.02321 (2017) - [i11]Swarat Chaudhuri, Sampath Kannan, Rupak Majumdar, Michael J. Wooldridge:
Game Theory in AI, Logic, and Algorithms (Dagstuhl Seminar 17111). Dagstuhl Reports 7(3): 27-32 (2017) - 2016
- [j45]Deeparnab Chakrabarty, Sampath Kannan, Kevin Tian:
Detecting Character Dependencies in Stochastic Models of Evolution. J. Comput. Biol. 23(3): 180-191 (2016) - [j44]Mark Braverman, Jing Chen, Sampath Kannan:
Optimal Provision-After-Wait in Healthcare. Math. Oper. Res. 41(1): 352-376 (2016) - [j43]Yuk Yee Leung, Pavel P. Kuksa, Alexandre Amlie-Wolf, Otto Valladares, Lyle H. Ungar, Sampath Kannan, Brian D. Gregory, Li-San Wang:
DASHR: database of small human noncoding RNAs. Nucleic Acids Res. 44(Database-Issue): 216-222 (2016) - [c79]Rajeev Alur, Marco Faella, Sampath Kannan, Nimit Singhania:
Hedging Bets in Markov Decision Processes. CSL 2016: 29:1-29:20 - [i10]Sampath Kannan, Elchanan Mossel, Grigory Yaroslavtsev:
Linear Sketching over $\mathbb F_2$. CoRR abs/1611.01879 (2016) - [i9]Elchanan Mossel, Sampath Kannan, Grigory Yaroslavtsev:
Linear Sketching over 𝔽2. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c78]Sampath Kannan, Claire Mathieu, Hang Zhou:
Near-Linear Query Complexity for Graph Inference. ICALP (1) 2015: 773-784 - [c77]Sampath Kannan, Jamie Morgenstern, Ryan M. Rogers, Aaron Roth:
Private Pareto Optimal Exchange. EC 2015: 261-278 - [c76]Sampath Kannan, Jamie Morgenstern, Aaron Roth, Zhiwei Steven Wu:
Approximately Stable, School Optimal, and Student-Truthful Many-to-One Matchings (via Differential Privacy). SODA 2015: 1890-1903 - 2014
- [c75]Mark Braverman, Jing Chen, Sampath Kannan:
Optimal provision-after-wait in healthcare. ITCS 2014: 541-542 - [i8]Sampath Kannan, Claire Mathieu, Hang Zhou:
Graph Verification and Reconstruction via Distance Oracles. CoRR abs/1402.4037 (2014) - [i7]Sampath Kannan, Jamie Morgenstern, Aaron Roth, Zhiwei Steven Wu:
Approximately Stable, School Optimal, and Student-Truthful Many-to-One Matchings (via Differential Privacy). CoRR abs/1407.2640 (2014) - [i6]Sampath Kannan, Jamie Morgenstern, Ryan M. Rogers, Aaron Roth:
Private Pareto Optimal Exchange. CoRR abs/1407.2641 (2014) - 2013
- [j42]Jian Chang, Krishna K. Venkatasubramanian, Andrew G. West, Sampath Kannan, Insup Lee, Boon Thau Loo, Oleg Sokolsky:
AS-CRED: Reputation and Alert Service for Interdomain Routing. IEEE Syst. J. 7(3): 396-409 (2013) - [j41]Emily Pitler, Sampath Kannan, Mitchell Marcus:
Finding Optimal 1-Endpoint-Crossing Trees. Trans. Assoc. Comput. Linguistics 1: 13-24 (2013) - [c74]Rajeev Alur, Sampath Kannan, Kevin Tian, Yifei Yuan:
On the Complexity of Shortest Path Problems on Discounted Cost Graphs. LATA 2013: 44-55 - [i5]Mark Braverman, Jing Chen, Sampath Kannan:
Optimal Provision-After-Wait in Healthcare. CoRR abs/1312.1955 (2013) - 2012
- [c73]Parinya Chalermsook, Julia Chuzhoy, Sampath Kannan, Sanjeev Khanna:
Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply. APPROX-RANDOM 2012: 73-84 - [c72]Emily Pitler, Sampath Kannan, Mitchell Marcus:
Dynamic Programming for Higher Order Parsing of Gap-Minding Trees. EMNLP-CoNLL 2012: 478-488 - [c71]Zhiyi Huang, Sampath Kannan:
The Exponential Mechanism for Social Welfare: Private, Truthful, and Nearly Optimal. FOCS 2012: 140-149 - [i4]Zhiyi Huang, Sampath Kannan:
The Exponential Mechanism for Social Welfare: Private, Truthful, and Nearly Optimal. CoRR abs/1204.1255 (2012) - 2011
- [c70]Zhiyi Huang, Sampath Kannan:
On Sampling from Multivariate Distributions. APPROX-RANDOM 2011: 616-627 - [c69]Jian Chang, Krishna K. Venkatasubramanian, Andrew G. West, Sampath Kannan, Oleg Sokolsky, Myuhng Joo Kim, Insup Lee:
ToMaTo: a trustworthy code mashup development tool. Mashups/Dataview@ECOWS 2011: 5:1-5:8 - [c68]Zhiyi Huang, Sampath Kannan, Sanjeev Khanna:
Algorithms for the Generalized Sorting Problem. FOCS 2011: 738-747 - [c67]Jian Chang, Krishna K. Venkatasubramanian, Andrew G. West, Sampath Kannan, Boon Thau Loo, Oleg Sokolsky, Insup Lee:
AS-TRUST: A Trust Quantification Scheme for Autonomous Systems in BGP. TRUST 2011: 262-276 - [i3]Deeparnab Chakrabarty, Sampath Kannan:
Variance on the Leaves of a Tree Markov Random Field: Detecting Character Dependencies in Phylogenies. CoRR abs/1112.5508 (2011) - 2010
- [c66]Andrew G. West, Sampath Kannan, Insup Lee:
Detecting Wikipedia vandalism via spatio-temporal analysis of revision metadata? EUROSEC 2010: 22-28 - [c65]Andrew G. West, Sampath Kannan, Insup Lee:
Spatio-temporal analysis of Wikipedia metadata and the STiki anti-vandalism tool. Int. Sym. Wikis 2010 - [c64]Andrew G. West, Sampath Kannan, Insup Lee:
STiki: an anti-vandalism tool for Wikipedia using spatio-temporal analysis of revision metadata. Int. Sym. Wikis 2010
2000 – 2009
- 2009
- [j40]Matt Blaze, Sampath Kannan, Insup Lee, Oleg Sokolsky, Jonathan M. Smith, Angelos D. Keromytis, Wenke Lee:
Dynamic Trust Management. Computer 42(2): 44-52 (2009) - [c63]Andrew G. West, Adam J. Aviv, Jian Chang, Vinayak S. Prabhu, Matt Blaze, Sampath Kannan, Insup Lee, Jonathan M. Smith, Oleg Sokolsky:
QuanTM: a quantitative trust management system. EUROSEC 2009: 28-35 - [c62]Shiteng Chen, Zhiyi Huang, Sampath Kannan:
Reconstructing Numbers from Pairwise Function Values. ISAAC 2009: 142-152 - 2008
- [j39]Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang:
Graph Distances in the Data-Stream Model. SIAM J. Comput. 38(5): 1709-1727 (2008) - [c61]Sampath Kannan, Sanjeev Khanna, Sudeepa Roy:
STCON in Directed Unique-Path Graphs. FSTTCS 2008: 256-267 - 2007
- [j38]Stanislav Angelov, Boulos Harb, Sampath Kannan, Sanjeev Khanna, Junhyong Kim:
Efficient Enumeration of Phylogenetically Informative Substrings. J. Comput. Biol. 14(6): 701-723 (2007) - [c60]Matthew Chu, Sampath Kannan, Andrew McGregor:
Checking and Spot-Checking the Correctness of Priority Queues. ICALP 2007: 728-739 - 2006
- [j37]Volkan Isler, Sampath Kannan, Sanjeev Khanna:
Randomized Pursuit-Evasion with Local Visibility. SIAM J. Discret. Math. 20(1): 26-41 (2006) - [c59]Stanislav Angelov, Boulos Harb, Sampath Kannan, Sanjeev Khanna, Junhyong Kim:
Efficient Enumeration of Phylogenetically Informative Substrings. RECOMB 2006: 248-264 - [c58]Stanislav Angelov, Boulos Harb, Sampath Kannan, Li-San Wang:
Weighted isotonic regression under the L1 norm. SODA 2006: 783-791 - [c57]Oleg Sokolsky, Sampath Kannan, Insup Lee:
Simulation-Based Graph Similarity. TACAS 2006: 426-440 - [i2]Madhukar Anand, Eric Cronin, Micah Sherr, Matt Blaze, Sampath Kannan:
Security Protocols with Isotropic Channels. IACR Cryptol. ePrint Arch. 2006: 396 (2006) - 2005
- [j36]Joan Feigenbaum, Sampath Kannan, Jian Zhang:
Computing Diameter in the Streaming and Sliding-Window Models. Algorithmica 41(1): 25-41 (2005) - [j35]Jessica H. Fong, Anna C. Gilbert, Sampath Kannan, Martin J. Strauss:
Better Alternatives to OSPF Routing. Algorithmica 43(1-2): 113-131 (2005) - [j34]Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang:
On graph problems in a semi-streaming model. Theor. Comput. Sci. 348(2-3): 207-216 (2005) - [j33]Volkan Isler, Sampath Kannan, Sanjeev Khanna:
Randomized pursuit-evasion in a polygonal environment. IEEE Trans. Robotics 21(5): 875-884 (2005) - [c56]Boulos Harb, Sampath Kannan, Andrew McGregor:
Approximating the Best-Fit Tree Under Lp Norms. APPROX-RANDOM 2005: 123-133 - [c55]Sampath Kannan, Andrew McGregor:
More on reconstructing strings from random traces: insertions and deletions. ISIT 2005: 297-301 - [c54]Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang:
Graph distances in the streaming model: the value of space. SODA 2005: 745-754 - [c53]Arvind Easwaran, Sampath Kannan, Oleg Sokolsky:
Steering of Discrete Event Systems: Control Theory Approach. RV@CAV 2005: 21-39 - 2004
- [j32]Moonzoo Kim, Mahesh Viswanathan, Sampath Kannan, Insup Lee, Oleg Sokolsky:
Java-MaC: A Run-Time Assurance Approach for Java Programs. Formal Methods Syst. Des. 24(2): 129-155 (2004) - [j31]Rajeev Alur, Sampath Kannan, Salvatore La Torre:
Polyhedral Flows in Hybrid Automata. Formal Methods Syst. Des. 24(3): 261-280 (2004) - [j30]Sampath Kannan, Mihalis Yannakakis:
Guest Editors' foreword. J. Comput. Syst. Sci. 68(2): 237 (2004) - [j29]Volkan Isler, Sampath Kannan, Kostas Daniilidis, Pavel Valtr:
VC-Dimension of Exterior Visibility. IEEE Trans. Pattern Anal. Mach. Intell. 26(5): 667-671 (2004) - [j28]Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson:
A bound on the capacity of backoff and acknowledgment-based protocols. SIAM J. Comput. 33(2): 313-331 (2004) - [c52]Tugkan Batu, Sudipto Guha, Sampath Kannan:
Inferring Mixtures of Markov Chains. COLT 2004: 186-199 - [c51]Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang:
On Graph Problems in a Semi-streaming Model. ICALP 2004: 531-543 - [c50]Volkan Isler, Sampath Kannan, Kostas Daniilidis:
Sampling based sensor-network deployment. IROS 2004: 1780-1785 - [c49]Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andrew McGregor:
Reconstructing strings from random traces. SODA 2004: 910-918 - [c48]Volkan Isler, Sampath Kannan, Sanjeev Khanna:
Randomized pursuit-evasion with limited visibility. SODA 2004: 1060-1069 - [c47]Stanislav Angelov, Boulos Harb, Sampath Kannan, Sanjeev Khanna, Junhyong Kim, Li-San Wang:
Genome Identification and Classification by Short Oligo Arrays. WABI 2004: 400-411 - [c46]Volkan Isler, Sampath Kannan, Sanjeev Khanna:
Locating and Capturing an Evader in a Polygonal Environment. WAFR 2004: 251-266 - 2003
- [c45]Volkan Isler, Sampath Kannan, Kostas Daniilidis:
Local exploration: online algorithms and a probabilistic framework. ICRA 2003: 1913-1920 - [c44]Sampath Kannan, Sanjeev Khanna:
Selection with monotone comparison cost. SODA 2003: 10-17 - 2002
- [j27]Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan:
Testing and Spot-Checking of Data Streams. Algorithmica 34(1): 67-80 (2002) - [j26]Richard J. Anderson, Sampath Kannan, Howard J. Karloff, Richard E. Ladner:
Thresholds and optimal binary comparison search trees. J. Algorithms 44(2): 338-358 (2002) - [j25]Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan:
An Approximate L1-Difference Algorithm for Massive Data Streams. SIAM J. Comput. 32(1): 131-151 (2002) - [c43]Moonjoo Kim, Sampath Kannan, Insup Lee, Oleg Sokolsky, Mahesh Viswanathan:
Computational Analysis of Run-time Monitoring - Fundamentals of Java-MaC. RV@FLoC 2002: 80-94 - 2001
- [c42]Richard J. Anderson, Sampath Kannan, Howard J. Karloff, Richard E. Ladner:
Thresholds and Optimal Binary Comparison Search Trees. FSTTCS 2001: 83-95 - [c41]Moonjoo Kim, Sampath Kannan, Insup Lee, Oleg Sokolsky, Mahesh Viswanathan:
Java-MaC: a Run-time Assurance Tool for Java Programs. RV@CAV 2001: 218-235 - 2000
- [j24]Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, Mahesh Viswanathan:
Spot-Checkers. J. Comput. Syst. Sci. 60(3): 717-751 (2000) - [c40]Yael Gertner, Sampath Kannan, Tal Malkin, Omer Reingold, Mahesh Viswanathan:
The Relationship between Public Key Encryption and Oblivious Transfer. FOCS 2000: 325-335 - [c39]Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson:
A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols. ICALP 2000: 705-716 - [c38]Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan:
Testing and spot-checking of data streams (extended abstract). SODA 2000: 165-174
1990 – 1999
- 1999
- [j23]Joan Feigenbaum, Sampath Kannan, Moshe Y. Vardi, Mahesh Viswanathan:
The Complexity of Problems on Graphs Represented as OBDDs. Chic. J. Theor. Comput. Sci. 1999 (1999) - [j22]Martin Farach, Sampath Kannan:
Efficient Algorithms for Inverting Evolution. J. ACM 46(4): 437-449 (1999) - [c37]Moonjoo Kim, Mahesh Viswanathan, Hanêne Ben-Abdallah, Sampath Kannan, Insup Lee, Oleg Sokolsky:
Formally specified monitoring of temporal properties. ECRTS 1999: 114-122 - [c36]Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan:
An Approximate L1-Difference Algorithm for Massive Data Streams. FOCS 1999: 501-511 - [c35]Rajeev Alur, Sampath Kannan, Salvatore La Torre:
Polyhedral Flows in Hybrid Automata. HSCC 1999: 5-18 - [c34]Rajeev Alur, Sampath Kannan, Mihalis Yannakakis:
Communicating Hierarchical State Machines. ICALP 1999: 169-178 - [c33]Insup Lee, Sampath Kannan, Moonjoo Kim, Oleg Sokolsky, Mahesh Viswanathan:
Runtime Assurance Based On Formal Specifications. PDPTA 1999: 279-287 - [c32]Oleg Sokolsky, Sampath Kannan, Moonjoo Kim, Insup Lee, Mahesh Viswanathan:
Steering of real-time systems based on monitoring and checking. WORDS (Fall) 1999: 11-18 - [r1]Charles H. Goldberg, Jianer Chen, Viera Krnanová Proulx, Joan Feigenbaum, Sampath Kannan:
Information Structures. Handbook of Discrete and Combinatorial Mathematics 1999 - 1998
- [j21]Lenore Cowen, Joan Feigenbaum, Sampath Kannan:
A Formal Framework for Evaluating Heuristic Programs. Ann. Math. Artif. Intell. 22(3-4): 193-206 (1998) - [j20]Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li, Elizabeth Sweedyk:
On the Complexity and Approximation of Syntenic Distance. Discret. Appl. Math. 88(1-3): 59-82 (1998) - [j19]Sampath Kannan, Todd A. Proebsting:
Register Allocation in Structured Programs. J. Algorithms 29(2): 223-237 (1998) - [j18]Sampath Kannan, Tandy J. Warnow:
Computing the Local Consensus of Trees. SIAM J. Comput. 27(6): 1695-1724 (1998) - [c31]Joan Feigenbaum, Sampath Kannan, Moshe Y. Vardi, Mahesh Viswanathan:
Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract). STACS 1998: 216-226 - [c30]Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, Mahesh Viswanathan:
Spot-Checkers. STOC 1998: 259-268 - 1997
- [j17]Vivek Gore, Mark Jerrum, Sampath Kannan, Z. Sweedyk, Stephen R. Mahaney:
A Quasi-Polynomial-Time Algorithm for Sampling Words from a Context-Free Language. Inf. Comput. 134(1): 59-74 (1997) - [j16]Sampath Kannan, Tandy J. Warnow:
A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies. SIAM J. Comput. 26(6): 1749-1763 (1997) - [c29]Andris Ambainis, Richard Desper, Martin Farach, Sampath Kannan:
Nearly Tight Bounds on the Learnability of Evolution. FOCS 1997: 524-533 - [c28]Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li, Z. Sweedyk:
On the complexity and approximation of syntenic distance. RECOMB 1997: 99-108 - [c27]Martin Farach, Sampath Kannan, E. Knill, S. Muthukrishnan:
Group testing problems with sequences in experimental molecular biology. SEQUENCES 1997: 357-367 - 1996
- [j15]Sampath Kannan, Eugene L. Lawler, Tandy J. Warnow:
Determining the Evolutionary Tree Using Experiments. J. Algorithms 21(1): 26-50 (1996) - [j14]Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon:
Oracles and Queries That Are Sufficient for Exact Learning. J. Comput. Syst. Sci. 52(3): 421-433 (1996) - [j13]Sampath Kannan, Eugene W. Myers:
An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score. SIAM J. Comput. 25(3): 648-662 (1996) - [c26]Lenore Cowen, Joan Feigenbaum, Sampath Kannan:
A Formal Framework for Evaluating Heuristic Programs. ICALP 1996: 634-645 - [c25]Martin Farach, Sampath Kannan:
Efficient Algorithms for Inverting Evolution. STOC 1996: 230-236 - 1995
- [j12]Martin Farach, Sampath Kannan, Tandy J. Warnow:
A Robust Model for Finding Optimal Evolutionary Trees. Algorithmica 13(1/2): 155-179 (1995) - [j11]Manuel Blum, Sampath Kannan:
Designing Programs that Check Their Work. J. ACM 42(1): 269-291 (1995) - [j10]Craig J. Benham, Sampath Kannan, Michael Paterson, Tandy J. Warnow:
Hen's Teeth and Whale's Feet: Generalized Characters and Their Compatibility. J. Comput. Biol. 2(4): 515-525 (1995) - [j9]Sampath Kannan, Tandy J. Warnow:
Tree Reconstruction from Partial Orders. SIAM J. Comput. 24(3): 511-519 (1995) - [c24]Craig J. Benham, Sampath Kannan, Tandy J. Warnow:
Of Chicken Teeth and Mouse Eyes, or Generalized Character Compatibility. CPM 1995: 17-26 - [c23]Sandip K. Biswas, Sampath Kannan:
Minimizing Space Usage in Evaluation of Expression Trees. FSTTCS 1995: 377-390 - [c22]Sampath Kannan, Tandy J. Warnow, Shibu Yooseph:
Computing the Local Consensus of Trees. SODA 1995: 68-77 - [c21]Sampath Kannan, Todd A. Proebsting:
Register Allocation in Structured Programs. SODA 1995: 360-368 - [c20]Sampath Kannan, Z. Sweedyk, Stephen R. Mahaney:
Counting and Random Generation of Strings in Regular Languages. SODA 1995: 551-557 - [c19]Sampath Kannan, Tandy J. Warnow:
A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies when the Number of Character States is Fixed. SODA 1995: 595-603 - [i1]Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon:
Oracles and Queries That Are Sufficient for Exact Learning. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [j8]Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor:
Checking the Correctness of Memories. Algorithmica 12(2/3): 225-244 (1994) - [j7]Sampath Kannan, Tandy J. Warnow:
Inferring Evolutionary History from DNA Sequences. SIAM J. Comput. 23(4): 713-737 (1994) - [j6]Sampath Kannan, Todd A. Proebsting:
Short Communication: Correction to 'Producing Good Code for the case Statement'. Softw. Pract. Exp. 24(2): 233 (1994) - [c18]Nader H. Bshouty, Richard Cleve, Sampath Kannan, Christino Tamon:
Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract). COLT 1994: 130-139 - [c17]Koenraad De Bosschere, Saumya K. Debray, David Gudeman, Sampath Kannan:
Call Forwarding: A Simple Interprocedural Optimization Technique for Dynamically Typed Languages. POPL 1994: 409-420 - [c16]Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky:
Matching Nuts and Bolts. SODA 1994: 690-696 - 1993
- [j5]Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha:
Two Probabilistic Results on Merging. SIAM J. Comput. 22(2): 261-271 (1993) - [c15]Sampath Kannan:
On the Query Complexity of Learning. COLT 1993: 58-66 - [c14]Sampath Kannan, Eugene W. Myers:
An Algorithm for Locating Non-Overlapping Regions of Maximum Alignment Score. CPM 1993: 74-86 - [c13]Martin Farach, Sampath Kannan, Tandy J. Warnow:
A robust model for finding optimal evolutionary trees. STOC 1993: 137-145 - [c12]Sampath Kannan, Tandy J. Warnow:
Tree Reconstruction from Partial Orders. WADS 1993: 397-408 - 1992
- [j4]Sampath Kannan, Danny Soroker:
Tiling Polygons with Parallelograms. Discret. Comput. Geom. 7: 175-188 (1992) - [j3]Sampath Kannan, Tandy J. Warnow:
Triangulating 3-Colored Graphs. SIAM J. Discret. Math. 5(2): 249-258 (1992) - [j2]Sampath Kannan, Moni Naor, Steven Rudich:
Implicit Representation of Graphs. SIAM J. Discret. Math. 5(4): 596-603 (1992) - [c11]Saumya K. Debray, Sampath Kannan, Mukul Paithane:
Weighted Decision Trees. JICSLP 1992: 654-668 - 1991
- [c10]Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor:
Checking the Correctness of Memories. FOCS 1991: 90-99 - [c9]Sampath Kannan, Andrew Chi-Chih Yao:
Program Checkers for Probability Generation. ICALP 1991: 163-173 - [c8]Sampath Kannan, Tandy J. Warnow:
Triangulating Three-Colored Graphs. SODA 1991: 337-343 - 1990
- [c7]Joan Feigenbaum, Sampath Kannan, Noam Nisan:
Lower Bounds on Random-Self-Reducibility. SCT 1990: 100-109 - [c6]Sampath Kannan, Tandy J. Warnow:
Inferring Evolutionary History from DNA Sequences (Extended Abstract). FOCS 1990: 362-371 - [c5]Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha:
Two Probabilistic Results on Merging. SIGAL International Symposium on Algorithms 1990: 118-127 - [c4]Sampath Kannan, Eugene L. Lawler, Tandy J. Warnow:
Determining the Evolutionary Tree. SODA 1990: 475-484
1980 – 1989
- 1989
- [b1]Sampath Kannan:
Program checkers for algebraic problems. University Berkeley, TR ICSI - International Computer Science Institute / Berkeley 89-064, 1989, pp. I-II, 1-58 - [c3]Manuel Blum, Sampath Kannan:
Designing Programs That Check Their Work. STOC 1989: 86-97 - 1988
- [j1]Gilles Brassard, Sampath Kannan:
The Generation of Random Permutations on the Fly. Inf. Process. Lett. 28(4): 207-212 (1988) - [c2]Sampath Kannan, Moni Naor, Steven Rudich:
Implicit Representation of Graphs. STOC 1988: 334-343 - 1985
- [c1]Richard Berger, Sampath Kannan, René Peralta:
A Framework for the Study of Cryptographic Protocols. CRYPTO 1985: 87-103
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-13 01:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
