| 2023 | FOCS | Toward Better Depth Lower Bounds: A KRW-like theorem for Strong Composition. | Or Meir |
| 2020 | FOCS | KRW Composition Theorems via Lifting. | Susanna F. de Rezende, Or Meir, Jakob Nordstrm, Toniann Pitassi, Robert Robere |
| 2020 | FOCS | Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. | Susanna F. de Rezende, Or Meir, Jakob Nordstrm, Toniann Pitassi, Robert Robere, Marc Vinyals |
| 2019 | ICALP | Query-To-Communication Lifting for BPP Using Inner Product. | Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi |
| 2016 | STOC | High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity. | Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf |
| 2014 | STOC | Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture. | Dmitry Gavinsky, Or Meir, Omri Weinstein, Avi Wigderson |
| 2013 | FOCS | Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity. | Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth |
| 2009 | FOCS | Combinatorial PCPs with Efficient Verifiers. | Or Meir |
| 2008 | STOC | Combinatorial construction of locally testable codes. | Or Meir |