Ravindran Kannan

For the Hindu deity refer to Kannan

Ravindran Kannan
ரவிந்திரன் கண்ணன்
Born (1953-03-12) 12 March 1953
Madras, India
Residence Rockridge, Oakland, California
Fields Computer science
Notable awards Knuth Prize (2011)
Fulkerson Prize (1991)

Ravindran Kannan (Tamil: ரவிந்திரன் கண்ணன்; born 12 March 1953, Madras)[1] is a Principal Researcher at Microsoft Research India, where he leads the algorithms research group. He is also the first adjunct faculty of Computer Science and Automation Department of Indian Institute of Science.

Before joining Microsoft, he was the William K. Lanman Jr. Professor of Computer Science and Professor of Applied Mathematics at Yale University. He has also taught at MIT and CMU. The ACM Special Interest Group on Algorithms and Computation Theory (SIGACT) presented its 2011 Knuth Prize to Ravi Kannan for developing influential algorithmic techniques aimed at solving long-standing computational problems.[2]

Ravi Kannan did his B.Tech at IIT, Bombay and PhD. at Cornell University. His research interests include Algorithms, Theoretical Computer Science and Discrete Mathematics as well as Optimization. His work has mainly focused on efficient algorithms for problems of a mathematical (often geometric) flavor that arise in Computer Science. He has worked on algorithms for integer programming and the geometry of numbers, random walks in n-space, randomized algorithms for linear algebra and learning algorithms for convex sets.

Key contributions

Among his many contributions, two are

  1. Polynomial-time algorithm for approximating the volume of convex bodies
  2. Algorithmic version for Szemerédi regularity partition

Selected works

Books

Other representative publications

Awards and honors

See also

References

External links

This article is issued from Wikipedia - version of the Saturday, April 30, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.