Sanjeev AroraPrinceton University
G2R World Ranking 1319th
G2R United States Ranking 787th
H-Index & Metrics
|Number of Google Citations||21,415|
|Number of Articles on DBLP||172|
Awards & Achievements
- 2011 - ACM Prize in Computing For contributions to computational complexity, algorithms, and optimization that have helped reshape our understanding of computation.
- 2008 - ACM Fellow For foundational work on probabilistically checkable proofs and approximate solutions to NP-hard optimization problems.
- 1995 - ACM Doctoral Dissertation Award For his dissertation "Probabilistic Checking of Proofs and Hardness of Approximation Problems."