Ravindran Kannan

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.

For the Hindu deity refer to Kannan

Professor

Ravindran Kannan
ரவீந்திரன் கண்ணன்
Born (1953-03-12) 12 March 1953
Madras, India
Alma materIndian Institute of Technology Bombay (B.Tech.)
Cornell University (Ph.D.)
AwardsKnuth Prize (2011)
Fulkerson Prize (1991)
Scientific career
FieldsComputer 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, CMU and IISc. 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
  • "Clustering in large graphs and matrices," with P. Drineas, A. Frieze, S. Vempala and V. Vinay, Proceedings of the Symposium on Discrete Algorithms, 1999.
  • "A Polynomial-Time Algorithm for learning noisy Linear Threshold functions," with A. Blum, A. Frieze and S. Vempala, Algorithmica 22:35–52, 1998.
  • "Covering Minima and lattice point free convex bodies," with L. Lovász, Annals of Mathematics, 128:577–602, 1988.

Awards and honors
  • Joint Winner of the 1991 Fulkerson Prize in Discrete Mathematics for his work on the volumes of convex bodies.[3]
  • Knuth Prize 2011 for developing influential algorithmic techniques aimed at solving long-standing computational problems.[2]

In 2017 he became a Fellow of the Association for Computing Machinery.[4]

gollark: Switchcraft? DOWN?! HOW WILL I LIVE?!
gollark: I'm glad you stopped that waste of CPU power. Proteins fold themselves, after all.
gollark: Ah, yes, this makes sense, being an entirely reasonable thing people do all the time.
gollark: Anyway, more seriously, did apemanzilla manage to GPUize address mining or something?
gollark: I guess you're going to keep saying that, because if people transfer money out the tiny amount left out of `killdan200` will run out and kristpay will fail.

See also

References
  1. Who's Who in Frontiers in Science and Technology 1985
  2. Microsoft Researcher to Receive ACM SIGACT Knuth Prize Archived 2011-04-29 at the Wayback Machine
  3. Distinguished Alumnus Archived 2011-10-07 at the Wayback Machine
  4. "ACM Recognizes New Fellows", Communications of the ACM, 60 (3): 23, March 2017, doi:10.1145/3039921.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.