Ravi Kannan

Ravi Kannan is a distinguished visiting researcher at the Simons Institute for the Theory of Computing at UC Berkeley. He has held senior positions at Microsoft Research India (Principal Researcher), Yale University (William K. Lanman, Jr. Professor of Computer Science and Applied Mathematics), and academic appointments at Indian Institute of Science (Adjunct Faculty, Computer Science and Automation Department) and institutions like MIT and CMU.

His research spans algorithms, theoretical computer science, and discrete mathematics, focusing on efficient algorithms for geometric and mathematical problems, randomized linear algebra, and learning algorithms for convex sets. He has pioneered work in integer programming, geometry of numbers, and random walks in n-space.

Kannan has participated in multiple Simons Institute programs, including Complexity and Linear Algebra (Fall 2025) and Probability, Geometry, and Computation in High Dimensions (Fall 2020), reflecting his expertise in bridging mathematical theory and computational challenges.

• Knuth Prize (2011) for influential algorithmic techniques
• Fulkerson Prize (1991) for convex set volume estimation
• IIT Bombay Distinguished Alumnus Award (1999)