| Publication | Date of Publication | Type |
|---|
| Explicit SoS lower bounds from high-dimensional expanders | 2026-04-15 | Paper |
| List decoding of Tanner and expander amplified codes from distance certificates | 2025-08-15 | Paper |
| Sum-of-squares lower bounds for sparse independent set | 2025-08-13 | Paper |
| Unique decoding of explicit -balanced codes near the Gilbert-Varshamov bound | 2025-08-12 | Paper |
| Approximating constraint satisfaction problems on high-dimensional expanders | 2025-08-12 | Paper |
| Weak decoupling, polynomial folds and approximate optimization over the sphere | 2025-08-06 | Paper |
| scientific article; zbMATH DE number 7829254 (Why is no real title available?) | 2024-04-09 | Paper |
scientific article; zbMATH DE number 7829320 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
Near-linear time decoding of Ta-Shma’s codes via splittable regularity
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| Ellipsoid fitting up to constant via empirical covariance estimation | 2023-07-20 | Paper |
Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms
SIAM Journal on Computing | 2023-04-04 | Paper |
| Concentration of polynomial random matrices via Efron-Stein inequalities | 2022-09-06 | Paper |
List Decoding of Direct Sum Codes
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| Finding Pseudorandom Colorings of Pseudorandom Graphs | 2020-11-25 | Paper |
| Explicit SoS lower bounds from high-dimensional expanders | 2020-09-10 | Paper |
From weak to strong LP gaps for all CSPs
(available as arXiv preprint) | 2020-05-26 | Paper |
Approximability of \(p\rightarrow q\) matrix norms: generalized Krivine rounding and hypercontractive hardness
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
From weak to strong linear programming gaps for all constraint satisfaction problems
Theory of Computing | 2018-06-15 | Paper |
| Proving weak approximability without algorithms | 2018-04-19 | Paper |
| Approximating Operator Norms via Generalized Krivine Rounding | 2018-04-10 | Paper |
| scientific article; zbMATH DE number 6850352 (Why is no real title available?) | 2018-03-15 | Paper |
Algorithmic regularity for polynomials and applications
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| Algorithms and hardness for subspace approximation | 2017-09-29 | Paper |
| On LP-based approximability for strict CSPs | 2017-09-29 | Paper |
Towards an optimal query efficient PCP?
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Graph densification
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
Convex relaxations and integrality gaps
International Series in Operations Research & Management Science | 2016-04-26 | Paper |
A characterization of strong approximation resistance
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
CSP gaps and reductions in the lasserre hierarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Quadratic Goldreich-Levin theorems
SIAM Journal on Computing | 2014-07-30 | Paper |
Quadratic Goldreich-Levin theorems
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
The Complexity of Somewhat Approximation Resistant Predicates
Automata, Languages, and Programming | 2014-07-01 | Paper |
Sampling-based proofs of almost-periodicity results and algorithmic applications
Automata, Languages, and Programming | 2014-07-01 | Paper |
Linear Programming Hierarchies Suffice for Directed Steiner Tree
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
SDP gaps from pairwise independence
Theory of Computing | 2012-09-27 | Paper |
Improved pseudorandom generators for depth 2 circuits
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
SDP gaps for 2-to-1 and other Label-Cover variants
Automata, Languages and Programming | 2010-09-07 | Paper |
Time space tradeoffs for attacks against one-way functions and PRGs
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
Optimal Sherali-Adams Gaps from Pairwise Independence
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
| scientific article; zbMATH DE number 5485464 (Why is no real title available?) | 2009-01-05 | Paper |
| New Proofs of the Green-Tao-Ziegler Dense Model Theorem: An Exposition | 2008-06-02 | Paper |
