Prasad Raghavendra
Associate Professor, UC Berkeley
Prasad Raghavendra is an Associate Professor of electrical engineering and computer science at UC Berkeley. He received his PhD from the University of Washington, advised by Venkatesan Guruswami. Prasad was a postdoc at Microsoft Research and has taught at Georgia Tech. He is a recipient of the Michael and Sheila Held Prize from the National Academy of Sciences, the Sloan Fellowship, and Best Paper Awards at STOC 2008 and 2015. His research work focuses on optimization, computational complexity, and mathematical programming.
Program Visits
- Computational Complexity of Statistical Inference, Fall 2021. Visiting Scientist, Program Organizer and Workshop Organizer.
- The Quantum Wave in Computing, Spring 2020. Visiting Scientist.
- Geometry of Polynomials, Spring 2019. Visiting Scientist.
- Lower Bounds in Computational Complexity, Fall 2018. Visiting Scientist.
- Summer Cluster: Challenges in Quantum Computation, Summer 2018. Visiting Scientist.
- Bridging Continuous and Discrete Optimization, Fall 2017. Visiting Scientist and Workshop Organizer.
- Pseudorandomness, Spring 2017. Visiting Scientist.
- Algorithmic Spectral Graph Theory, Fall 2014. Visiting Scientist, Program Organizer and Workshop Organizer.
- Real Analysis in Computer Science, Fall 2013. Visiting Scientist, Program Organizer and Workshop Organizer.
