| Computer Science |
Main
Page | Academics |
Graduate
Program Undergraduate
Program
Course Information Course
Catalog Course
Web Pages| Research |
Our
Research Research Areas Research
Projects Publications| People |
Faculty Graduate
Students Research
and Technical Staff Administrative
Staff Alumni| Resources |
Calendars Computing Facilities Yale
Computer Science FAQ Yale Workstation Support Computing
Lab AfterCollege
Job Resource | Department Information |
Contact
Us History Life in the Department Life About Town Directions | Job Openings |
Faculty
Positions| Useful Links |
City
of New Haven Yale Applied Mathematics Yale Faculty of Engineering Yale
University Home Page Google Search Yale Info Phonebook| Internal |
Internal Ravindran Kannan
Professor of Computer Science & Mathematics
B. Tech., Indian Institute of Technology, Bombay, India. 1974
Ph.D., Cornell University, 1980
Joined Yale Faculty 1997
Personal Homepage
Office Location: AKW 407
Telephone: 203.432.1228
 |
Ravi Kannan is the William K. Lanman Jr. Professor of Computer Science. 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.
He was awarded the Fulkerson Prize in Discrete Mathematics in 1991 by the Mathematical programming Society and the American Mathematical Society for his work on estimating the volume of convex sets. He was awarded the Distinguished Alumnus award of the Indian Institute of Technology, Bombay in 1999. He was a plenary speaker at the 1997 IEEE Symposium on the Foundations of Computer Science.
He has served on the editorial board of several journals and on program committees. He was the Chair of the Program Committee for the second Integer Programming and Combinatorial Optimization conference in 1988 and the Chair of the Fulkerson Prize Committee in 2000.
| 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. |
|
"A random polynomial time algorithm for estimating the volumes of convex bodies," with M. Dyer and A. Frieze, Journal of the Association for Computing Machinery, pp 1-17, January 1990. |
|
"Covering Minima and lattice point free convex bodies," with L. Lovász, Annals of Mathematics, 128:577-602, 1988. |
