Or Meir - Citegraph

Author Info

Name	Affiliation	Papers
OR MEIR	Weizmann Inst Sci, IL-76100 Rehovot, Israel	27
Collaborators	Citations	PageRank
21	66	10.47
Referers	Referees	References
76	162	215

Search Limit

100162

Publications (27 rows)

Collaborators (21 rows)

Referers (76 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Nullstellensatz Size-Degree Trade-Offs From Reversible Pebbling	0	0.34	2021
KRW Composition Theorems via Lifting	0	0.34	2020
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity	0	0.34	2020
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling.	0	0.34	2020
Query-to-communication lifting for BPP using inner product.	0	0.34	2019
Query-To-Communication Lifting Using Low-Discrepancy Gadgets	0	0.34	2019
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling.	0	0.34	2019
Toward Better Depth Lower Bounds: Two Results on the Multiplexor Relation	0	0.34	2019
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity.	0	0.34	2019
The Choice and Agreement Problems of a Random Function.	0	0.34	2018
The Direct Sum of Universal Relations.	0	0.34	2018
Improved Composition Theorems for Functions and Relations.	0	0.34	2018
Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation.	1	0.35	2017
High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity.	2	0.37	2017
On Derandomized Composition of Boolean Functions.	0	0.34	2017
An Efficient Randomized Protocol for every Karchmer-Wigderson Relation with Two Rounds.	0	0.34	2017
Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity.	1	0.35	2016
High-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity.	1	0.35	2015
Combinatorial PCPs with Efficient Verifiers	8	0.44	2014
Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture	8	0.47	2013
IP = PSPACE using Error Correcting Codes	5	0.49	2013
Derandomized Parallel Repetition via Structured PCPs	16	0.74	2011
Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly	0	0.34	2011
On the Efficiency of Non-Uniform PCPP Verifiers	1	0.35	2008
Combinatorial construction of locally testable codes	16	0.67	2008
The tensor product of two good codes is not necessarily robustly testable	4	0.42	2007
On the rectangle method in proofs of robustness of tensor products	3	0.40	2007