Ravi Kannan

Distinguished Scholar and Visiting Professor of Operations Research

Publications

• How many clusters - An Algorithmic answer

  (author(s): C. Bhattacharyya, R. Kannan, A. Kumar)
  Symposium on Discrete Algorithms, 2022

• Near-optimal sample complexity bounds for learning Latent k Polytopes and applications to admixtures

  (author(s): C. Bhattacharyya, R. Kannan)
  International Conference on Machine Learning, 2020

• Computing non-negative matrix factorization - provably

  (author(s):  S. Arora, R. Ge, R. Kannan, A. Moitra)
  ACM Symposium on Theory of Computing, 2012

• Foundations of Data Science

  (author(s): A. Blum, J. Hopcroft, R. Kannan)
  Cambridge University Press, 2021

• Fast Monte-Carlo algorithms for finding low-rank approximations

  (author(s): R. Kannan, A. Frieze, S. Vempala)
  Proceedings of the IEEE Annual Symposium on the Foundations of Computer Science, 1998; 370-378.
  Journal of the ACM 51(6), 2004; 1025-1041

• Spectral Algorithms

  Foundations and Trends in Theoretical Computer Science (Vol. 4)
  (author(s): R. Kannan, S. Vempala)
  Now, 2008. DOI: 10.1561/0400000025

• A random polynomial time algorithm for estimating the volumes of convex bodies

  (author(s): Ravindran Kannan, Martin Dyer, Alan Frieze)
  Journal of the Association for Computing Machinery, January 1990; 1-17

Honors and Awards

• American Academy of Arts and Sciences - Member, elected (2015)
• Knuth Prize, Association for Computing Machinery
• International Congress of Mathematicians, Beijing, China - Invited Speaker (2002)
• Indian Institute of Technology, Bombay - Distinguished Alumnus Award recipient (1999)
• 35 th Annual IEEE Symposium on the Foundations of Computer Science, Santa Fe - Plenary Speaker (October 22-24, 1994)
• Fulkerson Prize in Discrete Mathematics (1991), Awarded jointly by the American Mathematical Society and the Mathematical Programming Society