Or Meir

I am a post-doc at the computer science department of Stanford, hosted by Prof. Luca Trevisan. I did my Ph.d. at the Weizmann Institute of Science under the supervision of Prof. Oded Goldreich.

E-mail: ormeir at cs dot stanford dot edu

Office: 470 Gates Building, 353 Serra Mall, Stanford

Research Interests: I am interested in all areas of Theoretical Computer Science, and in particular in Complexity Theory, Probabilistically Checkable Proofs, Coding Theory and Derandomization.

Publications:

Combinatorial PCPs with Short Proofs

Or Meir

Accepted to CCC 2012.

Extended conference version

Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly

Oded Goldreich, Or Meir

ECCC TR11-023

IP = PSPACE using Error Correcting Codes

Or Meir

ECCC TR10-137

Derandomized Parallel Repetition via Structured PCPs

Irit Dinur, Or Meir

Extended abstract appeared in the proceedings of CCC 2010.

Full version was invited to Computational Complexity 20(2), pages 207-327, 2011.

Extended abstract Full version

Combinatorial PCPs with Efficient Verifiers

Or Meir

Extended Abstract appeared in the proceedings of FOCS 2009, pages 463-471.

Brief Description Overview Full version

On the Efficiency of Non-Uniform PCPP Verifiers

Or Meir

ECCC TR08-064

Combinatorial Construction of Locally Testable Codes

Or Meir

Extended abstract Full version

Extended Abstract appeared in the proceedings of STOC 2008, pages 285-294

Full version appeared in SICOMP 39(2), pages 491-544, 2009.

On the Rectangle Method in proofs of Robustness of Tensor Products

Or Meir

ECCC TR07-061

Appeared in Inf. Process. Lett. 112(8-9), pages 257-260, 2012.

The Tensor Product of Two Good Codes Is Not Necessarily Robustly Testable

Oded Goldreich, Or Meir

ECCC TR07-062

Appeared in Inf. Process. Lett. 112(8-9), pages 351-355, 2012.