Research Output per year

## Research Output 2000 2019

- 1 - 50 out of 76 results
- Publication Year, Title (descending)

## Improved 3LIN hardness via linear label cover

Harsha, P., Khot, S., Lee, E. & Thiruvenkatachari, D., Sep 2019,*Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019.*Achlioptas, D. & Vegh, L. A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 9. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 145).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## UG-hardness to NP-hardness by losing half

Bhangale, A. & Khot, S., Jul 1 2019,*34th Computational Complexity Conference, CCC 2019.*Shpilka, A. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 137).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## An improved dictatorship test with perfect completeness

Bhangale, A., Khot, S. & Thiruvenkatachari, D., Jan 1 2018,*37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017.*Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 93. 15

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Near-optimal approximation algorithm for simultaneous Max-cut

Bhangale, A., Khot, S., Kopparty, S., Sachdeva, S. & Thiruvenkatachari, D., Jan 1 2018,*29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018.*Association for Computing Machinery, p. 1407-1425 19 p.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## On non-optimally expanding sets in grassmann graphs

Dinur, I., Khot, S., Kindler, G., Minzer, D. & Safra, M., Jun 20 2018,*STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing.*Association for Computing Machinery, p. 1193-1206 14 p.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Pseudorandom sets in Grassmann graph have near-perfect expansion

Khot, S., Minzer, D. & Safra, M., Nov 30 2018,*Proceedings - 59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018.*Thorup, M. (ed.). IEEE Computer Society, Vol. 2018-October. p. 592-601 10 p. 8555140

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Towards a proof of the 2-to-1 games conjecture?

Dinur, I., Khot, S., Kindler, G., Minzer, D. & Safra, M., Jun 20 2018,*STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing.*Association for Computing Machinery, p. 1297-1306 10 p.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## On Independent Sets, 2-to-2 Games, and Grassmann Graphs

Khot, S., Minzer, D. & Safra, M., Jun 19 2017,*STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing.*Association for Computing Machinery, Vol. Part F128415. p. 576-589 14 p.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## An Ō(n) queries adaptive tester for unateness

Khot, S. & Shinkar, I., Sep 1 2016,*Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 19th International Workshop, APPROX 2016 and 20th International Workshop, RANDOM 2016.*Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 60.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Candidate hard unique game

Khot, S. & Moshkovitz, D., Jun 19 2016,*STOC 2016 - Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing.*Association for Computing Machinery, Vol. 19-21-June-2016. p. 63-76 14 p.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Hardness of bipartite expansion

Khot, S. & Saket, R., Aug 1 2016,*24th Annual European Symposium on Algorithms, ESA 2016.*Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 57. 55

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## On hardness of approximating the parameterized clique problem

Khot, S. & Shinkar, I., Jan 14 2016,*ITCS 2016 - Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science.*Association for Computing Machinery, Inc, p. 37-45 9 p.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Approximating CSPs using LP relaxation

Khot, S. & Saket, R., 2015,*Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings.*Springer Verlag, Vol. 9134. p. 822-833 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9134).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## On Monotonicity Testing and Boolean Isoperimetric Type Theorems

Khot, S., Minzer, D. & Safra, M., Dec 11 2015,*Proceedings - 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015.*IEEE Computer Society, Vol. 2015-December. p. 52-58 7 p. 7354387

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## A characterization of strong approximation resistance

Khot, S., Tulsiani, M. & Worah, P., 2014,*STOC 2014 - Proceedings of the 2014 ACM Symposium on Theory of Computing.*Association for Computing Machinery, p. 634-643 10 p.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Hardness of coloring 2-colorable 12-uniform hypergraphs with 2(logn}ω(1) colors

Khot, S. & Saket, R., Dec 7 2014,*Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS.*IEEE Computer Society, p. 206-215 10 p. 6979005

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Hardness of finding independent sets in 2-colorable and almost 2-colorable hypergraphs

Khot, S. & Saket, R., 2014,*Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014.*Association for Computing Machinery, p. 1607-1625 19 p.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## The complexity of somewhat approximation resistant predicates

Khot, S., Tulsiani, M. & Worah, P., 2014,*Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings.*PART 1 ed. Springer Verlag, Vol. 8572 LNCS. p. 689-700 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8572 LNCS, no. PART 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## A characterization of approximation resistance for even k-partite CSPs

Austrin, P. & Khot, S., 2013,*ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science.*p. 187-196 10 p.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Towards an optimal query efficient PCP?

Khot, S., Safra, M. & Tulsiani, M., 2013,*ITCS 2013 - Proceedings of the 2013 ACM Conference on Innovations in Theoretical Computer Science.*p. 173-186 14 p.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## 2 log1-εn hardness for the closest vector problem with preprocessing

Khot, S., Popat, P. & Vishnoi, N. K., 2012,*STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing.*p. 277-288 12 p.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Hardness of finding independent sets in almost q-colorable graphs

Khot, S. & Saket, R., 2012,*Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS.*p. 380-389 10 p. 6375316

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## A simple deterministic reduction for the gap minimum distance of code problem

Austrin, P. & Khot, S., 2011,*Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Proceedings.*PART 1 ed. Vol. 6755 LNCS. p. 474-485 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6755 LNCS, no. PART 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## A two prover one round game with strong soundness

Khot, S. & Safra, M., 2011,*Proceedings - 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011.*p. 648-657 10 p. 6108226

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## NP-hardness of approximately solving linear equations over reals

Khot, S. & Moshkovitz, D., 2011,*STOC'11 - Proceedings of the 43rd ACM Symposium on Theory of Computing.*p. 413-419 7 p.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Approximate Lasserre integrality gap for unique games

Khot, S., Popat, P. & Saket, R., 2010,*Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Proceedings.*Vol. 6302 LNCS. p. 298-311 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6302 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Hardness of finding independent sets in almost 3-colorable graphs

Dinur, I., Khot, S., Perkins, W. & Safra, M., 2010,*Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010.*p. 212-221 10 p. 5670828

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Inapproximability of hypergraph vertex cover and applications to scheduling problems

Bansal, N. & Khot, S., 2010,*Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings.*PART 1 ed. Vol. 6198 LNCS. p. 250-261 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6198 LNCS, no. PART 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Inapproximability of NP-complete problems, discrete fourier analysis, and geometry

Khot, S., 2010,*Proceedings of the International Congress of Mathematicians 2010, ICM 2010.*p. 2676-2697 22 p.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## On the unique games conjecture

Khot, S., 2010,*Proceedings - 25th Annual IEEE Conference on Computational Complexity, CCC 2010.*p. 99-121 23 p. 5497893

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## SDP gaps for 2-to-1 and other label-cover variants

Guruswami, V., Khot, S., O'Donnell, R., Popat, P., Tulsiani, M. & Wu, Y., 2010,*Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings.*PART 1 ed. Vol. 6198 LNCS. p. 617-628 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6198 LNCS, no. PART 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Sharp kernel clustering algorithms and their associated Grothendieck inequalities

Khot, S. & Naor, A., 2010,*Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms.*p. 664-683 20 p.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Inapproximability of vertex cover and independent set in bounded degree graphs

Austrin, P., Khot, S. & Safra, M., 2009,*Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity, CCC 2009.*p. 74-80 7 p. 5231231

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Optimal long code test with one free bit

Bansal, N. & Khot, S., 2009,*Proceedings - 50th Annual Symposium on Foundations of Computer Science, FOCS 2009.*p. 453-462 10 p. 5438609

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## SDP integrality gaps with local ℓ1-embeddability

Khot, S. & Saket, R., 2009,*Proceedings - 50th Annual Symposium on Foundations of Computer Science, FOCS 2009.*p. 565-574 10 p. 5438596

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Approximate kernel clustering

Khot, S. & Naor, A., 2008,*Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008.*p. 561-570 10 p. 4690989

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Hardness of minimizing and learning DNF expressions

Khot, S. & Saket, R., 2008,*Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008.*p. 231-240 10 p. 4690957

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Minimizing wide range regret with time selection functions

Khot, S. & Ponnuswami, A. K., 2008,*21st Annual Conference on Learning Theory, COLT 2008.*p. 81-86 6 p.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## On hardness of learning intersection of two halfspaces

Khot, S. & Saket, R., 2008,*STOC'08: Proceedings of the 2008 ACM Symposium on Theory of Computing.*p. 345-353 9 p.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Unique games on expanding constraint graphs are easy

Arora, S., Steurer, D., Knot, S. A., Tulsiani, M., Kolla, A. & Vishnoi, N. K., 2008,*STOC'08: Proceedings of the 2008 ACM Symposium on Theory of Computing.*p. 21-28 8 p.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Approximation algorithms for the max-min allocation problem

Khot, S. & Ponnuswami, A. K., 2007,*Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 10th International Workshop, APPROX 2007 and 11th International Workshop, RANDOM 2007, Proceedings.*Vol. 4627 LNCS. p. 204-217 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4627 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Hardness of embedding metric spaces of equal size

Khot, S. & Sake, R., 2007,*Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 10th International Workshop, APPROX 2007 and 11th International Workshop, RANDOM 2007, Proceedings.*Vol. 4627 LNCS. p. 218-227 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4627 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Hardness of reconstructing multivariate polynomials over finite fields

Gopalan, P., Khot, S. & Saket, R., 2007,*Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007.*p. 349-359 11 p. 4389506

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Linear equations modulo 2 and the L1 diameter of convex bodies

Khot, S. & Naor, A., 2007,*Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007.*p. 318-328 11 p. 4389503

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## A 3-query non-adaptive PCP with perfect completeness

Khot, S. & Saket, R., 2006,*Proceedings - Twenty-First Annual IEEE Conference on Computational Complexity, CCC 2006.*Vol. 2006. p. 159-169 11 p. 1663734

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Better inapproximability results for maxclique, chromatic number and Min-3Lin-Deletion

Khot, S. & Ponnuswami, A. K., 2006,*Automata, Languages and Programming - 33rd International Colloquium, ICALP 2006, Proceedings.*Vol. 4051 LNCS. p. 226-237 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4051 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## Integrality gaps for sparsest cut and minimum linear arrangement problems

Devanur, N. R., Khot, S., Saket, R. & Vishnoi, N. K., 2006,*STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing.*Vol. 2006. p. 537-546 10 p.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## New results for learning noisy parities and halfspaces

Feldman, V., Gopalan, P., Khot, S. & Ponnuswami, A. K., 2006,*47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006.*p. 563-572 10 p. 4031391

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## On earthmover distance, metric labeling, and 0-extension

Karloff, H., Khot, S., Mehta, A. & Rabani, Y., 2006,*STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing.*Vol. 2006. p. 547-556 10 p.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

## SDP gaps and UGC-hardness for MAXCUTGAIN

Khot, S. & O'Donneil, R., 2006,*47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006.*p. 217-226 10 p. 4031358

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution