Prasad Raghavendra
From Wikipedia, the free encyclopedia
AlmamaterUniversity of Washington
KnownforRaghavendra's theorem[1]
Awards
- Michael and Shiela Held Prize (2018)[2]
- Okawa research grant (2015)[3]
- NSF CAREER (2013)[4]
- Sloan research fellow (2012)[5]
FieldsComputer science
Prasad Raghavendra | |
|---|---|
| Alma mater | University of Washington |
| Known for | Raghavendra's theorem[1] |
| Awards |
|
| Scientific career | |
| Fields | Computer science |
| Institutions | University of California at Berkeley |
| Thesis | Approximating NP-hard Problems Efficient Algorithms and their Limits (2001) |
| Doctoral advisor | Venkatesan Guruswami |
| Website | people |
Prasad Raghavendra is an Indian-American theoretical computer scientist and mathematician, working in optimization, complexity theory, approximation algorithms, hardness of approximation and statistics. He is a professor of computer science at the University of California at Berkeley.[6]
