| | |
- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| 16 |      | Or Meir: On the rectangle method in proofs of robustness of tensor products. Inf. Process. Lett. 112(6): 257-260 (2012) |
| 15 | | Oded Goldreich, Or Meir: The tensor product of two good codes is not necessarily robustly testable. Inf. Process. Lett. 112(8-9): 351-355 (2012) |
| 2011 | ||
| 14 | | Irit Dinur, Or Meir: Derandomized Parallel Repetition via Structured PCPs. Computational Complexity 20(2): 207-327 (2011) |
| 13 | | Or Meir: Combinatorial PCPs with efficient verifiers. Electronic Colloquium on Computational Complexity (ECCC) 18: 104 (2011) |
| 12 | | Oded Goldreich, Or Meir: Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly. Electronic Colloquium on Computational Complexity (ECCC) 18: 23 (2011) |
| 2010 | ||
| 11 | | Irit Dinur, Or Meir: Derandomized Parallel Repetition of Structured PCPs. IEEE Conference on Computational Complexity 2010: 16-27 |
| 10 | | Irit Dinur, Or Meir: Derandomized Parallel Repetition of Structured PCPs CoRR abs/1002.1606: (2010) |
| 9 | | Irit Dinur, Or Meir: Derandomized Parallel Repetition via Structured PCPs. Electronic Colloquium on Computational Complexity (ECCC) 17: 107 (2010) |
| 8 | | Or Meir: IP = PSPACE using Error Correcting Codes. Electronic Colloquium on Computational Complexity (ECCC) 17: 137 (2010) |
| 2009 | ||
| 7 | | Or Meir: Combinatorial PCPs with Efficient Verifiers. FOCS 2009: 463-471 |
| 6 | | Or Meir: Combinatorial Construction of Locally Testable Codes. SIAM J. Comput. 39(2): 491-544 (2009) |
| 2008 | ||
| 5 | | Or Meir: Combinatorial construction of locally testable codes. STOC 2008: 285-294 |
| 4 | | Or Meir: On the Efficiency of Non-Uniform PCPP Verifiers. Electronic Colloquium on Computational Complexity (ECCC) 15(064): (2008) |
| 2007 | ||
| 3 | | Or Meir: On the Rectangle Method in proofs of Robustness of Tensor Products. Electronic Colloquium on Computational Complexity (ECCC) 14(061): (2007) |
| 2 | | 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 | | Or Meir: Combinatorial Construction of Locally Testable Codes. Electronic Colloquium on Computational Complexity (ECCC) 14(115): (2007) |
| 1 | Irit Dinur | [9] [10] [11] [14] |
| 2 | Oded Goldreich | [2] [12] [15] |
Colors in the list of coauthors
Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page