Or Meir - RankMe

76 papers A* 9A 6Journal 59Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Toward Better Depth Lower Bounds: A KRW-like Theorem For Strong Composition. SIAM J. Comput. Or Meir
2024	J	`jnl`	KRW Composition Theorems via Lifting. Comput. Complex. Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
2024	J	`jnl`	Lifting with Inner Functions of Polynomial Discrepancy. CoRR Yahel Manor, Or Meir
2024	J	`jnl`	Lifting with Inner Functions of Polynomial Discrepancy. Electron. Colloquium Comput. Complex. Yahel Manor, Or Meir
2023	J	`jnl`	Shrinkage under Random Projections, and Cubic Formula Lower Bounds for AC Theory Comput. Yuval Filmus, Or Meir, Avishay Tal
2023	A*	`conf`	Toward Better Depth Lower Bounds: A KRW-like theorem for Strong Composition. FOCS Or Meir
2023	J	`jnl`	Toward Better Depth Lower Bounds: A KRW-like theorem for Strong Composition. CoRR Or Meir
2023	J	`jnl`	Toward Better Depth Lower Bounds: A KRW-like theorem for Strong Composition. Electron. Colloquium Comput. Complex. Or Meir
2022	A	`conf`	Lifting with Inner Functions of Polynomial Discrepancy. APPROX/RANDOM Yahel Manor, Or Meir
2021	J	`jnl`	Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Comput. Complex. Susanna F. de Rezende, Or Meir, Jakob Nordström, Robert Robere
2021	J	`jnl`	Query-to-Communication Lifting Using Low-Discrepancy Gadgets. SIAM J. Comput. Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi
2021	A	`conf`	Shrinkage Under Random Projections, and Cubic Formula Lower Bounds for AC0 (Extended Abstract). ITCS Yuval Filmus, Or Meir, Avishay Tal
2020	—	`ch.`	Bridging a Small Gap in the Gap Amplification of Assignment Testers. Computational Complexity and Property Testing Oded Goldreich, Or Meir
2020	A*	`conf`	KRW Composition Theorems via Lifting. FOCS Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
2020	J	`jnl`	KRW Composition Theorems via Lifting. CoRR Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
2020	J	`jnl`	KRW Composition Theorems via Lifting. Electron. Colloquium Comput. Complex. Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere
2020	A*	`conf`	Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. FOCS Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Marc Vinyals
2020	J	`jnl`	Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. CoRR Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Marc Vinyals
2020	J	`jnl`	Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. CoRR Susanna F. de Rezende, Or Meir, Jakob Nordström, Robert Robere
2020	J	`jnl`	Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. Electron. Colloquium Comput. Complex. Or Meir, Jakob Nordström, Robert Robere, Susanna F. de Rezende
2020	J	`jnl`	Shrinkage under Random Projections, and Cubic Formula Lower Bounds for AC CoRR Yuval Filmus, Or Meir, Avishay Tal
2020	J	`jnl`	Shrinkage under Random Projections, and Cubic Formula Lower Bounds for AC Electron. Colloquium Comput. Complex. Yuval Filmus, Or Meir, Avishay Tal
2020	J	`jnl`	Toward Better Depth Lower Bounds: Two Results on the Multiplexor Relation. Comput. Complex. Or Meir
2019	J	`jnl`	Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. Electron. Colloquium Comput. Complex. Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Susanna F. de Rezende
2019	A	`conf`	Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling. CCC Susanna F. de Rezende, Jakob Nordström, Or Meir, Robert Robere
2019	J	`jnl`	On Derandomized Composition of Boolean Functions. Comput. Complex. Or Meir
2019	J	`jnl`	Prediction from Partial Information and Hindsight, with Application to Circuit Lower Bounds. Comput. Complex. Or Meir, Avi Wigderson
2019	A*	`conf`	Query-To-Communication Lifting for BPP Using Inner Product. ICALP Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi
2019	J	`jnl`	Query-to-Communication Lifting Using Low-Discrepancy Gadgets. Electron. Colloquium Comput. Complex. Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi
2019	J	`jnl`	Query-to-communication lifting for BPP using inner product. CoRR Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi
2019	J	`jnl`	Special Section on the Fifty-Seventh Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016). SIAM J. Comput. Irit Dinur, Or Meir, Swastik Kopparty
2019	J	`jnl`	Toward Better Depth Lower Bounds: Two Results on the Multiplexor Relation. Electron. Colloquium Comput. Complex. Or Meir
2018	—	`conf`	Improved Composition Theorems for Functions and Relations. APPROX-RANDOM Sajin Koroth, Or Meir
2018	J	`jnl`	The choice and agreement problems of a random function. Inf. Process. Lett. Or Meir, Avishay Tal
2018	J	`jnl`	The direct sum of universal relations. Inf. Process. Lett. Or Meir
2018	J	`jnl`	Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity. Comput. Complex. Irit Dinur, Or Meir
2017	J	`jnl`	An Efficient Randomized Protocol for every Karchmer-Wigderson Relation with Two Rounds. Electron. Colloquium Comput. Complex. Or Meir
2017	J	`jnl`	High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity. J. ACM Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf
2017	J	`jnl`	On Derandomized Composition of Boolean Functions. Electron. Colloquium Comput. Complex. Or Meir
2017	J	`jnl`	Prediction from Partial Information and Hindsight, with Application to Circuit Lower Bounds. Electron. Colloquium Comput. Complex. Or Meir, Avi Wigderson
2017	J	`jnl`	The Choice and Agreement Problems of a Random Function. Electron. Colloquium Comput. Complex. Or Meir, Avishay Tal
2017	J	`jnl`	The Direct Sum of Universal Relations. Electron. Colloquium Comput. Complex. Or Meir
2017	J	`jnl`	Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation. SIAM J. Comput. Dmitry Gavinsky, Or Meir, Omri Weinstein, Avi Wigderson
2016	J	`jnl`	Combinatorial PCPs with Short Proofs. Comput. Complex. Or Meir
2016	J	`jnl`	Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity. J. ACM Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth
2016	A*	`conf`	High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity. STOC Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf
2016	A	`conf`	Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity. CCC Irit Dinur, Or Meir
2016	J	`jnl`	Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity. Electron. Colloquium Comput. Complex. Irit Dinur, Or Meir
2015	J	`jnl`	High rate locally-correctable and locally-testable codes with sub-polynomial query complexity. CoRR Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf
2015	J	`jnl`	High-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity. Electron. Colloquium Comput. Complex. Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf
2015	J	`jnl`	Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly. ACM Trans. Comput. Theory Oded Goldreich, Or Meir
2014	J	`jnl`	Combinatorial PCPs with Efficient Verifiers. Comput. Complex. Or Meir
2014	J	`jnl`	Locally Correctable and Testable Codes Approaching the Singleton Bound. Electron. Colloquium Comput. Complex. Or Meir
2014	A*	`conf`	Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture. STOC Dmitry Gavinsky, Or Meir, Omri Weinstein, Avi Wigderson
2013	J	`jnl`	Combinatorial PCPs with Short Proofs. Electron. Colloquium Comput. Complex. Or Meir
2013	A*	`conf`	Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity. FOCS Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth
2013	J	`jnl`	Constant rate PCPs for circuit-SAT with sublinear query complexity. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth
2013	J	`jnl`	IP = PSPACE Using Error-Correcting Codes. SIAM J. Comput. Or Meir
2013	J	`jnl`	Toward Better Formula Lower Bounds: An Information Complexity Approach to the KRW Composition Conjecture. Electron. Colloquium Comput. Complex. Dmitry Gavinsky, Or Meir, Omri Weinstein, Avi Wigderson
2012	A	`conf`	Combinatorial PCPs with Short Proofs. CCC Or Meir
2012	J	`jnl`	On the rectangle method in proofs of robustness of tensor products. Inf. Process. Lett. Or Meir
2012	J	`jnl`	The tensor product of two good codes is not necessarily robustly testable. Inf. Process. Lett. Oded Goldreich, Or Meir
2011	J	`jnl`	Combinatorial PCPs with efficient verifiers. Electron. Colloquium Comput. Complex. Or Meir
2011	J	`jnl`	Derandomized Parallel Repetition via Structured PCPs. Comput. Complex. Irit Dinur, Or Meir
2011	J	`jnl`	Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly. Electron. Colloquium Comput. Complex. Oded Goldreich, Or Meir
2010	J	`jnl`	Derandomized Parallel Repetition of Structured PCPs CoRR Irit Dinur, Or Meir
2010	A	`conf`	Derandomized Parallel Repetition of Structured PCPs. CCC Irit Dinur, Or Meir
2010	J	`jnl`	Derandomized Parallel Repetition via Structured PCPs. Electron. Colloquium Comput. Complex. Irit Dinur, Or Meir
2010	J	`jnl`	IP = PSPACE using Error Correcting Codes. Electron. Colloquium Comput. Complex. Or Meir
2009	J	`jnl`	Combinatorial Construction of Locally Testable Codes. SIAM J. Comput. Or Meir
2009	A*	`conf`	Combinatorial PCPs with Efficient Verifiers. FOCS Or Meir
2008	A*	`conf`	Combinatorial construction of locally testable codes. STOC Or Meir
2008	J	`jnl`	On the Efficiency of Non-Uniform PCPP Verifiers. Electron. Colloquium Comput. Complex. Or Meir
2007	J	`jnl`	Combinatorial Construction of Locally Testable Codes. Electron. Colloquium Comput. Complex. Or Meir
2007	J	`jnl`	On the Rectangle Method in proofs of Robustness of Tensor Products. Electron. Colloquium Comput. Complex. Or Meir
2007	J	`jnl`	The Tensor Product of Two Good Codes Is Not Necessarily Robustly Testable. Electron. Colloquium Comput. Complex. Oded Goldreich, Or Meir