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."
Profile was last updated at May 16, 2021, 10:48 am
Research.com Ranking is based on Google Scholar H-Index.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: