| |
| * | 2008 | |
|---|---|---|
| 5 | EE | Or Meir: Combinatorial construction of locally testable codes. STOC 2008: 285-294 |
| 4 | EE | Or Meir: On the Efficiency of Non-Uniform PCPP Verifiers. Electronic Colloquium on Computational Complexity (ECCC) 15(064): (2008) |
| 2007 | ||
| 3 | EE | Or Meir: On the Rectangle Method in proofs of Robustness of Tensor Products. Electronic Colloquium on Computational Complexity (ECCC) 14(061): (2007) |
| 2 | EE | Oded Goldreich, Or Meir: The Tensor Product of Two Good Codes Is Not Necessarily Robustly Testable. Electronic Colloquium on Computational Complexity (ECCC) 14(062): (2007) |
| 1 | EE | Or Meir: Combinatorial Construction of Locally Testable Codes. Electronic Colloquium on Computational Complexity (ECCC) 14(115): (2007) |
| 1 | Oded Goldreich | [2] |