Sanjeev Arora (born January 1968) is anIndian-Americantheoretical computer scientist who works in AI and Machine learning.
Sanjeev Arora | |
|---|---|
 Arora atOberwolfach, 2010 | |
| Born | January 1968 (1968-01) (age 57) |
| 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 theInstitute for Advanced Study in 2002–03.[2]
In 2008 he was inducted as a Fellow of theAssociation for Computing Machinery.[3] In 2011 he was awarded theACM Infosys Foundation Award (now renamedACM Prize in Computing), given to mid-career researchers in Computer Science. He is a two time recipient of theGödel Prize (2001 & 2010). Arora has been awarded theFulkerson Prize for 2012 for his work on improving theapproximation ratio forgraph separators and related problems from to (jointly withSatish Rao andUmesh Vazirani).[4] In 2012 he became aSimons Investigator.[5] Arora was elected in 2015 to theAmerican Academy of Arts and Sciences and in 2018 to theNational Academy of Sciences.[6] He was aplenary speaker at the 2018International Congress of Mathematicians.[7]
He is a coauthor (withBoaz Barak) of the bookComputational Complexity: A Modern Approach. He was a founder of Princeton's Center forComputational Intractability.[8] He and his coauthors have argued that certainfinancial products are associated with computationalasymmetry, which under certain conditions may lead tomarket instability.[9]
Since September 2023, he is the founding Director ofPrinceton 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- ^ab"Sanjeev Arora".www.cs.princeton.edu.
- ^Institute for Advanced Study: A Community of ScholarsArchived 2013-01-06 at theWayback Machine
- ^ACM: Fellows Award / Sanjeev AroraArchived 2011-08-23 at theWayback 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. Retrieved2023-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 5see FAQArchived 2012-12-02 at theWayback Machine
External links
edit   | This article about an American mathematician is astub. You can help Wikipedia byexpanding it. |