Or S. Meir, Ph.D.

Affiliations: 
2010 Weizmann Institute of Science, Rehovot, Israel 
Area:
Mathematics
Google:
"Or Meir"

Parents

Sign in to add mentor
Oded Goldreich grad student 2010 Weizmann Institute
 (Combinatorial Constructions of Probabilistic Proof Systems.)
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Meir O. (2020) Toward Better Depth Lower Bounds: Two Results on the Multiplexor Relation Computational Complexity. 29: 1-25
Meir O. (2019) On Derandomized Composition of Boolean Functions Computational Complexity. 28: 661-708
Meir O. (2018) The direct sum of universal relations Information Processing Letters. 136: 105-111
Meir O, Tal A. (2018) The choice and agreement problems of a random function Information Processing Letters. 133: 16-20
Dinur I, Meir O. (2018) Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity Computational Complexity. 27: 375-462
Kopparty S, Meir O, Ron-Zewi N, et al. (2017) High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity Journal of the Acm. 64: 11
Gavinsky D, Meir O, Weinstein O, et al. (2017) Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation Siam Journal On Computing. 46: 114-131
Ben-Sasson E, Kaplan Y, Kopparty S, et al. (2016) Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity Journal of the Acm. 63: 32
Meir O. (2016) Combinatorial PCPs with Short Proofs Computational Complexity. 25: 1-102
Goldreich O, Meir O. (2015) Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly Acm Transactions On Computation Theory. 7: 16
See more...