Sanjeev Arora | |
|---|---|
 Arora at Oberwolfach, 2010 | |
| Born | January 1968 (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, Rong Ge |
Sanjeev Arora (born January 1968) is an Indian American theoretical computer scientist who works in AI and Machine learning.
- ^ a b "Sanjeev Arora". www.cs.princeton.edu.