| Publication | Date of Publication | Type |
|---|
| Improved monotonicity testers via hypercube embeddings | 2024-09-25 | Paper |
Limits of preprocessing
Computational Complexity | 2024-08-01 | Paper |
Hypercontractivity on the symmetric group
Forum of Mathematics, Sigma | 2024-01-18 | Paper |
The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs
SIAM Journal on Discrete Mathematics | 2023-11-29 | Paper |
| Improved Monotonicity Testers via Hypercube Embeddings | 2022-11-16 | Paper |
| An analogue of Bonami's Lemma for functions on spaces of linear maps, and 2-2 Games | 2022-09-09 | Paper |
| Forbidden intersection problems for families of linear maps | 2022-08-09 | Paper |
| scientific article; zbMATH DE number 7561745 (Why is no real title available?) | 2022-07-21 | Paper |
| Isoperimetric Inequalities Made Simpler | 2022-04-13 | Paper |
On non-optimally expanding sets in Grassmann graphs
Israel Journal of Mathematics | 2021-08-24 | Paper |
| The success probability in Lionel Levine's hat problem is strictly decreasing with the number of players, and this is related to interesting questions regarding Hamming powers of Kneser graphs and independent sets in random subgraphs | 2021-03-02 | Paper |
Towards a proof of the Fourier-entropy conjecture?
Geometric and Functional Analysis. GAFA | 2020-12-16 | Paper |
scientific article; zbMATH DE number 7204467 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-27 | Paper |
Invariance principle on the slice
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Towards a proof of the 2-to-1 games conjecture?
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
On non-optimally expanding sets in Grassmann graphs
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Approximation of non-Boolean 2CSP
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Gaussian noise sensitivity and Fourier tails
Israel Journal of Mathematics | 2018-06-29 | Paper |
Invariance principle on the slice
(available as arXiv preprint) | 2017-10-10 | Paper |
Direct sum testing
SIAM Journal on Computing | 2017-08-16 | Paper |
Direct sum testing (extended abstract)
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Geometric stability via information theory
Discrete Analysis | 2016-10-10 | Paper |
PCP characterizations of NP: towards a polynomially-small error-probability
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Polynomially low error PCPs with \(\operatorname{polyloglog} n\) queries via modular composition
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Unique games on the hypercube
Chicago Journal of Theoretical Computer Science | 2015-08-07 | Paper |
| On distributions computable by random walks on graphs | 2015-08-03 | Paper |
On the Fourier tails of bounded functions over the discrete cube
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Quantitative relation between noise sensitivity and influences
Combinatorica | 2014-05-05 | Paper |
The geometry of manipulation -- a quantitative proof of the Gibbard-Satterthwaite theorem
Combinatorica | 2012-09-17 | Paper |
Hardness of approximating the closest vector problem with pre-processing
Computational Complexity | 2012-06-26 | Paper |
PCP characterizations of NP: toward a polynomially-small error-probability
Computational Complexity | 2011-11-30 | Paper |
The UGC hardness threshold of the \(L_{p}\) Grothendieck problem
Mathematics of Operations Research | 2011-04-27 | Paper |
Simulating independence
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
| The UGC hardness threshold of the \(l_p\) Grothendieck problem | 2010-08-06 | Paper |
Simulating independence: new constructions of condensers, Ramsey graphs, dispersers, and extractors
Journal of the ACM | 2010-07-14 | Paper |
Lower Bounds for the Noisy Broadcast Problem
SIAM Journal on Computing | 2008-12-22 | Paper |
Eliminating Cycles in the Discrete Torus
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Eliminating cycles in the discrete torus
Algorithmica | 2008-04-23 | Paper |
On the Fourier tails of bounded functions over the discrete cube
Israel Journal of Mathematics | 2008-04-01 | Paper |
Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
SIAM Journal on Computing | 2008-03-28 | Paper |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2006-07-07 | Paper |
On Distributions Computable by Random Walks on Graphs
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
Approximating CVP to within almost-polynomial factors is NP-hard
Combinatorica | 2004-09-07 | Paper |
Testing juntas
Journal of Computer and System Sciences | 2004-08-06 | Paper |
Product Mixing in Compact Lie Groups
(available as arXiv preprint) | N/A | Paper |
Polynomial Bogolyubov for special linear groups via tensor rank
(available as arXiv preprint) | N/A | Paper |
