Subhash Khot

FRS
Born (1978-06-10) 10 June 1978 (age 45)
Ichalkaranji, Maharashtra, India
Alma materPrinceton University, IIT Bombay
Known forUnique games conjecture
AwardsWaterman Award (2010)
Rolf Nevanlinna Prize (2014)
MacArthur Fellow (2016)
Fellow of the Royal Society (2017)
Scientific career
FieldsComputer Science
InstitutionsGeorgia Tech
Courant Institute of Mathematical Sciences
University of Chicago
Doctoral advisorSanjeev Arora

Subhash Khot FRS (born 10 June 1978 in Ichalkaranji) is an Indian-American mathematician and theoretical computer scientist who is the Julius Silver Professor of Computer Science in the Courant Institute of Mathematical Sciences at New York University. Khot has contributed to the field of computational complexity, and is best known for his unique games conjecture.[1]

Khot received the 2014 Rolf Nevanlinna Prize by the International Mathematical Union and received the MacArthur Fellowship in 2016.[2] He was elected a Fellow of the Royal Society in 2017[3] and was inducted into the National Academy of Sciences in 2023.[4]

Education

Khot obtained his bachelor's degree in computer science from the Indian Institute of Technology Bombay in 1999.[citation needed] He received his doctorate degree in computer science from Princeton University in 2003 under the supervision of Sanjeev Arora. His doctoral dissertation was titled "New Techniques for Probabilistically Checkable Proofs and Inapproximability Results."[5]

Honours and awards

Khot is a two time silver medallist representing India at the International Mathematical Olympiad (1994 and 1995).[6][7] Khot topped the highly difficult IIT JEE entrance exam in 1995.

He has been awarded the Microsoft Research New Faculty Fellowship Award (2005),[8] the Alan T. Waterman Award (2010), the Rolf Nevanlinna Prize for his work on the Unique Games Conjecture (2014), and the MacArthur Fellowship (2016).[9]

He was elected a Fellow of the Royal Society in 2017,[10] and was elected to the National Academy of Sciences in 2023.[11]

References

  1. ^ Khot, Subhash (2002), "On the power of unique 2-prover 1-round games", Proceedings of the 17th Annual IEEE Conference on Computational Complexity, p. 25, CiteSeerX 10.1.1.133.5651, doi:10.1109/CCC.2002.1004334, ISBN 978-0-7695-1468-0, S2CID 32966635.
  2. ^ "Subhash Khot - MacArthur Foundation".
  3. ^ "Subhash Khot". Royal Society. Archived from the original on 23 May 2017. Retrieved 27 May 2017.
  4. ^ "News | NYU Courant". cims.nyu.edu. Retrieved 27 August 2023.
  5. ^ "ACM Doctoral Dissertation Award 2003". Archived from the original on 3 November 2014. Retrieved 13 September 2014.
  6. ^ Subhash Khot's results at International Mathematical Olympiad
  7. ^ Shirali, S.A. (2006), "The Sierpinski problem", Resonance, 11 (2): 78–87, doi:10.1007/BF02837277, S2CID 121269449
  8. ^ Microsoft Faculty Fellowship Recipients 2005
  9. ^ "MacArthur Fellows Program". Archived from the original on 2 April 2012.
  10. ^ "Subhash Khot". Royal Society. Archived from the original on 23 May 2017. Retrieved 27 May 2017.
  11. ^ "News | NYU Courant". cims.nyu.edu. Retrieved 27 August 2023.
Categories