2026 Subhash Khot: Mathematics Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	41	8673	8424	3720	3572	135	9730
Mathematics	41	1872	1633	798	649	134	9730

Research.com Recognitions

2017 - Fellow of the Royal Society, United Kingdom
2016 - Fellow of the MacArthur Foundation
2014 - Rolf Nevanlinna Prize "For his prescient definition of the “Unique Games” problem, and leading the effort to understand its complexity and its pivotal role in the study of efficient approximation of optimization problems; his work has led to breakthroughs in algorithmic design and approximation hardness, and to new exciting interactions between computational complexity, analysis and geometry."[12]
2010 - National Science Foundation Alan T. Waterman Award Computer Science
2006 - Fellow of Alfred P. Sloan Foundation

Overview

Subhash Khot is affiliated with the Courant Institute of Mathematical Sciences in the United States. Their research is concentrated primarily in the field of Computer Science, with a specific focus on Computational Theory and Mathematics. Additional subfields include Artificial Intelligence, Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design, and Management Science and Operations Research.

The scientist's work covers several main topics, notably Complexity and Algorithms in Graphs, Advanced Graph Theory Research, Computational Geometry and Mesh Generation, Limits and Structures in Graph Theory, Computability, Logic, AI Algorithms, semigroups and automata theory, and Machine Learning and Algorithms.

Frequent publication venues where this researcher has disseminated their findings include:

arXiv (Cornell University)
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Theory of Computing
Annals of Mathematics
SIAM Journal on Computing

Recent papers authored or co-authored by Subhash Khot include the following:

"Pseudorandom sets in Grassmann graph have near-perfect expansion," 2023, Annals of Mathematics
"Almost Polynomial Factor Inapproximability for Parameterized k-Clique," 2022, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
"Effective Bounds for Restricted 3-Arithmetic Progressions in pⁿ," 2023, arXiv (Cornell University)
"On Rich 2-to-1 Games," 2021, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Subhash Khot has collaborated frequently with several co-authors, including:

Dor Minzer
Amey Bhangale
Mark Braverman
Yang P. Liu
Muli Safra

Awards received by Subhash Khot highlight recognition from various institutions and foundations. These include:

Fellow of the Royal Society, United Kingdom, 2017
Fellow of the MacArthur Foundation, 2016
Rolf Nevanlinna Prize, 2014, awarded for contributions to the definition and study of the "Unique Games" problem and its implications for algorithmic design and computational complexity
National Science Foundation Alan T. Waterman Award, 2010
Fellow of Alfred P. Sloan Foundation, 2006

Best Publications

On the power of unique 2-prover 1-round games

Subhash Khot

1416
Citations
Vertex cover might be hard to approximate to within 2-ε

Subhash Khot;Oded Regev

937
Citations
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?

Subhash Khot;Guy Kindler;Elchanan Mossel;Ryan O’Donnell

835
Citations
The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into l/sub 1/

S.A. Khot;N.K. Vishnoi

439
Citations
Hardness of approximating the shortest vector problem in lattices

Subhash Khot

360
Citations
Ruling Out PTAS for Graph Min-Bisection, Dense k-Subgraph, and Bipartite Clique

Subhash Khot

317
Citations
Improved inapproximability results for MaxClique, chromatic number and approximate graph coloring

S. Khot

278
Citations
Near-optimal lower bounds on the multi-party communication complexity of set disjointness

A. Chakrabarti;S. Khot;Xiaodong Sun

245
Citations
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs

Per Austrin;Subhash Khot;Muli Safra

234
Citations
Parameterized Complexity of Finding Subgraphs with Hereditary Properties

Subhash Khot;Venkatesh Raman

217
Citations
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover

Irit Dinur;Venkatesan Guruswami;Subhash Khot;Oded Regev

201
Citations
New Results for Learning Noisy Parities and Halfspaces

V. Feldman;P. Gopalan;S. Khot;A.K. Ponnuswami

193
Citations
Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique

S. Khot

191
Citations
Unique games on expanding constraint graphs are easy: extended abstract

Sanjeev Arora;Subhash A. Khot;Alexandra Kolla;David Steurer

177
Citations
Nonembeddability theorems via Fourier analysis

Subhash Khot;Assaf Naor

175
Citations
Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion

Unknown

165
Citations
Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?

S. Khot;G. Kindler;E. Mossel;R. O'Donnell

154
Citations
Optimal Long Code Test with One Free Bit

Nikhil Bansal;Subhash Khot

140
Citations
Inapproximability of hypergraph vertex cover and applications to scheduling problems

Nikhil Bansal;Subhash Khot

127
Citations
On the Unique Games Conjecture (Invited Survey)

Subhash Khot

125
Citations
Vertex cover might be hard to approximate to within 2-/spl epsiv/

S. Khot;O. Regev

115
Citations
Inapproximability results for combinatorial auctions with submodular utility functions

Subhash Khot;Richard J. Lipton;Evangelos Markakis;Aranyak Mehta

101
Citations
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ1

Subhash A. Khot;Nisheeth K. Vishnoi

80
Citations

Frequent Co-Authors

Assaf Naor Princeton University

Irit Dinur Weizmann Institute of Science

Venkatesan Guruswami University of California, Berkeley

Ryan O'Donnell Carnegie Mellon University

Oded Regev Courant Institute of Mathematical Sciences

Sanjeev Arora Princeton University

Yuval Rabani Hebrew University of Jerusalem

Vitaly Feldman Apple (United States)

Elchanan Mossel MIT

Howard Karloff Amazon (United States)

External Links

Wikipedia of Subhash Khot Personal website of Subhash Khot

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

For students pursuing Mathematics in the USA, exploring related online degrees can broaden career opportunities in diverse industries. Many professionals complement their math skills with business-focused qualifications to enhance leadership potential.

One popular option is an online MBA. Programs like the easiest online mba program provide flexibility and accessible coursework for those balancing work and study. If cost is a primary concern, seeking the cheapest dba online can be a strategic choice without sacrificing quality or recognition.

For math graduates interested in finance, pursuing the best online masters in finance offers specialized knowledge to enter high-demand financial sectors. Alternatively, to expedite career advancement, some opt for the shortest online mba programs, which allow earning a degree in less time while maintaining rigor.

Choosing the right combination of mathematics and related business degrees online can accelerate career pathways in analytics, management, finance, and beyond, supporting long-term professional growth.