| 2026 | STOC | An Analytical Approach to Parallel Repetition via CSP Inverse Theorems. | Amey Bhangale, Mark Braverman, Subhash Khot, Yang Liu, Dor Minzer, Kunal Mittal |
| 2025 | FOCS | On Inverse Theorems and Combinatorial Lines. | Amey Bhangale, Subhash Khot, Yang P. Liu, Dor Minzer |
| 2025 | SODA | Maximum Span Hypothesis: A Potentially Weaker Assumption than Gap-ETH for Parameterized Complexity. | Karthik C. S., Subhash Khot |
| 2025 | STOC | Parallel Repetition for 3-Player XOR Games. | Amey Bhangale, Mark Braverman, Subhash Khot, Yang P. Liu, Dor Minzer |
| 2025 | STOC | On Approximability of Satisfiable k-CSPs: V. | Amey Bhangale, Subhash Khot, Dor Minzer |
| 2024 | STOC | On Approximability of Satisfiable k-CSPs: IV. | Amey Bhangale, Subhash Khot, Dor Minzer |
| 2023 | FOCS | Parallel Repetition for the GHZ Game: Exponential Decay. | Mark Braverman, Subhash Khot, Dor Minzer |
| 2023 | STOC | On Approximability of Satisfiable k-CSPs: II. | Amey Bhangale, Subhash Khot, Dor Minzer |
| 2023 | STOC | On Approximability of Satisfiable k-CSPs: III. | Amey Bhangale, Subhash Khot, Dor Minzer |
| 2022 | STOC | On approximability of satisfiable | Amey Bhangale, Subhash Khot, Dor Minzer |
| 2021 | FOCS | An Invariance Principle for the Multi-slice, with Applications. | Mark Braverman, Subhash Khot, Noam Lifshitz, Dor Minzer |
| 2021 | STOC | Optimal inapproximability of satisfiable k-LIN over non-abelian groups. | Amey Bhangale, Subhash Khot |
| 2019 | SODA | The Andoni-Krauthgamer-Razenshteyn characterization of sketchable norms fails for sketchable metrics. | Subhash Khot, Assaf Naor |
| 2018 | FOCS | Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion. | Subhash Khot, Dor Minzer, Muli Safra |
| 2018 | SODA | Near-optimal approximation algorithm for simultaneous Max-Cut. | Amey Bhangale, Subhash Khot, Swastik Kopparty, Sushant Sachdeva, Devanathan Thiruvenkatachari |
| 2018 | STOC | Towards a proof of the 2-to-1 games conjecture? | Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra |
| 2018 | STOC | On non-optimally expanding sets in Grassmann graphs. | Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra |
| 2017 | STOC | On independent sets, 2-to-2 games, and Grassmann graphs. | Subhash Khot, Dor Minzer, Muli Safra |
| 2016 | ESA | Hardness of Bipartite Expansion. | Subhash Khot, Rishi Saket |
| 2016 | ICALP | Hardness of Approximation. | Subhash Khot |
| 2016 | STOC | Candidate hard unique game. | Subhash Khot, Dana Moshkovitz |
| 2015 | FOCS | On Monotonicity Testing and Boolean Isoperimetric Type Theorems. | Subhash Khot, Dor Minzer, Muli Safra |
| 2015 | ICALP | Approximating CSPs Using LP Relaxation. | Subhash Khot, Rishi Saket |
| 2014 | FOCS | Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with exp(log^{Omega(1)} n) Colors. | Subhash Khot, Rishi Saket |
| 2014 | ICALP | The Complexity of Somewhat Approximation Resistant Predicates. | Subhash Khot, Madhur Tulsiani, Pratik Worah |
| 2014 | SODA | Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs. | Subhash Khot, Rishi Saket |
| 2014 | STOC | A characterization of strong approximation resistance. | Subhash Khot, Madhur Tulsiani, Pratik Worah |
| 2012 | FOCS | Hardness of Finding Independent Sets in Almost q-Colorable Graphs. | Subhash Khot, Rishi Saket |
| 2012 | STOC | 2 | Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi |
| 2011 | FOCS | A Two Prover One Round Game with Strong Soundness. | Subhash Khot, Muli Safra |
| 2011 | ICALP | A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem. | Per Austrin, Subhash Khot |
| 2011 | STOC | NP-hardness of approximately solving linear equations over reals. | Subhash Khot, Dana Moshkovitz |
| 2010 | FOCS | Hardness of Finding Independent Sets in Almost 3-Colorable Graphs. | Irit Dinur, Subhash Khot, Will Perkins, Muli Safra |
| 2010 | ICALP | Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems. | Nikhil Bansal, Subhash Khot |
| 2010 | ICALP | SDP Gaps for 2-to-1 and Other Label-Cover Variants. | Venkatesan Guruswami, Subhash Khot, Ryan O'Donnell, Preyas Popat, Madhur Tulsiani, Yi Wu |
| 2010 | SODA | Sharp Kernel Clustering Algorithms and Their Associated Grothendieck Inequalities. | Subhash Khot, Assaf Naor |
| 2009 | FOCS | Optimal Long Code Test with One Free Bit. | Nikhil Bansal, Subhash Khot |
| 2009 | FOCS | SDP Integrality Gaps with Local ell_1-Embeddability. | Subhash Khot, Rishi Saket |
| 2008 | COLT | Minimizing Wide Range Regret with Time Selection Functions. | Subhash Khot, Ashok Kumar Ponnuswami |
| 2008 | FOCS | Approximate Kernel Clustering. | Subhash Khot, Assaf Naor |
| 2008 | FOCS | Hardness of Minimizing and Learning DNF Expressions. | Subhash Khot, Rishi Saket |
| 2008 | STOC | Unique games on expanding constraint graphs are easy: extended abstract. | Sanjeev Arora, Subhash Khot, Alexandra Kolla, David Steurer, Madhur Tulsiani, Nisheeth K. Vishnoi |
| 2008 | STOC | On hardness of learning intersection of two halfspaces. | Subhash Khot, Rishi Saket |
| 2007 | FOCS | Hardness of Reconstructing Multivariate Polynomials over Finite Fields. | Parikshit Gopalan, Subhash Khot, Rishi Saket |
| 2007 | FOCS | Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies. | Subhash Khot, Assaf Naor |
| 2006 | FOCS | New Results for Learning Noisy Parities and Halfspaces. | Vitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami |
| 2006 | FOCS | SDP gaps and UGC-hardness for MAXCUTGAIN. | Subhash Khot, Ryan O'Donnell |
| 2006 | ICALP | Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion. | Subhash Khot, Ashok Kumar Ponnuswami |
| 2006 | STOC | Integrality gaps for sparsest cut and minimum linear arrangement problems. | Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nisheeth K. Vishnoi |
| 2006 | STOC | On earthmover distance, metric labeling, and 0-extension. | Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani |
| 2005 | FOCS | Hardness of Approximating the Closest Vector Problem with Pre-Processing. | Mikhail Alekhnovich, Subhash Khot, Guy Kindler, Nisheeth K. Vishnoi |
| 2005 | FOCS | On the Unique Games Conjecture. | Subhash Khot |
| 2005 | FOCS | Nonembeddability theorems via Fourier analysis. | Subhash Khot, Assaf Naor |
| 2005 | FOCS | The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l | Subhash Khot, Nisheeth K. Vishnoi |
| 2004 | FOCS | Hardness of Approximating the Shortest Vector Problem in Lattices. | Subhash Khot |
| 2004 | FOCS | Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique. | Subhash Khot |
| 2004 | FOCS | Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs? | Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell |
| 2004 | STOC | A new PCP outer verifier with applications to homogeneous linear equations and max-bisection. | Jonas Holmerin, Subhash Khot |
| 2003 | FOCS | Hardness of Approximating the Shortest Vector Problem in High L | Subhash Khot |
| 2003 | STOC | A new multilayered PCP and the hardness of hypergraph vertex cover. | Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev |
| 2003 | STOC | Cell-probe lower bounds for the partial match problem. | T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani |
| 2002 | FOCS | Hardness Results for Coloring 3 -Colorable 3 -Uniform Hypergraphs. | Subhash Khot |
| 2002 | STOC | Fitting algebraic curves to noisy data. | Sanjeev Arora, Subhash Khot |
| 2002 | STOC | Hardness results for approximate hypergraph coloring. | Subhash Khot |
| 2002 | STOC | On the power of unique 2-prover 1-round games. | Subhash Khot |
| 2001 | FOCS | Query Efficient PCPs with Perfect Completeness. | Johan Hstad, Subhash Khot |
| 2001 | FOCS | Improved Inaproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring. | Subhash Khot |
| 2001 | ICALP | Improved Lower Bounds on the Randomized Complexity of Graph Properties. | Amit Chakrabarti, Subhash Khot |
| 2001 | STACS | Evasiveness of Subgraph Containment and Related Properties. | Amit Chakrabarti, Subhash Khot, Yaoyun Shi |
| 2000 | COCOON | Parameterized Complexity of Finding Subgraphs with Hereditary Properties. | Subhash Khot, Venkatesh Raman |