Venkatesan Guruswami received his Bachelor's degree from the Indian Institute of Technology at Madras in 1997 and his Ph.D. from the Massachusetts Institute of Technology in 2001. He is currently an Associate Professor in the Computer Science Department at Carnegie Mellon University. From 2002-09, he was a faculty member in the Department of Computer Science and Engineering at the University of Washington. Dr. Guruswami was a Miller Research Fellow at the University of California, Berkeley during 2001-02, and was a member in the School of Mathematics, Institute for Advanced Study during 2007-08. Dr. Guruswami's research interests span a broad array of topics including the theory of error-correcting codes, approximation algorithms and non-approximability results for NP-hard optimization problems, explicit combinatorial constructions and pseudorandomness, probabilistically checkable proofs, computational complexity theory, and algebraic algorithms. Dr. Guruswami is a recipient of the Computational Complexity Conference best paper award (2007), David and Lucile Packard Foundation Fellowship (2005), Alfred P. Sloan Foundation Fellowship (2005), NSF CAREER award (2004), ACM's Doctoral Dissertation Award (2002), and the IEEE Information Theory Society Paper Award (2000).