Prasad Raghavendra

Indian-American computer scientist

This biography of a living person needs additional citations for verification. Please help by adding reliable sources. Contentious material about living persons that is unsourced or poorly sourced must be removed immediately from the article and its talk page, especially if potentially libelous.
Find sources: "Prasad Raghavendra" – news · newspapers · books · scholar · JSTOR (November 2023) (Learn how and when to remove this message)

|

Prasad Raghavendra

Alma mater| University of Washington
Known for| Raghavendra's theorem[5]
Awards|

* Michael and Shiela Held Prize (2018)[1]
* Okawa research grant (2015)[2]
* NSF CAREER (2013)[3]
* Sloan research fellow (2012)[4]

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.eecs.berkeley.edu/~prasad/

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]

## Education

[edit]

After completing a BTech at IIT Madras in 2005, he obtained an MSc (2007) and PhD (2009) at the University of Washington under the supervision of Venkatesan Guruswami. After a postdoctoral position at Microsoft Research New England, he became faculty at the University of California at Berkeley.

## Career

[edit]

Raghavendra showed that assuming the unique games conjecture, semidefinite programming is the optimal algorithm for solving constraint satisfaction problems.

Together with David Steurer, he developed the small set expansion hypothesis, for which they won the Michael and Shiela Held Prize in 2018.

He developed sum of squares as a versatile algorithmic technique. Together with David Steurer, he gave an invited talk on the topic at the 2018 ICM.

## References

[edit]

1. ^ "News from the National Academy of Sciences". National Academy of Sciences. January 16, 2018.
2. ^ "The Research Grant Recipients". The Okawa Foundation. Retrieved December 1, 2023.
3. ^ "NSF Awards". Berkeley EECS. Retrieved December 1, 2023.
4. ^ "Fellows Databse". Alfred P. Sloan Foundation. Retrieved December 1, 2023.
5. ^ Raghavendra, Prasad (17 May 2008). "Optimal Algorithms and Inapproximability Results for Every CSP?". STOC '08: Proceedings of the fortieth annual ACM symposium on Theory of computing. STOC '08. Victoria, BC: ACM. pp. 245–254\. doi:10.1145/1374376.1374414.
6. ^ "CS Faculty List". Berkeley EECS. 23 November 2023.

Authority control databases

International|

* ISNI
* VIAF

National|

* Germany
* United States
* Israel

Academics|

* Mathematics Genealogy Project
* MathSciNet

People|

* DDB