Or Meir

Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot 76100, Israel

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

None

Papers33 papers

Sort

By YearBy Citation

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

Or Meir

computational complexity, no. 1 (2020): 1-25

EIBibtex

KRW Composition Theorems via Lifting

Susanna F. de Rezende,Or Meir, Jakob Nordström,Toniann Pitassi,Robert Robere

Electron. Colloquium Comput. Complex., (2020): 99

Bibtex

Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling

Or Meir, Jakob Nordström, Robert Robere, Susanna F. de Rezende

Electronic Colloquium on Computational Complexity (ECCC), (2020): 1

EIBibtex

Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling

de Rezende Susanna F.,Meir Or, Nordström Jakob, Robere Robert

Cited by2Bibtex

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

Yuval Filmus,Or Meir,Avishay Tal

Electron. Colloquium Comput. Complex., (2020): 180

Bibtex

Query-to-communication lifting for BPP using inner product

Arkadev Chattopadhyay,Yuval Filmus,Sajin Koroth,Or Meir,Toniann Pitassi

ICALP, (2019)

Cited by3EIBibtex

Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity

Or Meir, Jakob Nordström,Toniann Pitassi, Robert Robere, Susanna F. de Rezende

Electronic Colloquium on Computational Complexity (ECCC), (2019): 186

EIBibtex

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

Electronic Colloquium on Computational Complexity, (2019): 186

Bibtex

Query-to-Communication Lifting Using Low-Discrepancy Gadgets

Arkadev Chattopadhyay,Yuval Filmus, Sajin Koroth,Or Meir,Toniann Pitassi

Electronic Colloquium on Computational Complexity (ECCC), (2019): 103

EIBibtex

Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling

Susanna F. de Rezende,Jakob Nordström,Or Meir, Robert Robere

Leibniz International Proceedings in Informatics, (2019): 16

EIBibtex

Improved Composition Theorems for Functions and Relations

Sajin Koroth,Or Meir

APPROX-RANDOM, pp.48:1-48:18, (2018)

EIBibtex

The Choice and Agreement Problems of a Random Function

Or Meir,Avishay Tal

Information Processing Letters, (2018): 16-20

EIBibtex

The Direct Sum of Universal Relations

Or Meir

Information Processing Letters, (2018): 105-111

Cited by1EIBibtex

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

Swastik Kopparty,Or Meir,Noga Ron-Zewi,Shubhangi Saraf

J. ACM, no. 2 (2017): 11:1-11:42

Cited by48EIBibtex

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., no. 1 (2017): 114-131

Cited by8EIBibtex

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

Or Meir

Electronic Colloquium on Computational Complexity (ECCC), (2017)

Cited by2EIBibtex

On Derandomized Composition of Boolean Functions

Or Meir

computational complexity, no. 4 (2017): 661-708

EIBibtex

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

Or Meir,Avi Wigderson

Electronic Colloquium on Computational Complexity (ECCC), (2017)

Cited by5EIBibtex

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

Irit Dinur,Or Meir

Electronic Colloquium on Computational Complexity (ECCC), no. 3 (2016)

Cited by30EIBibtex

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

Swastik Kopparty,Or Meir,Noga Ron-Zewi,Shubhangi Saraf

STOC '16: Symposium on Theory of Computing Cambridge MA USA June, 2016, pp.202-215, (2016)

EIBibtex

View All

Base Info Papers Patents Projects