Prasad Raghavendra

Assistant Professor, UC Berkeley

Prasad Raghavendra received his PhD in Computer Science and Engineering from the University of Washington, advised by Venkatesan Guruswami. He then spent a year at Microsoft Research New England as a postdoc, and two years on the faculty at Georgia Tech. He earned a dual degree (Btech/Mtech) in Computer Science from IIT Madras. He has received a NSF CAREER Award, and a Best Paper Award and Best Student Paper Award at the 2008 ACM Symposium on Theory of Computing. Raghavendra's research focuses on approximation algorithms, hardness of approximation, computational complexity theory and coding theory.

Program Visits