On the Efficiency of Non-Uniform PCPP Verifiers. - Or Meir (Electron. Colloquium Comput. Complex., 2008)

Combinatorial Construction of Locally Testable Codes. - Or Meir (SIAM J. Comput., 2009)

Derandomized Parallel Repetition of Structured PCPs. - Irit Dinur; Or Meir (CCC, 2010)

Derandomized Parallel Repetition via Structured PCPs. - Irit Dinur; Or Meir (Comput. Complex., 2011)

Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly. - Oded Goldreich 001; Or Meir (Electron. Colloquium Comput. Complex., 2011)

The tensor product of two good codes is not necessarily robustly testable. - Oded Goldreich 001; Or Meir (Inf. Process. Lett., 2012)

On the rectangle method in proofs of robustness of tensor products. - Or Meir (Inf. Process. Lett., 2012)

Constant rate PCPs for circuit-SAT with sublinear query complexity. - Eli Ben-Sasson; Yohay Kaplan; Swastik Kopparty; Or Meir; Henning Stichtenoth (Electron. Colloquium Comput. Complex., 2013)

Toward Better Formula Lower Bounds: An Information Complexity Approach to the KRW Composition Conjecture. - Dmitry Gavinsky; Or Meir; Omri Weinstein; Avi Wigderson (Electron. Colloquium Comput. Complex., 2013)

IP = PSPACE Using Error-Correcting Codes. - Or Meir (SIAM J. Comput., 2013)

Combinatorial PCPs with Efficient Verifiers. - Or Meir (Comput. Complex., 2014)

Locally Correctable and Testable Codes Approaching the Singleton Bound. - Or Meir (Electron. Colloquium Comput. Complex., 2014)

High-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity. - Swastik Kopparty; Or Meir; Noga Ron-Zewi; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2015)

Combinatorial PCPs with Short Proofs. - Or Meir (Comput. Complex., 2016)

An Efficient Randomized Protocol for every Karchmer-Wigderson Relation with Two Rounds. - Or Meir (Electron. Colloquium Comput. Complex., 2017)

High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity. - Swastik Kopparty; Or Meir; Noga Ron-Zewi; Shubhangi Saraf (J. ACM, 2017)

Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation. - Dmitry Gavinsky; Or Meir; Omri Weinstein; Avi Wigderson (SIAM J. Comput., 2017)

Improved Composition Theorems for Functions and Relations. - Sajin Koroth; Or Meir (APPROX-RANDOM, 2018)

Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity. - Irit Dinur; Or Meir (Comput. Complex., 2018)

The direct sum of universal relations. - Or Meir (Inf. Process. Lett., 2018)

The choice and agreement problems of a random function. - Or Meir; Avishay Tal (Inf. Process. Lett., 2018)

Query-To-Communication Lifting for BPP Using Inner Product. - Arkadev Chattopadhyay; Yuval Filmus; Sajin Koroth; Or Meir; Toniann Pitassi (ICALP, 2019)

On Derandomized Composition of Boolean Functions. - Or Meir (Comput. Complex., 2019)

Prediction from Partial Information and Hindsight, with Application to Circuit Lower Bounds. - Or Meir; Avi Wigderson (Comput. Complex., 2019)

Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. - Or Meir; Jakob Nordström; Toniann Pitassi; Robert Robere; Susanna F. de Rezende (Electron. Colloquium Comput. Complex., 2019)

Special Section on the Fifty-Seventh Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016). - Irit Dinur; Or Meir; Swastik Kopparty (SIAM J. Comput., 2019)

Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. - Susanna F. de Rezende; Or Meir; Jakob Nordström; Toniann Pitassi; Robert Robere; Marc Vinyals (FOCS, 2020)

Toward Better Depth Lower Bounds: Two Results on the Multiplexor Relation. - Or Meir (Comput. Complex., 2020)

Shrinkage under Random Projections, and Cubic Formula Lower Bounds for AC0. - Yuval Filmus; Or Meir; Avishay Tal (Electron. Colloquium Comput. Complex., 2020)

Bridging a Small Gap in the Gap Amplification of Assignment Testers. - Oded Goldreich 001; Or Meir (Computational Complexity and Property Testing, 2020)

Shrinkage Under Random Projections, and Cubic Formula Lower Bounds for AC0 (Extended Abstract). - Yuval Filmus; Or Meir; Avishay Tal (ITCS, 2021)

Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. - Susanna F. de Rezende; Or Meir; Jakob Nordström; Robert Robere (Comput. Complex., 2021)

Query-to-Communication Lifting Using Low-Discrepancy Gadgets. - Arkadev Chattopadhyay; Yuval Filmus; Sajin Koroth; Or Meir; Toniann Pitassi (SIAM J. Comput., 2021)

Toward Better Depth Lower Bounds: A KRW-like theorem for Strong Composition. - Or Meir (Electron. Colloquium Comput. Complex., 2023)

Lifting with Inner Functions of Polynomial Discrepancy. - Yahel Manor; Or Meir (Electron. Colloquium Comput. Complex., 2024)

KRW Composition Theorems via Lifting. - Susanna F. de Rezende; Or Meir; Jakob Nordström; Toniann Pitassi; Robert Robere (Comput. Complex., 2024)