Subhash Khot
Subhash Khot | |
|---|---|
| Alma mater | Princeton University, IIT Bombay |
| Known for | Unique games conjecture |
| Awards | Waterman Award (2010) |
| Scientific career | |
| Fields | Computer Science |
| Institutions | Georgia Tech Courant Institute of Mathematical Sciences |
| Doctoral advisor | Sanjeev Arora |
Subhash Khot is an Associate Professor of Computer Science at New York University most well known for his Unique games conjecture.[1]
Khot holds a bachelor’s degree from the Indian Institute of Technology Bombay in 1999, and received his doctorate in computer science from Princeton University in 2003 under the supervision of Sanjeev Arora. He has made several contributions to computational complexity and his work draws connections between optimization, computer science, mathematics.
In 2010 Khot received the Alan T. Waterman Award, which recognizes an early career scientist for outstanding contributions in their field. In addition to a medal, Waterman awardees also receive a $500,000 grant for advanced research.[2]
Subhash Khot is a two time International Mathematics Olympiad silver medalist[3] and stood first in the IIT-JEE 1995, the Joint Entrance Examination for admission to the IITs.[4]
References
- ^ Khot, Subhash (2002), "On the power of unique 2-prover 1-round games", Proceedings of the 17th Annual IEEE Conference on Computational Complexity, doi:10.1109/CCC.2002.1004334.
- ^ National Science Foundation, Alan T. Waterman Award.
- ^ Subhash Khot's results at International Mathematical Olympiad
- ^ Shirali, S.A. (2006), "The Sierpinski problem", Resonance, 11 (2), Berlin, New York: Springer-Verlag: 78–87