Sanjeev Arora
| Sanjeev Arora | |
|---|---|
| Born | January 1968 India |
| Residence | United States |
| Fields | Theoretical Computer Science |
| Institutions | Princeton University |
| Alma mater | Massachusetts Institute of Technology UC Berkeley |
| Doctoral advisor | Umesh Vazirani |
| Known for | Probabilistically checkable proofs PCP Theorem |
| Notable awards | Gödel Prize (2001, 2010) |
Sanjeev Arora (born January 1968 in Kota(Rajasthan)) is a theoretical computer scientist who is best known for his work on probabilistically checkable proofs and, in particular, the PCP theorem. He is currently the Charles C. Fitzmorris Professor of Computer Science at Princeton University, and his research interests include computational complexity theory, uses of randomness in computation, probabilistically checkable proofs, computing approximate solutions to NP-hard problems, and geometric embeddings of metric spaces.
He received the S.B. in Mathematics with Computer Science from MIT in 1990 and received a Ph.D. in Computer Science from the University of California, Berkeley in 1994 under Umesh Vazirani.
His Ph.D. thesis on probabilistically checkable proofs received the ACM Doctoral Dissertation Award in 1995.[1] He was awarded the Gödel Prize for his work on the PCP theorem in 2001 and again in 2010 for the discovery (concurrently with Joseph S. B. Mitchell) of a polynomial time approximation scheme for the euclidean travelling salesman problem. In 2008 he was inducted as a Fellow of the Association for Computing Machinery.[2]
He is a coauthor (with Boaz Barak) of the book "Computational Complexity: A Modern Approach".
[edit] Notes
http://en.wikipedia.org/wiki/List_of_IIT_JEE_Toppers
[edit] External links
|
|||||
