Faculty of Mathematics and Computer
Science
The Weizmann Institute of Science
Or Meir
E-mail: 
Position: Ph. D. student
Advisor: Prof. Oded Goldreich
Office: de-Picciotto Bamot Building, Room 4
Phone: 08-934-6324
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.
I have organized the Weizmann
Students' Theory Seminar.during
2009.
Courses which I Graded
or TAed:
Introduction to Computational Complexity (2008)
Publications:
Combinatorial PCPs with efficient verifiers
Or Meir
To appear in FOCS 2009
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 has appeared in SICOMP 39(2), pp. 491-544, 2009.
On the Rectangle Method in proofs of Robustness of Tensor Products
Or Meir
ECCC TR07-061
The
Tensor Product of Two Good Codes Is Not Necessarily Robustly Testable
Oded Goldreich, Or Meir
ECCC TR07-062