Sanjeev Arora (born January 1968) is an Indian American theoretical computer scientist who works in AI and Machine learning.
Sanjeev Arora | |
|---|---|
 Arora at Oberwolfach, 2010 | |
| Born | January 1968 (age 56) |
| Citizenship | United States[1] |
| Alma mater | SB: Massachusetts Institute of Technology PhD: UC Berkeley |
| Known for | Probabilistically checkable proofs PCP theorem |
| Scientific career | |
| Fields | Theoretical computer science |
| Institutions | Princeton University |
| Thesis | Probabilistic checking of proofs and the hardness of approximation problems. (1994) |
| Doctoral advisor | Umesh Vazirani |
| Doctoral students | Subhash Khot, Elad Hazan, Rong Ge |
Life
editSanjeev scored the IIT JEE number 1 rank in 1986
He was a visiting scholar at the Institute for Advanced Study in 2002–03.[2]
In 2008 he was inducted as a Fellow of the Association for Computing Machinery.[3] 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 to (jointly with Satish Rao and Umesh Vazirani).[4] In 2012 he became a Simons Investigator.[5] Arora was elected in 2015 to the American Academy of Arts and Sciences and in 2018 to the National Academy of Sciences.[6] He was a plenary speaker at the 2018 International Congress of Mathematicians.[7]
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.[8] He and his coauthors have argued that certain financial products are associated with computational asymmetry, which under certain conditions may lead to market instability.[9]
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.
Books
edit- Arora, Sanjeev; Barak, Boaz (2009). Computational complexity: a modern approach. Cambridge University Press. ISBN 978-0-521-42426-4. OCLC 286431654.
References
edit- ^ a b "Sanjeev Arora". www.cs.princeton.edu.
- ^ Institute for Advanced Study: A Community of Scholars Archived 2013-01-06 at the Wayback Machine
- ^ ACM: Fellows Award / Sanjeev Arora Archived 2011-08-23 at the Wayback Machine
- ^ Arora, Sanjeev; Rao, Satish; Vazirani, Umesh (2009). "Expander flows, geometric embeddings and graph partitioning". Journal of the ACM. 56 (2): 1–37. CiteSeerX 10.1.1.310.2258. doi:10.1145/1502793.1502794.
- ^ Simons Investigators Awardees, The Simons Foundation
- ^ "Professor Sanjeev Arora Elected to the National Academy of Sciences - Computer Science Department at Princeton University". www.cs.princeton.edu.
- ^ "Sanjeev Arora". www.cs.princeton.edu. Retrieved 2023-11-02.
- ^ "Video Archive". intractability.princeton.edu.
- ^ Arora, S, Barak, B, Brunnemeier, M 2011 "Computational Complexity and Information Asymmetry in Financial Products" Communications of the ACM, Issue 5 see FAQ Archived 2012-12-02 at the Wayback Machine
External links
edit
   | This article about an American mathematician is a stub. You can help Wikipedia by expanding it. |