Sanjeev Arora
Sanjeev Arora (born January 1968) is an Indian American theoretical computer scientist.
Sanjeev Arora | |
|---|---|
Arora at Oberwolfach, 2010 | |
| Born | January 1968 (age 56) |
| Citizenship | United States |
| 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 |
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.