Sanjeev Arora

Sanjeev Arora is the Charles C. Fitzmorris Professor of Computer Science at Princeton University, where he has made significant contributions to theoretical computer science. His work bridges foundational computational complexity and applied machine learning, with a focus on approximation algorithms and metric space embeddings.

• Ph.D. in Computer Science, University of California, Berkeley (1994)

His research spans computational complexity, approximation algorithms, geometric embeddings of metric spaces, and high-dimensional problems in machine learning. He has also pioneered interdisciplinary efforts through the Center for Computational Intractability, which he founded at Princeton.

• ACM SIGACT-EATCS Gödel Prize (2001, 2010)
• Packard Fellowship for Science and Engineering (1997)
• ACM-Infosys Foundation Award in Computing Sciences (2012)
• Fulkerson Prize (2012)
• Simons Investigator Award in Computer Science (2012)