Carnegie Mellon University, Pittsburgh, PA
Since 2008, Venkat has been on the faculty of the Computer Science Department at Carnegie Mellon University. Earlier, he was a faculty member at the University of Washington. Venkat was a Miller Research Fellow at UC Berkeley during 2001-02, and was a member of the School of Mathematics, Institute for Advanced Study during 2007-08.
Venkat is interested in several topics in theoretical computer science, including algorithmic and algebraic coding theory, approximability of fundamental optimization problems, pseudorandomness, probabilistically checkable proofs, computational complexity theory, and algebraic algorithms.
Venkat currently serves on the editorial boards of the SIAM Journal on Computing, IEEE Transactions on Information Theory, and the ACM Transactions on Computation Theory. He was recently program committee chair for the 2012 Computational Complexity conference. Venkat is a recipient of the Presburger award, Packard Fellowship, Sloan Fellowship, NSF CAREER award, ACM's Doctoral Dissertation Award, and the IEEE Information Theory Society Paper Award.
In his (sadly limited) spare time, Venkat enjoys traveling, ethnic vegetarian food, racquet sports, hiking/running within his humble limits, and listening to Carnatic music.
Postdoctoral Research Associate
Princeton University, Princeton, NJ
His current research interests are in the use of convex relaxation hierarchies for basic graph partitioning problems.