Sanjeev Arora

{{Infobox scientist

| name = Sanjeev Arora

| image = Sanjeev Arora.jpg

| image_size =

| caption = Arora at Oberwolfach, 2010

| birth_date = {{birth-date and age|January 1968}}

| birth_place = Jodhpur,{{cite web|url=http://www.cs.princeton.edu/~arora/bio.html|title=Sanjeev Arora|website=www.cs.princeton.edu}} Rajasthan, India

| death_date =

| death_place =

| citizenship = United States

| nationality =

| ethnicity =

| fields = Theoretical computer science

| workplaces = Princeton University

| alma_mater = SB: Massachusetts Institute of Technology

PhD: UC Berkeley

| thesis_title = Probabilistic checking of proofs and the hardness of approximation problems.

| thesis_url = https://www.cs.princeton.edu/~arora/pubs/thesis.pdf

| thesis_year = 1994

| doctoral_advisor = Umesh Vazirani

| academic_advisors =

| doctoral_students = Subhash Khot, Elad Hazan, Rong Ge

| notable_students =

| known_for = Probabilistically checkable proofs
PCP theorem

| author_abbrev_bot =

| author_abbrev_zoo =

| influences =

| influenced =

| awards =

| religion =

| signature =

| footnotes =

}}

Sanjeev Arora (born January 1968) is an Indian-American theoretical computer scientist who works in AI and Machine learning.

Life

Sanjeev scored the IIT JEE number 1 rank in 1986

He was a visiting scholar at the Institute for Advanced Study in 2002–03.[http://www.ias.edu/people/cos/frontpage?page=5 Institute for Advanced Study: A Community of Scholars] {{webarchive|url=https://web.archive.org/web/20130106144349/http://www.ias.edu/people/cos/frontpage?page=5 |date=2013-01-06 }}

In 2008 he was inducted as a Fellow of the Association for Computing Machinery.[http://fellows.acm.org/fellow_citation.cfm?id=N027029&srt=all ACM: Fellows Award / Sanjeev Arora] {{webarchive|url=https://web.archive.org/web/20110823060626/http://fellows.acm.org/fellow_citation.cfm?id=N027029&srt=all |date=2011-08-23 }}

In 2011 he was awarded the [http://www.acm.org/news/featured/acm-infosys-award-2011 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)$ to $O(\sqrt{\log n})$ (jointly with Satish Rao and Umesh Vazirani).{{cite journal |last1=Arora |first1=Sanjeev |last2=Rao |first2=Satish |last3=Vazirani |first3=Umesh |year=2009 |title=Expander flows, geometric embeddings and graph partitioning |journal=Journal of the ACM |volume=56 |issue=2 |pages=1–37 |citeseerx=10.1.1.310.2258 |doi=10.1145/1502793.1502794}} In 2012 he became a Simons Investigator.[https://www.simonsfoundation.org/mathematics-physical-sciences/simons-investigators/simons-investigators-awardees/ Simons Investigators Awardees], The Simons Foundation Arora was elected in 2015 to the American Academy of Arts and Sciences and in 2018 to the National Academy of Sciences.{{cite web|url=https://www.cs.princeton.edu/news/professor-sanjeev-arora-elected-national-academy-sciences|title=Professor Sanjeev Arora Elected to the National Academy of Sciences - Computer Science Department at Princeton University|website=www.cs.princeton.edu}} He was a plenary speaker at the 2018 International Congress of Mathematicians.{{Cite web |title=Sanjeev Arora |url=https://www.cs.princeton.edu/~arora/bio.html |access-date=2023-11-02 |website=www.cs.princeton.edu}}

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.{{cite web|url=http://intractability.princeton.edu/|title=Video Archive|website=intractability.princeton.edu}} He and his coauthors have argued that certain financial products are associated with computational asymmetry, which under certain conditions may lead to market instability.Arora, S, Barak, B, Brunnemeier, M 2011 "Computational Complexity and Information Asymmetry in Financial Products" Communications of the ACM, Issue 5 [http://www.cs.princeton.edu/~rongge/derivativeFAQ.html see FAQ] {{webarchive|url=https://web.archive.org/web/20121202200552/http://www.cs.princeton.edu/~rongge/derivativeFAQ.html |date=2012-12-02 }}

Since September 2023, he is the founding Director of [https://pli.princeton.edu/ Princeton Language and Intelligence], a new unit at Princeton University devoted to study of large AI models and their applications.

Books

{{cite book |last1=Arora |first1=Sanjeev |last2=Barak |first2=Boaz |title=Computational complexity: a modern approach |publisher=Cambridge University Press |date=2009 |isbn=978-0-521-42426-4 |oclc=286431654}}

References

External links

[http://www.cs.princeton.edu/~arora/ Sanjeev Arora's Homepage]
[http://genealogy.math.ndsu.nodak.edu/id.php?id=69543 Sanjeev Arora at the Mathematics Genealogy Project]

Category:1968 births

Category:Living people

Category:Theoretical computer scientists

Category:20th-century Indian mathematicians

Category:20th-century American mathematicians

Category:Institute for Advanced Study visiting scholars

Category:Gödel Prize laureates

Category:Princeton University faculty

Category:Fellows of the American Academy of Arts and Sciences

Category:Scientists from Rajasthan

Category:People from Jodhpur

Category:21st-century Indian mathematicians