Or Meir is a computer scientist and faculty at the Computer Science Department of Haifa University.  He is primarily interested in all areas of Theoretical Computer Science, and in particular in Complexity Theory, Circuit Lower bounds, Probabilistically Checkable Proofs, Coding Theory and Derandomization. Prior to this, Or was a postdoctoral fellow at Stanford University, at the Institute of Advanced Study, and at the Weizmann Institute.

Or received his PhD from the Weizmann institute of Science in 2011, his dissertation “Combinatorial Constructions of Probabilistic Proof Systems” was written under the supervision of Prof.  Oded Goldreich. In this thesis Or provides alternative proofs for several key results about probabilistic proof systems. The alternative proofs do not use algebra, and are arguably more intuitive.

Or is interested in the nature of efficient computation, since on the one hand it is a fundamental and philosophical notion and on the other hand an accessible and concrete one.

Or has had his research published in a variety of scientific journals including SIAM Journal on Computing and Information Processing Letters.