| Publication | Date of Publication | Type |
|---|
| Lifting with inner functions of polynomial discrepancy | 2024-08-22 | Paper |
KRW composition theorems via lifting
Computational Complexity | 2024-05-22 | Paper |
scientific article; zbMATH DE number 7789147 (Why is no real title available?)
Theory of Computing | 2024-01-16 | Paper |
Bridging a Small Gap in the Gap Amplification of Assignment Testers
Lecture Notes in Computer Science | 2022-08-30 | Paper |
| Nullstellensatz size-degree trade-offs from reversible pebbling | 2022-07-27 | Paper |
| Query-to-communication lifting for BPP using inner product | 2022-07-21 | Paper |
| Improved composition theorems for functions and relations | 2021-08-04 | Paper |
Nullstellensatz size-degree trade-offs from reversible pebbling
Computational Complexity | 2021-07-14 | Paper |
Query-to-communication lifting using low-discrepancy gadgets
SIAM Journal on Computing | 2021-03-24 | Paper |
Toward better depth lower bounds: two results on the multiplexor relation
Computational Complexity | 2020-07-08 | Paper |
On derandomized composition of Boolean functions
Computational Complexity | 2019-12-19 | Paper |
Prediction from partial information and hindsight, with application to circuit lower bounds
Computational Complexity | 2019-07-10 | Paper |
Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity
Computational Complexity | 2018-11-07 | Paper |
Constant rate PCPs for circuit-SAT with sublinear query complexity
Journal of the ACM | 2018-08-02 | Paper |
The direct sum of universal relations
Information Processing Letters | 2018-05-25 | Paper |
High-rate locally correctable and locally testable codes with sub-polynomial query complexity
Journal of the ACM | 2018-05-17 | Paper |
The choice and agreement problems of a random function
Information Processing Letters | 2018-03-16 | Paper |
| Toward the KRW composition conjecture: cubic formula lower bounds via communication complexity | 2017-10-10 | Paper |
High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation
SIAM Journal on Computing | 2017-03-10 | Paper |
Input-oblivious proof systems and a uniform complexity perspective on P/poly
ACM Transactions on Computation Theory | 2016-10-24 | Paper |
Combinatorial PCPs with short proofs
Computational Complexity | 2016-03-21 | Paper |
Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Combinatorial PCPs with efficient verifiers
Computational Complexity | 2014-12-17 | Paper |
Combinatorial PCPs with Efficient Verifiers
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
IP = PSPACE using error-correcting codes
SIAM Journal on Computing | 2013-07-04 | Paper |
The tensor product of two good codes is not necessarily robustly testable
Information Processing Letters | 2012-07-20 | Paper |
On the rectangle method in proofs of robustness of tensor products
Information Processing Letters | 2012-07-18 | Paper |
Derandomized parallel repetition via structured PCPs
Computational Complexity | 2011-11-08 | Paper |
Combinatorial construction of locally testable codes
SIAM Journal on Computing | 2010-04-29 | Paper |
| Combinatorial construction of locally testable codes (extended abstract) | 2009-01-05 | Paper |
