| Secure data interchange FSM Herz, WP Labys, DC Parkes, S Kannan, JM Eisner US Patent App. 12/417,747, 2009 | 1330 | 2009 |
| Secure data interchange FSM Herz, WP Labys, DC Parkes, S Kannan, JM Eisner US Patent 7,630,986, 2009 | 1104 | 2009 |
| Designing programs that check their work M Blum, S Kannan Journal of the ACM (JACM) 42 (1), 269-291, 1995 | 785 | 1995 |
| Checking the correctness of memories M Blum, W Evans, P Gemmell, S Kannan, M Naor Algorithmica 12 (2-3), 225-244, 1994 | 365 | 1994 |
| An Approximate L1 -Difference Algorithm for Massive Data Streams J Feigenbaum, S Kannan, MJ Strauss, M Viswanathan SIAM Journal on Computing 32 (1), 131-151, 2002 | 305 | 2002 |
| On graph problems in a semi-streaming model J Feigenbaum, S Kannan, A McGregor, S Suri, J Zhang Theoretical Computer Science 348 (2-3), 207-216, 2005 | 281 | 2005 |
| Java-MaC: A run-time assurance approach for Java programs M Kim, M Viswanathan, S Kannan, I Lee, O Sokolsky Formal methods in system design 24 (2), 129-155, 2004 | 276 | 2004 |
| Implicat representation of graphs S Kannan, M Naor, S Rudich SIAM Journal on Discrete Mathematics 5 (4), 596-603, 1992 | 258 | 1992 |
| Spot-checkers F Ergün, S Kannan, SR Kumar, R Rubinfeld, M Viswanathan Journal of Computer and System Sciences 60 (3), 717-751, 2000 | 257 | 2000 |
| Java-MaC: a run-time assurance tool for Java programs M Kim, S Kannan, I Lee, O Sokolsky, M Viswanathan Electronic Notes in Theoretical Computer Science 55 (2), 218-235, 2001 | 235 | 2001 |
| Randomized pursuit-evasion in a polygonal environment V Isler, S Kannan, S Khanna IEEE Transactions on Robotics 21 (5), 875-884, 2005 | 221 | 2005 |
| Runtime assurance based on formal specifications I Lee, S Kannan, M Kim, O Sokolsky, M Viswanathan Departmental Papers (CIS), 294, 1999 | 218 | 1999 |
| Oracles and queries that are sufficient for exact learning NH Bshouty, R Cleve, R Gavaldà, S Kannan, C Tamon Journal of Computer and System Sciences 52 (3), 421-433, 1996 | 210 | 1996 |
| A robust model for finding optimal evolutionary trees M Farach, S Kannan, T Warnow Algorithmica 13 (1-2), 155-179, 1995 | 208 | 1995 |
| The relationship between public key encryption and oblivious transfer Y Gertner, S Kannan, T Malkin, O Reingold, M Viswanathan Proceedings 41st Annual Symposium on Foundations of Computer Science, 325-335, 2000 | 182 | 2000 |
| Formally specified monitoring of temporal properties M Kim, M Viswanathan, H Ben-Abdallah, S Kannan, I Lee, O Sokolsky Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS …, 1999 | 166 | 1999 |
| Communicating hierarchical state machines R Alur, S Kannan, M Yannakakis International Colloquium on Automata, Languages, and Programming, 169-178, 1999 | 141 | 1999 |
| Graph distances in the streaming model: the value of space J Feigenbaum, S Kannan, A McGregor, S Suri, J Zhang Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete …, 2005 | 120 | 2005 |
| A fast algorithm for the computation and enumeration of perfect phylogenies S Kannan, T Warnow SIAM Journal on Computing 26 (6), 1749-1763, 1997 | 120 | 1997 |
| Group testing problems with sequences in experimental molecular biology M Farach, S Kannan, E Knill, S Muthukrishnan Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No …, 1997 | 120 | 1997 |
