Or Meir
Title
Cited by
Cited by
Year
High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity
S Kopparty, O Meir, N Ron-Zewi, S Saraf
Journal of the ACM (JACM) 64 (2), 11, 2017
65*2017
Combinatorial construction of locally testable codes
O Meir
SIAM Journal on Computing 39 (2), 491-544, 2009
602009
Toward better formula lower bounds: An information complexity approach to the KRW composition conjecture
D Gavinsky, O Meir, O Weinstein, A Wigderson
Proceedings of the 46th Annual ACM Symposium on Theory of Computing, 213-222, 2014
43*2014
Toward the KRW composition conjecture: Cubic formula lower bounds via communication complexity
I Dinur, O Meir
computational complexity 27 (3), 375-462, 2018
372018
Combinatorial PCPs with efficient verifiers
O Meir
computational complexity 23 (3), 355-478, 2014
32*2014
Constant rate PCPs for circuit-SAT with sublinear query complexity
E Ben-Sasson, Y Kaplan, S Kopparty, O Meir, H Stichtenoth
Journal of the ACM (JACM) 63 (4), 32, 2016
312016
Derandomized parallel repetition via structured PCPs
I Dinur, O Meir
computational complexity 20 (2), 207-327, 2011
29*2011
IP= PSPACE Using Error-Correcting Codes
O Meir
SIAM Journal on Computing 42 (1), 380-403, 2013
282013
The tensor product of two good codes is not necessarily robustly testable
O Goldreich, O Meir
Information Processing Letters 112 (8-9), 351-355, 2012
25*2012
Combinatorial PCPs with short proofs
O Meir
computational complexity 25 (1), 1-102, 2016
212016
Query-to-Communication Lifting Using Low-Discrepancy Gadgets
A Chattopadhyay, Y Filmus, S Koroth, O Meir, T Pitassi
17*2019
Improved Composition Theorems for Functions and Relations
S Koroth, O Meir
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2018
102018
On the rectangle method in proofs of robustness of tensor products
O Meir
Information Processing Letters 112 (6), 257-260, 2012
10*2012
Prediction from partial information and hindsight, with application to circuit lower bounds
O Meir, A Wigderson
computational complexity 28 (2), 145-183, 2019
82019
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling.
SF De Rezende, O Meir, J Nordström, R Robere
Comput. Complex. 30 (1), 4, 2021
62021
Input-oblivious proof systems and a uniform complexity perspective on P/poly
O Goldreich, O Meir
ACM Transactions on Computation Theory (TOCT) 7 (4), 16, 2015
62015
A small gap in the gap amplification of assignment testers
O Goldreich, O Meir
Electronic Colloquium on Computational Complexity (ECCC)-TR05-046, 2007
62007
Lifting with simple gadgets and applications to circuit and proof complexity
S de Rezende, O Meir, J Nordström, T Pitassi, R Robere, M Vinyals
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 24-30, 2020
52020
Toward better depth lower bounds: Two results on the multiplexor relation
O Meir
computational complexity 29, 1-25, 2020
52020
KRW Composition Theorems via Lifting
SF de Rezende, O Meir, J Nordström, T Pitassi, R Robere
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 43-49, 2020
42020
The system can't perform the operation now. Try again later.
Articles 1–20