☰

Sampath Kannan - Publications

Affiliations: 
Computer and Information Science University of Pennsylvania, Philadelphia, PA, United States 
Area:
Information Systems: Computational Biology and Bioinformatics, Theory: Algorithms and Complexity
Tree Info Similar researchers PubMed Report error

27 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2018 Kannan S, Mathieu C, Zhou H. Graph Reconstruction and Verification Acm Transactions On Algorithms. 14: 1-30. DOI: 10.1145/3199606  0.372
2016 Chakrabarty D, Kannan S, Tian K. Detecting Character Dependencies in Stochastic Models of Evolution. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. PMID 26744770 DOI: 10.1089/Cmb.2015.0099  0.325
2013 Pitler E, Kannan S, Marcus M. Finding Optimal 1-Endpoint-Crossing Trees Transactions of the Association For Computational Linguistics. 1: 13-24. DOI: 10.1162/Tacl_A_00206  0.329
2008 Feigenbaum J, Kannan S, McGregor A, Suri S, Zhang J. Graph distances in the data-stream model Siam Journal On Computing. 38: 1709-1727. DOI: 10.1137/070683155  0.57
2007 Angelov S, Harb B, Kannan S, Khanna S, Kim J. Efficient enumeration of phylogenetically informative substrings. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 14: 701-23. PMID 17691889 DOI: 10.1089/Cmb.2007.R011  0.368
2006 Isler V, Kannan S, Khanna S. Randomized pursuit-evasion with local visibility Siam Journal On Discrete Mathematics. 20: 26-41. DOI: 10.1137/S0895480104442169  0.338
2005 Isler V, Kannan S, Khanna S. Randomized pursuit-evasion in a polygonal environment Ieee Transactions On Robotics. 21: 875-884. DOI: 10.1109/Tro.2005.851373  0.34
2005 Feigenbaum J, Kannan S, McGregor A, Suri S, Zhang J. On graph problems in a semi-streaming model Theoretical Computer Science. 348: 207-216. DOI: 10.1016/j.tcs.2005.09.013  0.324
2004 Feigenbaum J, Kannan S, Zhang J. Computing diameter in the streaming and sliding-window models Algorithmica (New York). 41: 25-41. DOI: 10.1007/S00453-004-1105-2  0.355
2003 Feigenbaum J, Kannan S, Strauss MJ, Viswanathan M. An approximate L1-difference algorithm for massive data streams Siam Journal On Computing. 32: 131-151. DOI: 10.1137/S0097539799361701  0.348
2002 Feigenbaum J, Kannan S, Strauss M, Viswanathan M. Testing and spot-checking of data streams Algorithmica (New York). 34: 67-80. DOI: 10.1007/S00453-002-0959-4  0.3
2001 Anderson R, Kannan S, Karloff H, Ladner RE. Thresholds and optimal binary comparison search trees (extended abstract) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2245: 83-95. DOI: 10.1016/S0196-6774(02)00203-1  0.365
2000 Ergün F, Kannan S, Kumar SR, Rubinfeld R, Viswanathan M. Spot-checkers Journal of Computer and System Sciences. 60: 717-751. DOI: 10.1006/Jcss.1999.1692  0.351
1999 Farach M, Kannan S. Efficient algorithms for inverting evolution Journal of the Acm (Jacm). 46: 437-449. DOI: 10.1145/320211.320212  0.371
1998 Kannan S, Warnow T, Yooseph S. Computing the Local Consensus of Trees Siam Journal On Computing. 27: 1695-1724. DOI: 10.1137/S0097539795287642  0.351
1998 Dasgupta B, Jiang T, Kannan S, Li M, Sweedyk E. On the complexity and approximation of syntenic distance Discrete Applied Mathematics. 88: 59-82. DOI: 10.1016/S0166-218X(98)00066-3  0.339
1998 Feigenbaum J, Kannan S, Vardi MY, Viswanathan M. Complexity of problems on graphs represented as OBDDs (extended abstract) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1373: 216-226. DOI: 10.1007/Bfb0028563  0.347
1997 Kannan S, Warnow T. A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies Siam Journal On Computing. 26: 1749-1763. DOI: 10.1137/S0097539794279067  0.371
1997 Gore V, Jerrum M, Kannan S, Sweedyk Z, Mahaney S. A Quasi-polynomial-time Algorithm for Sampling Words from a Context-Free Language Information and Computation. 134: 59-74. DOI: 10.1006/Inco.1997.2621  0.333
1995 Benham C, Kannan S, Paterson M, Warnow T. Hen's teeth and whale's feet: generalized characters and their compatibility Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 2: 515-525. PMID 8634903 DOI: 10.1089/Cmb.1995.2.515  0.332
1995 Blum M, Kannan S. Designing programs that check their work Journal of the Acm (Jacm). 42: 269-291. DOI: 10.1145/200836.200880  0.302
1995 Farach M, Kannan S, Warnow T. A robust model for finding optimal evolutionary trees Algorithmica. 13: 155-179. DOI: 10.1007/Bf01188585  0.379
1994 Kannan S, Proebsting TA. Correction to ‘producing good code for the case statement’ Software: Practice and Experience. 24: 233-233. DOI: 10.1002/Spe.4380240206  0.335
1993 Fernandez de la Vega W, Kannan S, Santha M. Two Probabilistic Results on Merging Siam Journal On Computing. 22: 261-271. DOI: 10.1137/0222019  0.303
1992 Kannan S, Soroker D. Tiling polygons with parallelograms Discrete &Amp; Computational Geometry. 7: 175-188. DOI: 10.1007/Bf02187834  0.316
1988 Kannan S, Naor M, Rudich S. Implicit representation of graphs Proceedings of the Annual Acm Symposium On Theory of Computing. 334-343. DOI: 10.1137/0405049  0.327
1988 Brassard G, Kannan S. The generation of random permutations on the fly Information Processing Letters. 28: 207-212. DOI: 10.1016/0020-0190(88)90210-4  0.318
Show low-probability matches.