Or Meir

发表

The choice and agreement problems of a random function

Or Meir, Avishay Tal, 2018, Inf. Process. Lett..

IP = PSPACE Using Error-Correcting Codes

Or Meir, Or Meir, 2013, SIAM J. Comput..

Combinatorial PCPs with Efficient Verifiers

Or Meir, Or Meir, 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture

Or Meir, Avi Wigderson, Dmitry Gavinsky, 2014, STOC.

Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity

Or Meir, Toniann Pitassi, Marc Vinyals, 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

Combinatorial PCPs with Short Proofs

Or Meir, 2012, Computational Complexity Conference.

Shrinkage under Random Projections, and Cubic Formula Lower Bounds for AC0 pdf

Or Meir, Avishay Tal, Yuval Filmus, 2020, ArXiv.

KRW Composition Theorems via Lifting

Or Meir, Toniann Pitassi, Susanna F. de Rezende, 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

Combinatorial PCPs with Short Proofs

Or Meir, Or Meir, 2012, computational complexity.

Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation

Or Meir, Avi Wigderson, Dmitry Gavinsky, 2017, SIAM J. Comput..

On the rectangle method in proofs of robustness of tensor products

Or Meir, Or Meir, 2012, Inf. Process. Lett..

The tensor product of two good codes is not necessarily robustly testable

Or Meir, Oded Goldreich, Oded Goldreich, 2012, Inf. Process. Lett..

Combinatorial Construction of Locally Testable Codes

Or Meir, 2009, SIAM J. Comput..

Derandomized Parallel Repetition via Structured PCPs

Or Meir, Irit Dinur, Irit Dinur, 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.

Improved Composition Theorems for Functions and Relations

Or Meir, Sajin Koroth, 2018, APPROX-RANDOM.

Bridging a Small Gap in the Gap Amplification of Assignment Testers

Or Meir, Oded Goldreich, Oded Goldreich, 2020, Computational Complexity and Property Testing.

Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly

Or Meir, Oded Goldreich, Oded Goldreich, 2015, TOCT.

An Efficient Randomized Protocol for every Karchmer-Wigderson Relation with Two Rounds

Or Meir, Or Meir, 2017, Electron. Colloquium Comput. Complex..

Combinatorial PCPs with Efficient Verifiers

Or Meir, 2009, FOCS.

On the Efficiency of Non-Uniform PCPP Verifiers

Or Meir, 2008, Electron. Colloquium Comput. Complex..

The Direct Sum of Universal Relations

Or Meir, Or Meir, 2018, Electron. Colloquium Comput. Complex..

High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity

Or Meir, Shubhangi Saraf, Swastik Kopparty, 2016, STOC.

Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity

Or Meir, Irit Dinur, 2016, Electron. Colloquium Comput. Complex..

High-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity

Or Meir, Shubhangi Saraf, Swastik Kopparty, 2015, Electron. Colloquium Comput. Complex..

Toward Better Depth Lower Bounds: Two Results on the Multiplexor Relation

Or Meir, Or Meir, 2020, computational complexity.

Query-to-Communication Lifting Using Low-Discrepancy Gadgets

Or Meir, Toniann Pitassi, Arkadev Chattopadhyay, 2019, Electron. Colloquium Comput. Complex..

Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity

Or Meir, Eli Ben-Sasson, Henning Stichtenoth, 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

Combinatorial construction of locally testable codes

Or Meir, Or Meir, 2008, SIAM J. Comput..

Derandomized Parallel Repetition of Structured PCPs

Or Meir, Irit Dinur, 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.

High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity

Or Meir, Shubhangi Saraf, Swastik Kopparty, 2017, J. ACM.

On Derandomized Composition of Boolean Functions

Or Meir, 2019, computational complexity.

Special Section on the Fifty-Seventh Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016)

Or Meir, Irit Dinur, Swastik Kopparty, 2019, SIAM J. Comput..

Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity

Or Meir, Toniann Pitassi, Susanna F. de Rezende, 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

Nullstellensatz size-degree trade-offs from reversible pebbling

Or Meir, Susanna F. de Rezende, Jakob Nordström, 2019, Computational Complexity Conference.

Shrinkage under Random Projections, and Cubic Formula Lower Bounds for $\mathbf{AC}^0$

Or Meir, Avishay Tal, Yuval Filmus, 2020, Electron. Colloquium Comput. Complex..

Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity

Or Meir, Irit Dinur, Irit Dinur, 2016, computational complexity.

Locally Correctable and Testable Codes Approaching the Singleton Bound

Or Meir, Or Meir, 2014, Electron. Colloquium Comput. Complex..

Prediction from Partial Information and Hindsight, with Application to Circuit Lower Bounds

Or Meir, Avi Wigderson, A. Wigderson, 2019, computational complexity.

Query-to-communication lifting for BPP using inner product

Or Meir, Toniann Pitassi, Arkadev Chattopadhyay, 2019, ICALP.

Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity

Or Meir, Eli Ben-Sasson, Henning Stichtenoth, 2013, FOCS.

Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling

Or Meir, Susanna F. de Rezende, Robert Robere, 2021, Comput. Complex..

PSPACE using Error Correcting Codes

Or Meir, 2010 .

High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity

Or Meir, Shubhangi Saraf, Swastik Kopparty, 2015, STOC.