Subhash Khot
Impact in
- Computational Theory and Mathematics top 0.1%
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
- Computability, Logic, AI Algorithms
-
- Computational Geometry and Mesh Generation
Papers in
-
- Complexity and Algorithms in Graphs 102
- Advanced Graph Theory Research 60
-
- Computational Geometry and Mesh Generation 20
- Co-authors
- Oded RegevNisheeth K. VishnoiRyan O’DonnellGuy KindlerElchanan MosselRishi SaketAssaf NaorVenkatesan Guruswami
- Journals
- SIAM Journal on Computing (12 papers)Theory of Computing (5 papers)Journal of Computer and System Sciences (5 papers)Random Structures and Algorithms (2 papers)Journal of the ACM (2 papers)
- Partner nations
- United StatesIsraelIndia
In The Last Decade
Subhash Khot
110 papers receiving 2.6k citations
Hit Papers
Peers
Comparison fields: 5 of 69
- Computational Theory and Mathematics 2.3k
- Computer Graphics and Computer-Aided Design 478
- Discrete Mathematics and Combinatorics 173
- Computer Networks and Communications 897
- Computational Mathematics 19
Countries citing papers authored by Subhash Khot
This map shows the geographic impact of Subhash Khot's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Subhash Khot with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Subhash Khot more than expected).
Fields of papers citing papers by Subhash Khot
This network shows the impact of papers produced by Subhash Khot. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Subhash Khot. The network helps show where Subhash Khot may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Subhash Khot, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2022 | 1 | |
| 2 | Small Set Expansion in The Johnson Graph. | 2018 | 3 |
| 3 | 2017 | 1 | |
| 4 | Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with 2 log n Ω(1) Colors. | 2014 | 1 |
| 5 | Candidate Lasserre Integrality Gap For Unique Games. | 2014 | 1 |
| 6 | 2014 | 3 | |
| 7 | 2013 | 4 | |
| 8 | The Complexity of Somewhat Approximation Resistant Predicates. | 2012 | 0 |
| 9 | Towards An Optimal Query Efficient PCP | 2012 | 0 |
| 10 | 2011 | 23 | |
| 11 | 2010 | 5 | |
| 12 | Hardness of Approximately Solving Linear Equations Over Reals. | 2010 | 1 |
| 13 | 2009 | 11 | |
| 14 | 2007 | 304 | |
| 15 | Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? | 2005 | 19 |
| 16 | 2005 | 20 | |
| 17 | 2005 | 13 | |
| 18 | 2004 | 8 | |
| 19 | 2003 | 9 | |
| 20 | Vertex Cover on k-Uniform Hypergraphs is Hard to Approximate within Factor (k-3-epsilon) | 2002 | 17 |
About Subhash Khot
Subhash Khot is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Discrete Mathematics and Combinatorics, Artificial Intelligence and Computer Networks and Communications, having authored 116 papers that have together received 2.9k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (102 papers), Advanced Graph Theory Research (60 papers), Optimization and Search Problems (23 papers), Cryptography and Data Security (23 papers), Computational Geometry and Mesh Generation (20 papers), Machine Learning and Algorithms (14 papers), Limits and Structures in Graph Theory (13 papers) and Sparse and Compressive Sensing Techniques (5 papers). The work is most often cited by research in Computational Theory and Mathematics (2.3k citations), Computer Graphics and Computer-Aided Design (478 citations), Discrete Mathematics and Combinatorics (173 citations), Computer Networks and Communications (897 citations) and Computational Mathematics (19 citations). Subhash Khot has collaborated with scholars based in United States, Israel and India. Frequent co-authors include Oded Regev, Nisheeth K. Vishnoi, Ryan O’Donnell, Guy Kindler, Elchanan Mossel, Rishi Saket, Assaf Naor, Venkatesan Guruswami, Irit Dinur and Amit Chakrabarti. Their work appears in journals such as SIAM Journal on Computing, Theory of Computing, Journal of Computer and System Sciences, Random Structures and Algorithms and Journal of the ACM.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.