| Publication | Date of Publication | Type |
|---|
| Criticality of AC\(^0\)-formulae | 2024-11-19 | Paper |
| Downward self-reducibility in TFNP | 2024-09-25 | Paper |
Sparse juntas on the biased hypercube
TheoretiCS | 2024-08-13 | Paper |
Ideal-theoretic explanation of capacity-achieving decoding
IEEE Transactions on Information Theory | 2024-07-22 | Paper |
Decoding multivariate multiplicity codes on product sets
IEEE Transactions on Information Theory | 2024-07-21 | Paper |
| Vanishing spaces of random sets and applications to Reed-Muller codes | 2024-07-05 | Paper |
Boolean function analysis on high-dimensional expanders
Combinatorica | 2024-05-31 | Paper |
Rigid matrices from rectangular PCPs
SIAM Journal on Computing | 2024-04-24 | Paper |
scientific article; zbMATH DE number 7829252 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
scientific article; zbMATH DE number 7768401 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-20 | Paper |
Decoding multivariate multiplicity codes on product sets
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
scientific article; zbMATH DE number 7758331 (Why is no real title available?)
(available as arXiv preprint) | 2023-10-31 | Paper |
On the probabilistic degree of OR over the reals
Random Structures & Algorithms | 2023-10-12 | Paper |
| scientific article; zbMATH DE number 7650076 (Why is no real title available?) | 2023-02-03 | Paper |
From local to robust testing via agreement testing
Theory of Computing | 2022-07-26 | Paper |
scientific article; zbMATH DE number 7561310 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| From Local to Robust Testing via Agreement Testing | 2022-07-18 | Paper |
| Algorithmizing the Multiplicity Schwartz-Zippel Lemma | 2021-11-22 | Paper |
| Boolean function analysis on high-dimensional expanders | 2021-08-04 | Paper |
A characterization of hard-to-cover CSPs
Theory of Computing | 2021-04-01 | Paper |
List-Decoding with Double Samplers
SIAM Journal on Computing | 2021-03-24 | Paper |
| Explicit SoS lower bounds from high-dimensional expanders | 2020-09-10 | Paper |
| A note on the elementary construction of High-Dimensional Expanders of Kaufman and Oppenheim | 2019-12-24 | Paper |
Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
List decoding with double samplers
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
On polynomial approximations to \(\mathrm{AC}^0\)
Random Structures & Algorithms | 2019-05-02 | Paper |
Robust Multiplication-Based Tests for Reed–Muller Codes
IEEE Transactions on Information Theory | 2019-01-18 | Paper |
Multiplayer parallel repetition for expanding games
(available as arXiv preprint) | 2018-05-03 | Paper |
scientific article; zbMATH DE number 6861917 (Why is no real title available?)
(available as arXiv preprint) | 2018-04-19 | Paper |
Embedding approximately low-dimensional \(\ell_2^2\) metrics into \(\ell_1\)
(available as arXiv preprint) | 2018-04-19 | Paper |
Robust multiplication-based tests for Reed-Muller codes
(available as arXiv preprint) | 2018-04-19 | Paper |
scientific article; zbMATH DE number 6862104 (Why is no real title available?)
(available as arXiv preprint) | 2018-04-19 | Paper |
A characterization of hard-to-cover CSPs
(available as arXiv preprint) | 2018-01-24 | Paper |
Partition bound is quadratically tight for product distributions
(available as arXiv preprint) | 2017-12-19 | Paper |
The Communication Complexity of Correlation
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes
SIAM Journal on Computing | 2017-03-10 | Paper |
scientific article; zbMATH DE number 6687761 (Why is no real title available?)
(available as arXiv preprint) | 2017-02-21 | Paper |
Derandomized graph product results using the low degree long code
(available as arXiv preprint) | 2017-01-24 | Paper |
Sound 3-query PCPPs are long
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Lower bounds for bounded depth Frege proofs via Pudlák-Buss games
ACM Transactions on Computational Logic | 2015-09-17 | 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 |
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Distributed processing in automata
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Bounding the sensitivity of polynomial threshold functions
Theory of Computing | 2014-10-06 | Paper |
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
An invariance principle for polytopes
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Composition of Low-Error 2-Query PCPs Using Decodable PCPs
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Almost settling the hardness of noncommutative determinant
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Composition of low-error 2-query PCPs using decodable PCPs
SIAM Journal on Computing | 2014-04-11 | Paper |
An invariance principle for polytopes
Journal of the ACM | 2014-02-17 | Paper |
Composition of low-error 2-query PCPs using decodable PCPs
Property Testing | 2010-10-12 | Paper |
Some 3CNF properties are hard to test
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Robust PSPs of proximity, shorter PSPs and applications to coding
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
| scientific article; zbMATH DE number 5764851 (Why is no real title available?) | 2010-08-06 | Paper |
Sound 3-Query PCPPs Are Long
Automata, Languages and Programming | 2008-08-28 | Paper |
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
SIAM Journal on Computing | 2007-09-07 | Paper |
Some 3CNF Properties Are Hard to Test
SIAM Journal on Computing | 2005-10-28 | Paper |
| scientific article; zbMATH DE number 1688375 (Why is no real title available?) | 2002-01-09 | Paper |
Small PCPs with low query complexity
Computational Complexity | 2001-10-14 | Paper |
Boolean functions on high-dimensional expanders
(available as arXiv preprint) | N/A | Paper |
Sparse juntas on the biased hypercube
(available as arXiv preprint) | N/A | Paper |
