Sanjeev Arora
Theoretical computer scientist / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Sanjeev Arora?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
This article is about computer scientist. For other uses, see Sanjeev Arora (disambiguation).
Sanjeev Arora (born January 1968) is an Indian American theoretical computer scientist who works in AI and Machine learning.
Quick Facts Born, Citizenship ...
Sanjeev Arora | |
---|---|
Born | January 1968 (1968-01) (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 |
Close