Sanjeev Arora, Ph.D.

Photo by Frank Wojciechowski

Sanjeev Arora works on theoretical computer science and theoretical machine learning. He received a bachelor’s degree in Mathematics with Computer Science from MIT in 1990 and a PhD in Computer Science from Berkeley in 1994. His dissertation on the PCP Theorem was a co-winner of the ACM Doctoral Dissertation prize. In 1994 he joined Princeton University as a faculty member, where he is now Charles C. Fitzmorris Professor of Computer Science. He is currently also Visiting Professor in Mathematics at the Institute for Advanced Study. He has received the Packard Fellowship (1997), Simons Investigator Award (2012), Gödel Prize (2001 and 2010), ACM Prize in Computing (formerly the ACM-Infosys Foundation Award in the Computing Sciences) (2012), and the Fulkerson Prize in Discrete Math (2012). He is a fellow of the American Academy of Arts and Sciences and member of the National Academy of Science.