Sanjeev Arora is Charles C. Fitzmorris Professor of Computer Science at Princeton University. Arora earned his Ph.D. in Computer Science at the University of California, Berkeley in 1994. He has received the ACM SIGACT-EATCS Gödel Prize (2001 and 2010), Packard Fellowship for Science and Engineering (1997), ACM-Infosys Foundation Award in the Computing Sciences (2012), Fulkerson Prize (2012) and Simons Investigator Award in Computer Science (2012). He served as the founding director for the Center for Computational Intractability at Princeton.
His research spans several areas of theoretical computer science, including computational complexity, approximation algorithms, geometric embeddings of metric spaces, and high-dimensional problems in machine learning.