# Ravindran Kannan

> Indian mathematician

**Wikidata**: [Q93034](https://www.wikidata.org/wiki/Q93034)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Ravindran_Kannan)  
**Source**: https://4ort.xyz/entity/ravindran-kannan

## Summary
Ravindran Kannan is an Indian mathematician and computer scientist known for his pioneering work in theoretical computer science and algorithms. He is a professor at Yale University and has made significant contributions to fields such as discrete mathematics, optimization, and informatics.

## Biography
- Born: March 12, 1953, Chennai, India
- Nationality: Indian
- Education: Indian Institute of Technology Bombay; Cornell University
- Known for: Theoretical computer science, algorithms, discrete mathematics, optimization
- Employer(s): Yale University, Indian Institute of Science, Bengaluru, Massachusetts Institute of Technology, Carnegie Mellon University
- Field(s): Informatics, algorithms, discrete mathematics, optimization, computer science

## Contributions
Ravindran Kannan has made fundamental contributions to theoretical computer science, particularly in the design and analysis of algorithms. He is best known for his work on random polynomial-time algorithms for approximating the volume of convex bodies, which earned him the Fulkerson Prize in 1991 alongside Martin Dyer and Alan M. Frieze. His research has advanced the understanding of algorithmic efficiency and complexity, influencing both theoretical foundations and practical applications in computer science. Kannan has also mentored numerous doctoral students who have gone on to make their own contributions to the field, including David Applegate and Petros Drineas.

## FAQs
### Q: What is Ravindran Kannan most famous for?
A: He is most famous for developing a random polynomial-time algorithm for approximating the volume of convex bodies, which earned him the Fulkerson Prize in 1991.

### Q: Where does Ravindran Kannan currently work?
A: He is currently a professor at Yale University, having previously held positions at MIT, Carnegie Mellon University, and the Indian Institute of Science, Bengaluru.

### Q: What awards has Ravindran Kannan received?
A: He has received the Knuth Prize (2011), the Fulkerson Prize (1991), and was named an ACM Fellow in 2016 for his contributions to theoretical computer science.

## Why They Matter
Ravindran Kannan's work has fundamentally shaped the field of theoretical computer science by providing new algorithmic approaches to complex mathematical problems. His volume approximation algorithm not only solved a long-standing mathematical challenge but also demonstrated the power of randomization in algorithm design, influencing countless subsequent developments in the field. As both a researcher and educator, Kannan has helped train the next generation of computer scientists while advancing the theoretical foundations that underpin modern computing.

## Notable For
- Knuth Prize recipient (2011) for outstanding contributions to the foundations of computer science
- Fulkerson Prize winner (1991) for volume approximation algorithm
- ACM Fellow (2016) for contributions to theoretical computer science
- Erdős number 2, reflecting his connections to the mathematical community
- Mentor to numerous prominent computer scientists including David Applegate and Petros Drineas

## Body
### Early Life and Education
Born in Chennai, India, in 1953, Kannan pursued his education at the Indian Institute of Technology Bombay before completing his doctoral studies at Cornell University under the supervision of Leslie Earl Trotter, Jr.

### Academic Career
Kannan has held faculty positions at several prestigious institutions including MIT, Carnegie Mellon University, and the Indian Institute of Science, Bengaluru, before joining Yale University. His career spans over four decades of research and teaching in theoretical computer science.

### Research Contributions
His most celebrated work is the random polynomial-time algorithm for approximating the volume of convex bodies, developed with Martin Dyer and Alan M. Frieze. This breakthrough demonstrated that high-dimensional volume computation could be done efficiently with randomization, opening new avenues in computational geometry and optimization.

### Recognition and Awards
Beyond the Knuth Prize and Fulkerson Prize, Kannan was elected a Fellow of the American Academy of Arts and Sciences and became an ACM Fellow in 2016, recognizing his lasting impact on theoretical computer science.

### Mentorship
As a doctoral advisor, Kannan has guided numerous students who have become influential researchers themselves, including David Applegate (known for work on the traveling salesman problem) and Petros Drineas (known for contributions to randomized algorithms and data analysis).

## Schema Markup
```json
{
  "@context": "https://schema.org",
  "@type": "Person",
  "name": "Ravindran Kannan",
  "jobTitle": "Mathematician and Computer Scientist",
  "worksFor": {"@type": "Organization", "name": "Yale University"},
  "nationality": {"@type": "Country", "name": "India"},
  "birthDate": "1953-03-12",
  "birthPlace": "Chennai, India",
  "alumniOf": [
    {"@type": "EducationalOrganization", "name": "Indian Institute of Technology Bombay"},
    {"@type": "EducationalOrganization", "name": "Cornell University"}
  ],
  "knowsAbout": [
    "Informatics",
    "Algorithms",
    "Discrete Mathematics",
    "Optimization",
    "Computer Science"
  ],
  "sameAs": [
    "https://en.wikipedia.org/wiki/Ravindran_Kannan",
    "https://www.wikidata.org/wiki/Q7481795"
  ],
  "description": "Indian mathematician and computer scientist known for contributions to theoretical computer science and algorithms"
}

## References

1. Czech National Authority Database
2. [Source](http://www.ams.org/prizes-awards/pabrowse.cgi?parent_id=17&year=1991)
3. [Source](https://awards.acm.org/fellows/award-winners)
4. [Source](https://www.acm.org/media-center/2016/december/fellows-2016)
5. Mathematics Genealogy Project
6. Virtual International Authority File
7. CiNii Research
8. National Library of Israel Names and Subjects Authority File