Ravindran Kannan (; born 12 March 1953,
Madras
Chennai, also known as Madras ( its official name until 1996), is the capital and largest city of Tamil Nadu, the southernmost state of India. It is located on the Coromandel Coast of the Bay of Bengal. According to the 2011 Indian ce ...
) is a Principal Researcher at
Microsoft Research
Microsoft Research (MSR) is the research subsidiary of Microsoft. It was created in 1991 by Richard Rashid, Bill Gates and Nathan Myhrvold with the intent to advance state-of-the-art computing and solve difficult world problems through technologi ...
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
The Indian Institute of Science (IISc) is a Public university, public, Deemed university, deemed, research university for higher education and research in science, engineering, design, and management. It is located in Bengaluru, Karnataka. The ...
.
Before joining Microsoft, he was the William K. Lanman Jr. Professor of Computer Science and Professor of Applied Mathematics at
Yale University
Yale University is a Private university, private Ivy League research university in New Haven, Connecticut, United States. Founded in 1701, Yale is the List of Colonial Colleges, third-oldest institution of higher education in the United Stat ...
. He has also taught at
MIT
The Massachusetts Institute of Technology (MIT) is a private research university in Cambridge, Massachusetts, United States. Established in 1861, MIT has played a significant role in the development of many areas of modern technology and sc ...
,
CMU
Carnegie Mellon University (CMU) is a private research university in Pittsburgh, Pennsylvania, United States. The institution was established in 1900 by Andrew Carnegie as the Carnegie Technical Schools. In 1912, it became the Carnegie Institut ...
and
IISc
The Indian Institute of Science (IISc) is a public, deemed, research university for higher education and research in science, engineering, design, and management. It is located in Bengaluru, Karnataka. The institute was established in 1909 wi ...
. The ACM Special Interest Group on Algorithms and Computation Theory (SIGACT) presented its 2011
Knuth Prize
The Donald E. Knuth Prize is a prize for outstanding contributions to the foundations of computer science, named after the American computer scientist Donald E. Knuth.
History
The Knuth Prize has been awarded since 1996 and includes an award of ...
to Ravi Kannan for developing influential algorithmic techniques aimed at solving long-standing computational problems.
[Microsoft Researcher to Receive ACM SIGACT Knuth Prize]
He also served on the Mathematical Sciences jury for the
Infosys Prize
The Infosys Prize is an annual award granted to scientists, researchers, engineers and social scientists of Indian origin (not necessarily born in India) by the Infosys Science Foundation and ranks among the highest monetary awards for researc ...
in 2012 and 2013.
Ravi Kannan did his B.Tech at
IIT, Bombay. He received his PhD in 1980 at
Cornell University
Cornell University is a Private university, private Ivy League research university based in Ithaca, New York, United States. The university was co-founded by American philanthropist Ezra Cornell and historian and educator Andrew Dickson W ...
under Leslie Earl Trotter, Jr. 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
An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming (ILP), in which the objective ...
and the
geometry of numbers
Geometry of numbers is the part of number theory which uses geometry for the study of algebraic numbers. Typically, a ring of algebraic integers is viewed as a lattice (group), lattice in \mathbb R^n, and the study of these lattices provides fundam ...
,
random walks
In mathematics, a random walk, sometimes known as a drunkard's walk, is a stochastic process that describes a path that consists of a succession of random steps on some mathematical space.
An elementary example of a random walk is the random ...
in
''n''-space,
randomized algorithm
A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic or procedure. The algorithm typically uses uniformly random bits as an auxiliary input to guide its behavior, in the hope of achieving good performan ...
s for
linear algebra
Linear algebra is the branch of mathematics concerning linear equations such as
:a_1x_1+\cdots +a_nx_n=b,
linear maps such as
:(x_1, \ldots, x_n) \mapsto a_1x_1+\cdots +a_nx_n,
and their representations in vector spaces and through matrix (mathemat ...
and learning algorithms for
convex set
In geometry, a set of points is convex if it contains every line segment between two points in the set.
For example, a solid cube (geometry), cube is a convex set, but anything that is hollow or has an indent, for example, a crescent shape, is n ...
s.
Key contributions
Among his many contributions, two are
#
Polynomial-time algorithm for approximating the volume of convex bodies
#
Algorithmic version for Szemerédi regularity partition
Algorithmic may refer to:
*Algorithm, step-by-step instructions for a calculation
**Algorithmic art, art made by an algorithm
**Algorithmic composition, music made by an algorithm
**Algorithmic trading, trading decisions made by an algorithm
**Algo ...
Selected works
Books
* 2013. ''Foundations of Data Science''. (with
John Hopcroft
John Edward Hopcroft (born October 7, 1939) is an American theoretical computer scientist. His textbooks on theory of computation (also known as the Cinderella book) and data structures are regarded as standards in their fields. He is a professo ...
).
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
''Algorithmica'' is a monthly peer-reviewed scientific journal focusing on research and the application of computer science algorithms. The journal was established in 1986 and is published by Springer Science+Business Media. The editor in chief i ...
'' 22:35–52, 1998.
* "Covering Minima and lattice point free convex bodies," with L. Lovász, ''
Annals of Mathematics
The ''Annals of Mathematics'' is a mathematical journal published every two months by Princeton University and the Institute for Advanced Study.
History
The journal was established as ''The Analyst'' in 1874 and with Joel E. Hendricks as t ...
'', 128:577–602, 1988.
Awards and honors
* Joint Winner of the 1991
Fulkerson Prize
The Fulkerson Prize for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Optimization Society (MOS) and the American Mathematical Society (AMS). Up to three awards of $1,500 each are presented at e ...
in
Discrete Mathematics
Discrete mathematics is the study of mathematical structures that can be considered "discrete" (in a way analogous to discrete variables, having a bijection with the set of natural numbers) rather than "continuous" (analogously to continuous f ...
for his work on the volumes of
convex
Convex or convexity may refer to:
Science and technology
* Convex lens, in optics
Mathematics
* Convex set, containing the whole line segment that joins points
** Convex polygon, a polygon which encloses a convex set of points
** Convex polytop ...
bodies.
*
Knuth Prize
The Donald E. Knuth Prize is a prize for outstanding contributions to the foundations of computer science, named after the American computer scientist Donald E. Knuth.
History
The Knuth Prize has been awarded since 1996 and includes an award of ...
2011 for developing influential algorithmic techniques aimed at solving long-standing computational problems.
In 2017 he became a
Fellow of the Association for Computing Machinery
A fellow is a title and form of address for distinguished, learned, or skilled individuals in academia, medicine, research, and industry. The exact meaning of the term differs in each field. In learned or professional societies, the term refers ...
.
[.]
See also
*
Szemerédi regularity lemma
In extremal graph theory, Szemerédi’s regularity lemma states that a graph can be partitioned into a bounded number of parts so that the edges between parts are regular (in the sense defined below). The lemma shows that certain properties of r ...
*
Alan M. Frieze
*
Avrim Blum
Avrim Louis Blum (born 27 May 1966) is a computer scientist. In 2007, he was made a Fellow of the Association for Computing Machinery "for contributions to learning theory and algorithms." Blum attended MIT, where he received his Ph.D. in 1991 ...
*
László Lovász
László Lovász (; born March 9, 1948) is a Hungarian mathematician and professor emeritus at Eötvös Loránd University, best known for his work in combinatorics, for which he was awarded the 2021 Abel Prize jointly with Avi Wigderson. He ...
References
External links
Ravi Kannan's home page*
Distinguished Alumni Awardees 1999, IIT Bombay
{{DEFAULTSORT:Kannan, Ravindran
20th-century Indian mathematicians
Yale University faculty
Tamil scientists
IIT Bombay alumni
Cornell University alumni
Living people
1953 births
Academic staff of the Indian Institute of Science
21st-century Indian mathematicians
2016 fellows of the Association for Computing Machinery
Knuth Prize laureates
Indian theoretical computer scientists