Sanjeev Arora

Sanjeev Arora
Arora at Oberwolfach, 2010
BornJanuary 1968 (1968-01) (age 57)
Jodhpur, Rajasthan, India
CitizenshipUnited States
Alma materSB: Massachusetts Institute of Technology
PhD: UC Berkeley
Known forProbabilistically checkable proofs
PCP theorem
Scientific career
FieldsTheoretical computer science
InstitutionsPrinceton University
ThesisProbabilistic checking of proofs and the hardness of approximation problems. (1994)
Doctoral advisorUmesh Vazirani
Doctoral studentsSubhash Khot, Elad Hazan, Rong Ge

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

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.