Subhash KhotFRS (born 10 June 1978 inIchalkaranji)[1] is anIndian-Americanmathematician andtheoretical computer scientist who is the Julius Silver Professor of Computer Science in theCourant Institute of Mathematical Sciences atNew York University. Khot has contributed to the field ofcomputational complexity, and is best known for hisunique games conjecture.[2]
Subhash Khot | |
|---|---|
| Born | (1978-06-10)10 June 1978 (age 46) Ichalkaranji, Maharashtra, India |
| Alma mater | Princeton University,IIT Bombay |
| Known for | Unique games conjecture |
| Awards | Waterman Award (2010) Rolf Nevanlinna Prize (2014) MacArthur Fellow (2016) Fellow of the Royal Society (2017) |
| Scientific career | |
| Fields | Computer Science |
| Institutions | Georgia Tech Courant Institute of Mathematical Sciences University of Chicago |
| Doctoral advisor | Sanjeev Arora |
Khot received the 2014Rolf Nevanlinna Prize by theInternational Mathematical Union and received theMacArthur Fellowship in 2016.[3] He was elected aFellow of the Royal Society in 2017[4] and was inducted into theNational Academy of Sciences in 2023.[5]
Education
editKhot obtained his bachelor's degree incomputer science from theIndian Institute of Technology Bombay in 1999.[6] He received his doctorate degree in computer science fromPrinceton University in 2003 under the supervision ofSanjeev Arora. His doctoral dissertation was titled "New Techniques for Probabilistically Checkable Proofs and Inapproximability Results."[7]
Honours and awards
editKhot is a two time silver medallist representing India at theInternational Mathematical Olympiad (1994 and 1995).[8][9] Khot topped the highly difficult IITJEE entrance exam in 1995.
He has been awarded the Microsoft Research New Faculty Fellowship Award (2005),[10] theAlan T. Waterman Award (2010), theRolf Nevanlinna Prize for his work on theUnique Games Conjecture (2014), and the MacArthur Fellowship (2016).[11]
He was elected a Fellow of the Royal Society in 2017,[12] and was elected to the National Academy of Sciences in 2023.[13]
References
edit- ^"Subhash Khot - Heidelberg Laureate Forum".- Heidelberg Laureate Forum. Retrieved3 July 2024.
- ^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.
- ^"Subhash Khot - MacArthur Foundation".
- ^"Subhash Khot". Royal Society. Archived fromthe original on 23 May 2017. Retrieved27 May 2017.
- ^"News | NYU Courant".cims.nyu.edu. Retrieved27 August 2023.
- ^"Prof. Subhash Khot, B.Tech., 1999, Computer Science and Engineering".Alumni. IIT Bombay. Retrieved4 April 2024.
- ^"ACM Doctoral Dissertation Award 2003". Archived fromthe original on 3 November 2014. Retrieved13 September 2014.
- ^Subhash Khot's results atInternational Mathematical Olympiad
- ^Shirali, S.A. (2006), "The Sierpinski problem",Resonance,11 (2):78–87,doi:10.1007/BF02837277,S2CID 121269449
- ^Microsoft Faculty Fellowship Recipients 2005
- ^"MacArthur Fellows Program". Archived fromthe original on 2 April 2012.
- ^"Subhash Khot". Royal Society. Archived fromthe original on 23 May 2017. Retrieved27 May 2017.
- ^"News | NYU Courant".cims.nyu.edu. Retrieved27 August 2023.
External links
edit"Biographie de SUBHASH KHOT (1978- )".Encyclopædia Universalis (in French).