| 2008 |
|---|
| 95 | EE | Sampath Kannan,
Sanjeev Khanna,
Sudeepa Roy:
STCON in Directed Unique-Path Graphs.
FSTTCS 2008 |
| 94 | EE | 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) |
| 2007 |
|---|
| 93 | EE | Matthew Chu,
Sampath Kannan,
Andrew McGregor:
Checking and Spot-Checking the Correctness of Priority Queues.
ICALP 2007: 728-739 |
| 92 | EE | Stanislav Angelov,
Boulos Harb,
Sampath Kannan,
Sanjeev Khanna,
Junhyong Kim:
Efficient Enumeration of Phylogenetically Informative Substrings.
Journal of Computational Biology 14(6): 701-723 (2007) |
| 2006 |
|---|
| 91 | EE | Stanislav Angelov,
Boulos Harb,
Sampath Kannan,
Sanjeev Khanna,
Junhyong Kim:
Efficient Enumeration of Phylogenetically Informative Substrings.
RECOMB 2006: 248-264 |
| 90 | EE | Stanislav Angelov,
Boulos Harb,
Sampath Kannan,
Li-San Wang:
Weighted isotonic regression under the L1 norm.
SODA 2006: 783-791 |
| 89 | EE | Oleg Sokolsky,
Sampath Kannan,
Insup Lee:
Simulation-Based Graph Similarity.
TACAS 2006: 426-440 |
| 88 | EE | Arvind Easwaran,
Sampath Kannan,
Oleg Sokolsky:
Steering of Discrete Event Systems: Control Theory Approach.
Electr. Notes Theor. Comput. Sci. 144(4): 21-39 (2006) |
| 87 | EE | Volkan Isler,
Sampath Kannan,
Sanjeev Khanna:
Randomized Pursuit-Evasion with Local Visibility.
SIAM J. Discrete Math. 20(1): 26-41 (2006) |
| 2005 |
|---|
| 86 | EE | Boulos Harb,
Sampath Kannan,
Andrew McGregor:
Approximating the Best-Fit Tree Under Lp Norms.
APPROX-RANDOM 2005: 123-133 |
| 85 | EE | Joan Feigenbaum,
Sampath Kannan,
Andrew McGregor,
Siddharth Suri,
Jian Zhang:
Graph distances in the streaming model: the value of space.
SODA 2005: 745-754 |
| 84 | EE | Jessica H. Fong,
Anna C. Gilbert,
Sampath Kannan,
Martin J. Strauss:
Better Alternatives to OSPF Routing.
Algorithmica 43(1-2): 113-131 (2005) |
| 83 | EE | 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) |
| 2004 |
|---|
| 82 | EE | Tugkan Batu,
Sudipto Guha,
Sampath Kannan:
Inferring Mixtures of Markov Chains.
COLT 2004: 186-199 |
| 81 | EE | Joan Feigenbaum,
Sampath Kannan,
Andrew McGregor,
Siddharth Suri,
Jian Zhang:
On Graph Problems in a Semi-streaming Model.
ICALP 2004: 531-543 |
| 80 | EE | Volkan Isler,
Sampath Kannan,
Sanjeev Khanna:
Randomized pursuit-evasion with limited visibility.
SODA 2004: 1060-1069 |
| 79 | EE | Tugkan Batu,
Sampath Kannan,
Sanjeev Khanna,
Andrew McGregor:
Reconstructing strings from random traces.
SODA 2004: 910-918 |
| 78 | EE | 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 |
| 77 | EE | Joan Feigenbaum,
Sampath Kannan,
Jian Zhang:
Computing Diameter in the Streaming and Sliding-Window Models.
Algorithmica 41(1): 25-41 (2004) |
| 76 | EE | Moonzoo Kim,
Mahesh Viswanathan,
Sampath Kannan,
Insup Lee,
Oleg Sokolsky:
Java-MaC: A Run-Time Assurance Approach for Java Programs.
Formal Methods in System Design 24(2): 129-155 (2004) |
| 75 | EE | Rajeev Alur,
Sampath Kannan,
Salvatore La Torre:
Polyhedral Flows in Hybrid Automata.
Formal Methods in System Design 24(3): 261-280 (2004) |
| 74 | EE | Volkan Isler,
Sampath Kannan,
Kostas Daniilidis,
Pavel Valtr:
VC-Dimension of Exterior Visibility.
IEEE Trans. Pattern Anal. Mach. Intell. 26(5): 667-671 (2004) |
| 73 | EE | Sampath Kannan,
Mihalis Yannakakis:
Guest Editors' foreword.
J. Comput. Syst. Sci. 68(2): 237 (2004) |
| 72 | EE | 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) |
| 2003 |
|---|
| 71 | | Volkan Isler,
Sampath Kannan,
Kostas Daniilidis:
Local exploration: online algorithms and a probabilistic framework.
ICRA 2003: 1913-1920 |
| 70 | EE | Sampath Kannan,
Sanjeev Khanna:
Selection with monotone comparison cost.
SODA 2003: 10-17 |
| 2002 |
|---|
| 69 | EE | Joan Feigenbaum,
Sampath Kannan,
Martin Strauss,
Mahesh Viswanathan:
Testing and Spot-Checking of Data Streams.
Algorithmica 34(1): 67-80 (2002) |
| 68 | EE | Moonjoo Kim,
Sampath Kannan,
Insup Lee,
Oleg Sokolsky,
Mahesh Viswanathan:
Computational Analysis of Run-time Monitoring - Fundamentals of Java-MaC.
Electr. Notes Theor. Comput. Sci. 70(4): (2002) |
| 67 | EE | 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) |
| 66 | EE | 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) |
| 2001 |
|---|
| 65 | EE | Richard J. Anderson,
Sampath Kannan,
Howard J. Karloff,
Richard E. Ladner:
Thresholds and Optimal Binary Comparison Search Trees.
FSTTCS 2001: 83-95 |
| 64 | EE | Moonjoo Kim,
Sampath Kannan,
Insup Lee,
Oleg Sokolsky,
Mahesh Viswanathan:
Java-MaC: a Run-time Assurance Tool for Java Programs.
Electr. Notes Theor. Comput. Sci. 55(2): (2001) |
| 2000 |
|---|
| 63 | | Yael Gertner,
Sampath Kannan,
Tal Malkin,
Omer Reingold,
Mahesh Viswanathan:
The Relationship between Public Key Encryption and Oblivious Transfer.
FOCS 2000: 325-335 |
| 62 | EE | Leslie Ann Goldberg,
Mark Jerrum,
Sampath Kannan,
Mike Paterson:
A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols.
ICALP 2000: 705-716 |
| 61 | EE | Joan Feigenbaum,
Sampath Kannan,
Martin Strauss,
Mahesh Viswanathan:
Testing and spot-checking of data streams (extended abstract).
SODA 2000: 165-174 |
| 60 | | Funda Ergün,
Sampath Kannan,
Ravi Kumar,
Ronitt Rubinfeld,
Mahesh Viswanathan:
Spot-Checkers.
J. Comput. Syst. Sci. 60(3): 717-751 (2000) |
| 1999 |
|---|
| 59 | EE | Moonjoo Kim,
Mahesh Viswanathan,
Hanêne Ben-Abdallah,
Sampath Kannan,
Insup Lee,
Oleg Sokolsky:
Formally specified monitoring of temporal properties.
ECRTS 1999: 114-122 |
| 58 | EE | Joan Feigenbaum,
Sampath Kannan,
Martin Strauss,
Mahesh Viswanathan:
An Approximate L1-Difference Algorithm for Massive Data Streams.
FOCS 1999: 501-511 |
| 57 | EE | Rajeev Alur,
Sampath Kannan,
Salvatore La Torre:
Polyhedral Flows in Hybrid Automata.
HSCC 1999: 5-18 |
| 56 | EE | Rajeev Alur,
Sampath Kannan,
Mihalis Yannakakis:
Communicating Hierarchical State Machines.
ICALP 1999: 169-178 |
| 55 | | Insup Lee,
Sampath Kannan,
Moonjoo Kim,
Oleg Sokolsky,
Mahesh Viswanathan:
Runtime Assurance Based On Formal Specifications.
PDPTA 1999: 279-287 |
| 54 | EE | Joan Feigenbaum,
Sampath Kannan,
Moshe Y. Vardi,
Mahesh Viswanathan:
The Complexity of Problems on Graphs Represented as OBDDs.
Chicago J. Theor. Comput. Sci. 1999: (1999) |
| 53 | EE | Martin Farach,
Sampath Kannan:
Efficient Algorithms for Inverting Evolution.
J. ACM 46(4): 437-449 (1999) |
| 1998 |
|---|
| 52 | | Joan Feigenbaum,
Sampath Kannan,
Moshe Y. Vardi,
Mahesh Viswanathan:
Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract).
STACS 1998: 216-226 |
| 51 | EE | Funda Ergün,
Sampath Kannan,
Ravi Kumar,
Ronitt Rubinfeld,
Mahesh Viswanathan:
Spot-Checkers.
STOC 1998: 259-268 |
| 50 | | Lenore Cowen,
Joan Feigenbaum,
Sampath Kannan:
A Formal Framework for Evaluating Heuristic Programs.
Ann. Math. Artif. Intell. 22(3-4): 193-206 (1998) |
| 49 | EE | Bhaskar DasGupta,
Tao Jiang,
Sampath Kannan,
Ming Li,
Elizabeth Sweedyk:
On the Complexity and Approximation of Syntenic Distance.
Discrete Applied Mathematics 88(1-3): 59-82 (1998) |
| 48 | | Sampath Kannan,
Todd A. Proebsting:
Register Allocation in Structured Programs.
J. Algorithms 29(2): 223-237 (1998) |
| 47 | EE | Sampath Kannan,
Tandy Warnow:
Computing the Local Consensus of Trees.
SIAM J. Comput. 27(6): 1695-1724 (1998) |
| 1997 |
|---|
| 46 | EE | Andris Ambainis,
Richard Desper,
Martin Farach,
Sampath Kannan:
Nearly Tight Bounds on the Learnability of Evolution.
FOCS 1997: 524-533 |
| 45 | EE | Bhaskar DasGupta,
Tao Jiang,
Sampath Kannan,
Ming Li,
Z. Sweedyk:
On the complexity and approximation of syntenic distance.
RECOMB 1997: 99-108 |
| 44 | | 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) |
| 43 | | Sampath Kannan,
Tandy Warnow:
A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies.
SIAM J. Comput. 26(6): 1749-1763 (1997) |
| 1996 |
|---|
| 42 | | Lenore Cowen,
Joan Feigenbaum,
Sampath Kannan:
A Formal Framework for Evaluating Heuristic Programs.
ICALP 1996: 634-645 |
| 41 | EE | Martin Farach,
Sampath Kannan:
Efficient Algorithms for Inverting Evolution.
STOC 1996: 230-236 |
| 40 | | Sampath Kannan,
Eugene L. Lawler,
Tandy Warnow:
Determining the Evolutionary Tree Using Experiments.
J. Algorithms 21(1): 26-50 (1996) |
| 39 | | 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) |
| 38 | | Sampath Kannan,
Eugene W. Myers:
An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score.
SIAM J. Comput. 25(3): 648-662 (1996) |
| 1995 |
|---|
| 37 | | Craig J. Benham,
Sampath Kannan,
Tandy Warnow:
Of Chicken Teeth and Mouse Eyes, or Generalized Character Compatibility.
CPM 1995: 17-26 |
| 36 | | Sandip K. Biswas,
Sampath Kannan:
Minimizing Space Usage in Evaluation of Expression Trees.
FSTTCS 1995: 377-390 |
| 35 | | Sampath Kannan,
Todd A. Proebsting:
Register Allocation in Structured Programs.
SODA 1995: 360-368 |
| 34 | | Sampath Kannan,
Z. Sweedyk,
Stephen R. Mahaney:
Counting and Random Generation of Strings in Regular Languages.
SODA 1995: 551-557 |
| 33 | | Sampath Kannan,
Tandy Warnow:
A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies when the Number of Character States is Fixed.
SODA 1995: 595-603 |
| 32 | | Sampath Kannan,
Tandy Warnow,
Shibu Yooseph:
Computing the Local Consensus of Trees.
SODA 1995: 68-77 |
| 31 | | Martin Farach,
Sampath Kannan,
Tandy Warnow:
A Robust Model for Finding Optimal Evolutionary Trees.
Algorithmica 13(1/2): 155-179 (1995) |
| 30 | EE | Nader H. Bshouty,
Richard Cleve,
Ricard Gavaldà,
Sampath Kannan,
Christino Tamon:
Oracles and Queries That Are Sufficient for Exact Learning
Electronic Colloquium on Computational Complexity (ECCC) 2(15): (1995) |
| 29 | EE | Manuel Blum,
Sampath Kannan:
Designing Programs that Check Their Work.
J. ACM 42(1): 269-291 (1995) |
| 28 | | Craig J. Benham,
Sampath Kannan,
Michael Paterson,
Tandy Warnow:
Hen's Teeth and Whale's Feet: Generalized Characters and Their Compatibility.
Journal of Computational Biology 2(4): 515-525 (1995) |
| 27 | | Sampath Kannan,
Tandy Warnow:
Tree Reconstruction from Partial Orders.
SIAM J. Comput. 24(3): 511-519 (1995) |
| 1994 |
|---|
| 26 | EE | Nader H. Bshouty,
Richard Cleve,
Sampath Kannan,
Christino Tamon:
Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract).
COLT 1994: 130-139 |
| 25 | | 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 |
| 24 | | Noga Alon,
Manuel Blum,
Amos Fiat,
Sampath Kannan,
Moni Naor,
Rafail Ostrovsky:
Matching Nuts and Bolts.
SODA 1994: 690-696 |
| 23 | | Manuel Blum,
William S. Evans,
Peter Gemmell,
Sampath Kannan,
Moni Naor:
Checking the Correctness of Memories.
Algorithmica 12(2/3): 225-244 (1994) |
| 22 | | Sampath Kannan,
Tandy Warnow:
Inferring Evolutionary History from DNA Sequences.
SIAM J. Comput. 23(4): 713-737 (1994) |
| 21 | | Sampath Kannan,
Todd A. Proebsting:
Short Communication: Correction to 'Producing Good Code for the case Statement'.
Softw., Pract. Exper. 24(2): 233, (1994) |
| 1993 |
|---|
| 20 | EE | Sampath Kannan:
On the Query Complexity of Learning.
COLT 1993: 58-66 |
| 19 | | Sampath Kannan,
Eugene W. Myers:
An Algorithm for Locating Non-Overlapping Regions of Maximum Alignment Score.
CPM 1993: 74-86 |
| 18 | EE | Martin Farach,
Sampath Kannan,
Tandy Warnow:
A robust model for finding optimal evolutionary trees.
STOC 1993: 137-145 |
| 17 | | Sampath Kannan,
Tandy Warnow:
Tree Reconstruction from Partial Orders.
WADS 1993: 397-408 |
| 16 | | Wenceslas Fernandez de la Vega,
Sampath Kannan,
Miklos Santha:
Two Probabilistic Results on Merging.
SIAM J. Comput. 22(2): 261-271 (1993) |
| 1992 |
|---|
| 15 | | Saumya K. Debray,
Sampath Kannan,
Mukul Paithane:
Weighted Decision Trees.
JICSLP 1992: 654-668 |
| 14 | | Sampath Kannan,
Danny Soroker:
Tiling Polygons with Parallelograms.
Discrete & Computational Geometry 7: 175-188 (1992) |
| 13 | | Sampath Kannan,
Tandy Warnow:
Triangulating 3-Colored Graphs.
SIAM J. Discrete Math. 5(2): 249-258 (1992) |
| 12 | | Sampath Kannan,
Moni Naor,
Steven Rudich:
Implicit Representation of Graphs.
SIAM J. Discrete Math. 5(4): 596-603 (1992) |
| 1991 |
|---|
| 11 | | Manuel Blum,
William S. Evans,
Peter Gemmell,
Sampath Kannan,
Moni Naor:
Checking the Correctness of Memories
FOCS 1991: 90-99 |
| 10 | | Sampath Kannan,
Andrew Chi-Chih Yao:
Program Checkers for Probability Generation.
ICALP 1991: 163-173 |
| 9 | | Sampath Kannan,
Tandy Warnow:
Triangulating Three-Colored Graphs.
SODA 1991: 337-343 |
| 1990 |
|---|
| 8 | | Sampath Kannan,
Tandy Warnow:
Inferring Evolutionary History from DNA Sequences (Extended Abstract)
FOCS 1990: 362-371 |
| 7 | | Wenceslas Fernandez de la Vega,
Sampath Kannan,
Miklos Santha:
Two Probabilistic Results on Merging.
SIGAL International Symposium on Algorithms 1990: 118-127 |
| 6 | | Sampath Kannan,
Eugene L. Lawler,
Tandy Warnow:
Determining the Evolutionary Tree.
SODA 1990: 475-484 |
| 5 | | Joan Feigenbaum,
Sampath Kannan,
Noam Nisan:
Lower Bounds on Random-Self-Reducibility.
Structure in Complexity Theory Conference 1990: 100-109 |
| 1989 |
|---|
| 4 | | Manuel Blum,
Sampath Kannan:
Designing Programs That Check Their Work
STOC 1989: 86-97 |
| 1988 |
|---|
| 3 | | Sampath Kannan,
Moni Naor,
Steven Rudich:
Implicit Representation of Graphs
STOC 1988: 334-343 |
| 2 | | Gilles Brassard,
Sampath Kannan:
The Generation of Random Permutations on the Fly.
Inf. Process. Lett. 28(4): 207-212 (1988) |
| 1985 |
|---|
| 1 | EE | Richard Berger,
Sampath Kannan,
René Peralta:
A Framework for the Study of Cryptographic Protocols.
CRYPTO 1985: 87-103 |
