World's Best Scientists 2026 revealed!

D-Index & Metrics

Mathematics

D-Index
41
Citations
9730
World Ranking
1872
National Ranking
799

Computer Science

D-Index
41
Citations
9730
World Ranking
8672
National Ranking
3720

Subhash Khot publication distribution in Mathematics in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Mathematics in 2026. The highlighted bar marks where Subhash Khot sits on this spectrum.

42–46 publications: 3 scientists 47–51 publications: 5 scientists 52–56 publications: 7 scientists 57–61 publications: 20 scientists 62–66 publications: 14 scientists 67–71 publications: 25 scientists 72–76 publications: 19 scientists 77–81 publications: 35 scientists 82–86 publications: 50 scientists 87–91 publications: 60 scientists 92–96 publications: 86 scientists 97–101 publications: 84 scientists 102–106 publications: 83 scientists 107–111 publications: 90 scientists 112–116 publications: 99 scientists 117–121 publications: 90 scientists 122–126 publications: 91 scientists 127–131 publications: 109 scientists 132–136 publications: 110 scientists 137–141 publications: 98 scientists 142–146 publications: 112 scientists 147–151 publications: 102 scientists 152–156 publications: 88 scientists 157–161 publications: 106 scientists 162–166 publications: 83 scientists 167–171 publications: 102 scientists 172–176 publications: 77 scientists 177–181 publications: 81 scientists 182–186 publications: 78 scientists 187–191 publications: 71 scientists 192–196 publications: 92 scientists 197–201 publications: 64 scientists 202–206 publications: 69 scientists 207–211 publications: 64 scientists 212–216 publications: 62 scientists 217–221 publications: 58 scientists 222–226 publications: 53 scientists 227–231 publications: 50 scientists 232–236 publications: 46 scientists 237–241 publications: 46 scientists 242–246 publications: 46 scientists 247–251 publications: 43 scientists 252–256 publications: 29 scientists 257–261 publications: 45 scientists 262–266 publications: 30 scientists 267–271 publications: 33 scientists 272–276 publications: 34 scientists 277–281 publications: 30 scientists 282–286 publications: 31 scientists 287–291 publications: 21 scientists 292–296 publications: 34 scientists 297–301 publications: 26 scientists 302–306 publications: 10 scientists 307–311 publications: 17 scientists 312–316 publications: 23 scientists 317–321 publications: 13 scientists 322–326 publications: 16 scientists 327–331 publications: 26 scientists 332–336 publications: 13 scientists 337–341 publications: 13 scientists 342–346 publications: 16 scientists 347–351 publications: 17 scientists 352–356 publications: 12 scientists 357–361 publications: 18 scientists 362–366 publications: 18 scientists 367–371 publications: 9 scientists 372–376 publications: 11 scientists 377–381 publications: 8 scientists 382–386 publications: 8 scientists 387–391 publications: 9 scientists 392–396 publications: 9 scientists 397–401 publications: 8 scientists 402–406 publications: 11 scientists 407–411 publications: 6 scientists 412–416 publications: 6 scientists 417–421 publications: 9 scientists 422–426 publications: 8 scientists 427–431 publications: 5 scientists 432–436 publications: 8 scientists 437–441 publications: 8 scientists 442–446 publications: 4 scientists 447–451 publications: 4 scientists 452–456 publications: 4 scientists 457–461 publications: 2 scientists 462–466 publications: 2 scientists 467–471 publications: 4 scientists 472–476 publications: 3 scientists 477–481 publications: 3 scientists 482–486 publications: 6 scientists 487–491 publications: 3 scientists 492–496 publications: 5 scientists 497–501 publications: 5 scientists 502–506 publications: 1 scientists 507–511 publications: 6 scientists 512–516 publications: 4 scientists 517–521 publications: 1 scientists 522–526 publications: 3 scientists 527–531 publications: 1 scientists 532–536 publications: 4 scientists 537+ publications: 100 scientists
42 publications 537+

This scientist: 134 publications — 29th percentile

29% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 537 publications or more.

Subhash Khot D-index placement in Mathematics in 2026

The chart shows the D-index (discipline H-index) distribution of Mathematics scientists ranked by Research.com in 2026. The highlighted bar marks where Subhash Khot sits on this spectrum.

30 D-Index: 174 scientists 31 D-Index: 151 scientists 32 D-Index: 174 scientists 33 D-Index: 117 scientists 34 D-Index: 136 scientists 35 D-Index: 127 scientists 36 D-Index: 145 scientists 37 D-Index: 153 scientists 38 D-Index: 150 scientists 39 D-Index: 150 scientists 40 D-Index: 138 scientists 41 D-Index: 136 scientists 42 D-Index: 93 scientists 43 D-Index: 108 scientists 44 D-Index: 115 scientists 45 D-Index: 112 scientists 46 D-Index: 103 scientists 47 D-Index: 75 scientists 48 D-Index: 59 scientists 49 D-Index: 67 scientists 50 D-Index: 60 scientists 51 D-Index: 57 scientists 52 D-Index: 59 scientists 53 D-Index: 62 scientists 54 D-Index: 60 scientists 55 D-Index: 50 scientists 56 D-Index: 42 scientists 57 D-Index: 54 scientists 58 D-Index: 50 scientists 59 D-Index: 42 scientists 60 D-Index: 41 scientists 61 D-Index: 35 scientists 62 D-Index: 40 scientists 63 D-Index: 21 scientists 64 D-Index: 31 scientists 65 D-Index: 27 scientists 66 D-Index: 29 scientists 67 D-Index: 19 scientists 68 D-Index: 25 scientists 69 D-Index: 17 scientists 70 D-Index: 18 scientists 71 D-Index: 12 scientists 72 D-Index: 14 scientists 73 D-Index: 13 scientists 74 D-Index: 18 scientists 75 D-Index: 9 scientists 76 D-Index: 11 scientists 77 D-Index: 10 scientists 78 D-Index: 9 scientists 79 D-Index: 16 scientists 80 D-Index: 12 scientists 81 D-Index: 10 scientists 82 D-Index: 5 scientists 83 D-Index: 5 scientists 84 D-Index: 13 scientists 85 D-Index: 6 scientists 86+ D-Index: 99 scientists
30 D-Index 86+

This scientist: 41 D-Index — 49th percentile

49% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 86 D-Index or more.

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

  • Vertex cover might be hard to approximate to within 2-ε

    Subhash Khot;Oded Regev

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

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

  • 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

  • Hardness of approximating the shortest vector problem in lattices

    Subhash Khot

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

    Subhash Khot

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

    S. Khot

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

    A. Chakrabarti;S. Khot;Xiaodong Sun

  • Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs

    Per Austrin;Subhash Khot;Muli Safra

  • Parameterized Complexity of Finding Subgraphs with Hereditary Properties

    Subhash Khot;Venkatesh Raman

  • A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover

    Irit Dinur;Venkatesan Guruswami;Subhash Khot;Oded Regev

  • New Results for Learning Noisy Parities and Halfspaces

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

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

    S. Khot

  • Unique games on expanding constraint graphs are easy: extended abstract

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

  • Nonembeddability theorems via Fourier analysis

    Subhash Khot;Assaf Naor

  • Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion

    Unknown

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

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

  • Optimal Long Code Test with One Free Bit

    Nikhil Bansal;Subhash Khot

  • Inapproximability of hypergraph vertex cover and applications to scheduling problems

    Nikhil Bansal;Subhash Khot

  • On the Unique Games Conjecture (Invited Survey)

    Subhash Khot

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

    S. Khot;O. Regev

  • Inapproximability results for combinatorial auctions with submodular utility functions

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

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

    Subhash A. Khot;Nisheeth K. Vishnoi

Frequent Co-Authors

Assaf Naor
Assaf Naor Princeton University
Irit Dinur
Irit Dinur Weizmann Institute of Science
Venkatesan Guruswami
Venkatesan Guruswami University of California, Berkeley
Ryan O'Donnell
Ryan O'Donnell Carnegie Mellon University
Oded Regev
Oded Regev Courant Institute of Mathematical Sciences
Sanjeev Arora
Sanjeev Arora Princeton University
Yuval Rabani
Yuval Rabani Hebrew University of Jerusalem
Vitaly Feldman
Vitaly Feldman Apple (United States)
Howard Karloff
Howard Karloff Amazon (United States)

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

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

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.

Best Scientists Citing Subhash Khot

Trending Scientists

Recently Published Articles