Sampath K. Kannan
Henry Salvatori Professor
Computer and Information Science (CIS)
Honors and Awards: Outstanding Faculty Advising Award - 2005
Research Expertise: Algorithms and Complexity
Sampath's research spans several subfields in algorithms. In his work on massive data set algorithms, Sampath explores what can be computed efficiently, and what is not computable. He is also interested in program checking, a paradigm for ensuring the correctness of a program by observing its behavior at run-time, and in algorithmic problems in computational biology, particularly the problem of reconstructing the evolutionary history of a set of species from phenotypic and molecular sequence observations.
Member of:
Recent Publications 
- Accumulation of inactive p53 protein in oral squamous cell carcinoma: Stabilization by protein interaction, Francis, G. | Dileep Kumar, U. | Nalinakumari, K.R. | Jayasree, K. | Kannan, S., European Journal of Oral Sciences, 2013
- The exponential mechanism for social welfare: Private, truthful, and nearly optimal, Huang, Z. | Kannan, S., Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, 2012
- Algorithms for the generalized sorting problem, Huang, Z. | Kannan, S. | Khanna, S., Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, 2011
- ToMaTo: A trustworthy code mashup development tool, Chang, J. | Venkatasubramanian, K. | West, A.G. | Kannan, S. | Sokolsky, O. | Kim, M.J. | Lee, I., ACM International Conference Proceeding Series, 2011
- On sampling from multivariate distributions, Huang, Z. | Kannan, S., Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011