| Publication | Date of Publication | Type |
|---|
Quantum worst-case to average-case reductions for all linear problems
| 2024-11-28 | Paper |
Derandomization of cell sampling
| 2024-05-14 | Paper |
scientific article; zbMATH DE number 7788438 (Why is no real title available?)
| 2024-01-15 | Paper |
A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification
SIAM Journal on Computing | 2023-12-19 | Paper |
Hypercontractivity on high dimensional expanders
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Worst-case to average-case reductions via additive combinatorics
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Proof-carrying data from arithmetized random oracles
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity
SIAM Journal on Computing | 2023-04-04 | Paper |
Every Set in P Is Strongly Testable Under a Suitable Encoding
| 2022-07-18 | Paper |
Spatial Isolation Implies Zero Knowledge Even in a Quantum World
Journal of the ACM | 2022-03-31 | Paper |
Hypercontractivity on High Dimensional Expanders: Approximate Efron-Stein Decompositions for $\varepsilon$-Product Spaces
| 2021-11-17 | Paper |
Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP
Theoretical Computer Science | 2021-07-22 | Paper |
Relaxed locally correctable codes
| 2021-06-15 | Paper |
Proofs of proximity for distribution testing
| 2021-06-15 | Paper |
On the power of relaxed local decoding algorithms
SIAM Journal on Computing | 2021-05-27 | Paper |
Relaxed locally correctable codes
Theory of Computing | 2021-04-01 | Paper |
On the power of relaxed local decoding algorithms
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
An Entropy Lower Bound for Non-Malleable Extractors
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
An adaptivity hierarchy theorem for property testing
| 2020-05-26 | Paper |
Distribution testing lower bounds via reductions from communication complexity
| 2020-05-26 | Paper |
Linear-size constant-query IOPs for delegating computation
| 2020-04-30 | Paper |
Strong locally testable codes with relaxed local decoders
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Distribution testing lower bounds via reductions from communication complexity
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
A Lower Bound for Relaxed Locally Decodable Codes
| 2019-04-17 | Paper |
An adaptivity hierarchy theorem for property testing
Computational Complexity | 2018-12-10 | Paper |
Universal locally testable codes
Chicago Journal of Theoretical Computer Science | 2018-08-08 | Paper |
Proofs of proximity for context-free languages and read-once branching programs
Information and Computation | 2018-06-14 | Paper |
A hierarchy theorem for interactive proofs of proximity
| 2018-05-03 | Paper |
Non-interactive proofs of proximity
Computational Complexity | 2018-04-18 | Paper |
Strong locally testable codes with relaxed local decoders
| 2018-01-24 | Paper |
Non-interactive proofs of proximity
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
Proofs of proximity for context-free languages and read-once branching programs
Automata, Languages, and Programming | 2015-10-27 | Paper |
Arthur-Merlin streaming complexity
Information and Computation | 2015-06-09 | Paper |
Testing Booleanity and the uncertainty principle
Chicago Journal of Theoretical Computer Science | 2014-05-07 | Paper |
Arthur-Merlin streaming complexity
Automata, Languages, and Programming | 2013-08-06 | Paper |
