Sanjeev Arora

from Wikipedia, the free encyclopedia
Sanjeev Arora

Sanjeev Arora (born January 1968 in Jodhpur , India ) is an American computer scientist of Indian origin.

Life

Arora (who was the best in India in 1986 national entrance exams for the Indian Institute of Technology ) studied mathematics and computer science at the Massachusetts Institute of Technology (Bachelor 1990) and received her PhD in 1994 with Umesh Vazirani at the University of California, Berkeley . He received the ACM Doctoral Dissertation Award for his dissertation ( Probabilistic checking of proofs and the hardness of approximation problems ) on probabilistically verifiable proofs (PCP) with proof of the PCP theorem . In 1994 he became Assistant Professor, 1999 Associate Professor and 2003 Professor of Computer Science at Princeton University . He was visiting scholar at Microsoft Research (2006/07) and at the Weizmann Institute .

From 1996 to 1998 he was a Sloan Research Fellow . In 2001 he and others received the Gödel Prize for the PCP theorem and in 2010 again with Joseph SB Mitchell for a polynomial time approximation for the Euclidean problem of the traveling salesman . Arora received the ACM Infosys Award from the Association for Computing Machinery (ACM) for 2011. In 2002 he was invited speaker at the International Congress of Mathematicians in Beijing (How NP got a new definition: a survey of probabilistic checkable proofs). In 2012 he was awarded the Fulkerson Prize , in 2015 he was elected to the American Academy of Arts and Sciences , and in 2018 to the National Academy of Sciences . In 2018 he is plenary speaker at the ICM in Rio ( Mathematics of machine learning: An introduction ).

Subhash Khot is one of his PhD students .

Fonts

  • With Boaz Barak: Computational Complexity , Cambridge University Press 2009
  • With Shmuel Safra : Probabilistic checking of proofs: A new characterization of NP , Journal of the ACM, Volume 45, 1998, pp. 70-122
  • Polynomial-time Approximation Schemes for Euclidean TSP and other Geometric Problems , Journal of the ACM, Volume 45, 1998, pp. 753-782
  • with C. Lund, R. Motwani, M. Sudan, M. Szegedy: Proof verification and the hardness of approximation problems , Journal of the ACM, Volume 45, 1998, pp. 501-555
  • How NP got a new definition: a survey of probabilistically checkable proofs , ICM Beijing 2002, Arxiv
  • with S. Rao, U. Vazirani: Expander flows, geometric embeddings and graph partitioning , Journal of the ACM (JACM), Volume 56, 2009, p. 5
  • with Prashant Doshi: A Survey of Inverse Reinforcement Learning: Challenges, Methods and Progress , Arxiv 2018

literature

Web links

Footnotes

  1. ↑ a b According to the biographical information on his homepage http://www.cs.princeton.edu/~arora/bio.html
  2. ^ Princeton Computer Scientist Sanjeev Arora Honored for Breakthroughs that Have Advanced the Power of Computing at the Association for Computing Machinery (acm.org); Retrieved March 29, 2012
personal data
SURNAME Arora, Sanjeev
BRIEF DESCRIPTION American theoretical computer scientist
DATE OF BIRTH January 1968
PLACE OF BIRTH India