☰

Or S. Meir, Ph.D. - Publications

Affiliations: 
2010 Weizmann Institute of Science, Rehovot, Israel 
Area:
Mathematics
Tree Info Similar researchers PubMed Report error

15 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Meir O. Toward Better Depth Lower Bounds: Two Results on the Multiplexor Relation Computational Complexity. 29: 1-25. DOI: 10.1007/S00037-020-00194-8  0.409
2019 Meir O. On Derandomized Composition of Boolean Functions Computational Complexity. 28: 661-708. DOI: 10.1007/S00037-019-00188-1  0.326
2018 Meir O. The direct sum of universal relations Information Processing Letters. 136: 105-111. DOI: 10.1016/J.Ipl.2018.04.009  0.336
2018 Meir O, Tal A. The choice and agreement problems of a random function Information Processing Letters. 133: 16-20. DOI: 10.1016/J.Ipl.2017.12.007  0.338
2018 Dinur I, Meir O. Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity Computational Complexity. 27: 375-462. DOI: 10.1007/S00037-017-0159-X  0.421
2017 Kopparty S, Meir O, Ron-Zewi N, Saraf S. High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity Journal of the Acm. 64: 11. DOI: 10.1145/3051093  0.377
2017 Gavinsky D, Meir O, Weinstein O, Wigderson A. Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation Siam Journal On Computing. 46: 114-131. DOI: 10.1137/15M1018319  0.384
2016 Ben-Sasson E, Kaplan Y, Kopparty S, Meir O, Stichtenoth H. Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity Journal of the Acm. 63: 32. DOI: 10.1145/2901294  0.412
2016 Meir O. Combinatorial PCPs with Short Proofs Computational Complexity. 25: 1-102. DOI: 10.1007/S00037-015-0111-X  0.388
2015 Goldreich O, Meir O. Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly Acm Transactions On Computation Theory. 7: 16. DOI: 10.1145/2799645  0.507
2014 Meir O. Combinatorial PCPs with Efficient Verifiers Computational Complexity. 23: 355-478. DOI: 10.1007/S00037-014-0080-5  0.369
2013 Meir O. IP = PSPACE Using Error-Correcting Codes Siam Journal On Computing. 42: 380-403. DOI: 10.1137/110829660  0.407
2012 Goldreich O, Meir O. The tensor product of two good codes is not necessarily robustly testable Information Processing Letters. 112: 351-355. DOI: 10.1016/J.Ipl.2012.01.007  0.495
2012 Meir O. On the rectangle method in proofs of robustness of tensor products Information Processing Letters. 112: 257-260. DOI: 10.1016/J.Ipl.2011.11.007  0.373
2009 Meir O. Combinatorial Construction of Locally Testable Codes Siam Journal On Computing. 39: 491-544. DOI: 10.1137/080729967  0.381
Show low-probability matches.