Professor Princeton University |
The Institute for Advanced Study
Sanjeev Arora is the Charles C. Fitzmorris Professor of Computer Science at Princeton University, where he has been a faculty member since 1994. He received his SB in Math with Computer Science from MIT in 1990 and his Ph.D. in Computer Science from UC Berkeley in 1994. His research interests lie in theoretical computer science, particularly in computational complexity theory.
Sanjeev has received numerous awards and honors for his contributions to the field, including being inducted as a Member of the National Academy of Sciences in 2018, elected to the American Academy of Arts and Sciences in 2015, and received the ACM-Infosys Foundation Award in the Computing Sciences in 2011. He is also a Simons Investigator, a title he has held since 2012.
In addition to his research, Sanjeev is also an accomplished teacher and mentor, receiving the Engineering Council Teaching Award for Fall 2008 at Princeton University and the Graduate Mentoring Award in 2005. He has authored or co-authored numerous publications, including the widely used textbook Computational Complexity: A Modern Approach, which he co-authored with Boaz Barak.
Sanjeev has served on various editorial boards, including those for Computational Complexity, Theory of Computing, SIAM J. Disc. Math, Journal of Combinatorial Optimization, and Information and Computation. He has also held various leadership roles, including serving as the Program Chair for IEEE FOCS 2006 and APPROX 2003 and as the Founding Director and Lead PI of the Center for Computational Intractability at Princeton.