Sanjeev Arora (computer scientist)
Sanjeev Arora | |
|---|---|
 Arora at Oberwolfach, 2010 | |
| Born | January 1968 (age 58) |
| Citizenship | United States[1] |
| Education | SB: Massachusetts Institute of Technology PhD: UC Berkeley |
| Known for | Probabilistically checkable proofs PCP theorem |
| Scientific career | |
| Fields | Theoretical computer science |
| Workplaces | Princeton University |
| Thesis | Probabilistic checking of proofs and the hardness of approximation problems. (1994) |
| Umesh Vazirani | |
Doctoral students | Subhash Khot, Elad Hazan, Rong Ge |
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
[edit]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.
Awards and Honors
[edit]Sanjeev Arora, the Charles C. Fitzmorris Professor in Computer Science at Princeton University, has received numerous prestigious awards.[10]
| # | Awards/Honors | Year(s) |
|---|---|---|
| 1 | 30-year Test of Time Award for FOCS 1993 | 2023 |
| 2 | Bell Labs Innovation Prize | 2020 |
| 3 | Plenary Speaker, International Congress of Mathematicians | 2018 |
| 4 | Inducted as Member, National Academy of Sciences | 2018 |
| 5 | Elected to American Academy of Arts and Sciences | 2015 |
| 6 | Simons Investigator | 2012-2022 |
| 7 | AMS-MOS D.R. Fulkerson Prize | 2012 |
| 8 | ACM Prize in Computing (formerly known as ACM-Infosys Foundation Award in the Computing Sciences) | 2011 |
| 9 | Best Paper, IEEE Foundations of Computer Science | 2010 |
| 10 | George Pólya Prize | 2010 |
| 11 | EATCS-SIGACT Gödel Prize | 2010, 2001 |
| 12 | Elected ACM Fellow | 2009 |
| 13 | Engineering Council Teaching Award, Princeton University | Fall 2008 |
| 14 | Graduate Mentoring Award, Princeton University | 2005 |
| 15 | Best Paper, ACM Symposium on Theory of Computing | 2004 |
| 16 | Semiplenary speaker, International Symposium on Mathematical Programming | 2003 |
| 17 | Distinguished Alumnus Award, UC Berkeley Computer Science | 2003 |
| 18 | Invited speaker, Mathematical Aspects of Computer Science session, International Congress of Mathematicians | 2002 |
| 19 | Plenary speaker, ACM Symposium on Theory of Computing | 1998 |
| 20 | David and Lucile Packard Foundation Fellowship | 1997-2002 |
| 21 | Alfred P. Sloan Fellowship | 1996 |
| 22 | NSF CAREER Award | 1995 |
| 23 | ACM Doctoral Dissertation Award (cowinner) | 1995 |
| 24 | IBM Graduate Fellowship | 1993 |
| 25 | Ranked first in India, IIT Joint Entrance Exam | 1986 |
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]- 1 2 "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. 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
- ↑ Arora, Sanjeev. "Bio | Sanjeev Arora". profsanjeevarora.github.io. Archived from the original on 2026-08-08.
External links
[edit]| International | |
|---|---|
| National | |
| Academics | |
| People | |
| Other | |
   | This article about an American mathematician is a stub. You can help Wikipedia by adding missing information. |
- 1968 births
- Living people
- Theoretical computer scientists
- 20th-century Indian mathematicians
- 20th-century American mathematicians
- Institute for Advanced Study visiting scholars
- Gödel Prize laureates
- Princeton University faculty
- Fellows of the American Academy of Arts and Sciences
- Scientists from Rajasthan
- People from Jodhpur
- 21st-century Indian mathematicians
- Simons Investigator
- Recipients of the ACM Prize in Computing
- Members of the United States National Academy of Sciences
- 21st-century American mathematicians
- American people of Punjabi descent
- American mathematician stubs
- Indian emigrants to the United States
- Punjabi people