Sanjeev Arora (born January 1968) is an Indian-American theoretical computer scientist who works in AI and Machine learning. He is a Charles C. Fitzmorris Professor in Computer Science at Princeton University.
Career He was a visiting scholar at the Institute for Advanced Study in 2002–03. In 2008 he was inducted as a Fellow of the Association for Computing Machinery. In 2011 he was awarded the ACM Infosys Foundation Award (now renamed ACM Prize in Computing), given to mid-career researchers in Computer Science. He is a two-time recipient of the Gödel Prize (2001 & 2010). Arora has been awarded the Fulkerson Prize for 2012 for his work on improving the approximation ratio for graph separators and related problems from O ( log n ) {\displaystyle O(\log n)} to O ( log n ) {\displaystyle O({\sqrt {\log n}})} (jointly with Satish Rao and Umesh Vazirani). In 2012 he became a Simons Investigator. Arora was elected in 2015 to the American Academy of Arts and Sciences and in 2018 to the National Academy of Sciences. He was a plenary speaker at the 2018 International Congress of Mathematicians. He is a coauthor (with Boaz Barak) of the book Computational Complexity: A Modern Approach. He was a founder of Princeton's Center for Computational Intractability. He and his coauthors have argued that certain financial products are associated with computational asymmetry, which under certain conditions may lead to market instability. Since September 2023, he is the founding Director of Princeton Language and Intelligence, a new unit at Princeton University devoted to study of large AI models and their applications.
Awards and Honors Sanjeev Arora, the Charles C. Fitzmorris Professor in Computer Science at Princeton University, has received numerous prestigious awards.
Books Arora, Sanjeev; Barak, Boaz (2009). Computational complexity: a modern approach. Cambridge University Press. ISBN 978-0-521-42426-4. OCLC 286431654.
References
External links Sanjeev Arora's Homepage Sanjeev Arora at the Mathematics Genealogy Project
