The SCEAS System
| |||||||

## Search the dblp DataBase
Irit Dinur:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Irit Dinur, Madhu Sudan, Avi Wigderson
**Robust Local Testability of Tensor Products of LDPC Codes.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:304-315 [Conf] - Irit Dinur
**Approximating SVP**[Citation Graph (0, 0)][DBLP]_{infty}to within Almost-Polynomial Factors Is NP-Hard. CIAC, 2000, pp:263-276 [Conf] - Irit Dinur, Guy Kindler, Shmuel Safra
**Approximating-CVP to Within Almost-Polynomial Factors is NP-Hard.**[Citation Graph (0, 0)][DBLP] FOCS, 1998, pp:99-111 [Conf] - Irit Dinur, Omer Reingold
**Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem.**[Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:155-164 [Conf] - Irit Dinur, Oded Regev, Clifford D. Smyth
**The Hardness of 3 - Uniform Hypergraph Coloring.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:33-0 [Conf] - Irit Dinur, Kobbi Nissim
**Revealing information while preserving privacy.**[Citation Graph (0, 0)][DBLP] PODS, 2003, pp:202-210 [Conf] - Irit Dinur
**The PCP theorem by gap amplification.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:241-250 [Conf] - Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Donnell
**On the fourier tails of bounded functions over the discrete cube.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:437-446 [Conf] - Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra
**PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability.**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:29-40 [Conf] - Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev
**A new multilayered PCP and the hardness of hypergraph vertex cover.**[Citation Graph (0, 0)][DBLP] STOC, 2003, pp:595-601 [Conf] - Irit Dinur, Elchanan Mossel, Oded Regev
**Conditional hardness for approximate coloring.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:344-353 [Conf] - Irit Dinur, Shmuel Safra
**The importance of being biased.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:33-42 [Conf] - Irit Dinur, Guy Kindler, Ran Raz, Shmuel Safra
**Approximating CVP to Within Almost-Polynomial Factors is NP-Hard.**[Citation Graph (0, 0)][DBLP] Combinatorica, 2003, v:23, n:2, pp:205-243 [Journal] - Irit Dinur, Oded Regev, Clifford D. Smyth
**The Hardness of 3-Uniform Hypergraph Coloring.**[Citation Graph (0, 0)][DBLP] Combinatorica, 2005, v:25, n:5, pp:519-535 [Journal] - Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev
**A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover**[Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal] - Irit Dinur, Shmuel Safra
**The Importance of Being Biased**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:104, pp:- [Journal] - Irit Dinur, Venkatesan Guruswami, Subhash Khot
**Vertex Cover on k-Uniform Hypergraphs is Hard to Approximate within Factor (k-3-epsilon)**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:027, pp:- [Journal] - Irit Dinur, Elchanan Mossel, Oded Regev
**Conditional Hardness for Approximate Coloring**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:039, pp:- [Journal] - Irit Dinur
**The PCP theorem by gap amplification**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:046, pp:- [Journal] - Irit Dinur, Guy Kindler, Shmuel Safra
**Approximating CVP to Within Almost Polynomial Factor is NP-Hard**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:48, pp:- [Journal] - Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra
**PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:66, pp:- [Journal] - Irit Dinur, Shmuel Safra
**On the Hardness of Approximating Label Cover**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:15, pp:- [Journal] - Irit Dinur
**Approximating SVP**[Citation Graph (0, 0)][DBLP]_{infty}to within Almost-Polynomial Factors is NP-hard Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:16, pp:- [Journal] - Irit Dinur, Shmuel Safra
**On the hardness of approximating label-cover.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:89, n:5, pp:247-254 [Journal] - Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev
**A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2005, v:34, n:5, pp:1129-1146 [Journal] - Irit Dinur, Omer Reingold
**Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2006, v:36, n:4, pp:975-1024 [Journal] - Irit Dinur
**Approximating SVP**[Citation Graph (0, 0)][DBLP]_{infinity}to within almost-polynomial factors is NP-hard. Theor. Comput. Sci., 2002, v:285, n:1, pp:55-71 [Journal] - Irit Dinur, Elchanan Mossel, Oded Regev
**Conditional Hardness for Approximate Coloring**[Citation Graph (0, 0)][DBLP] CoRR, 2005, v:0, n:, pp:- [Journal] - Irit Dinur
**The PCP theorem by gap amplification.**[Citation Graph (0, 0)][DBLP] J. ACM, 2007, v:54, n:3, pp:12- [Journal] **On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors.**[Citation Graph (, )][DBLP]**The Structure of Winning Strategies in Parallel Repetition Games.**[Citation Graph (, )][DBLP]**Derandomized Parallel Repetition of Structured PCPs.**[Citation Graph (, )][DBLP]**Locally Testing Direct Product in the Low Error Range.**[Citation Graph (, )][DBLP]**Composition of Low-Error 2-Query PCPs Using Decodable PCPs.**[Citation Graph (, )][DBLP]**Decodability of group homomorphisms beyond the johnson bound.**[Citation Graph (, )][DBLP]**Proof of an Intersection Theorem via Graph Homomorphisms.**[Citation Graph (, )][DBLP]**Derandomized Parallel Repetition of Structured PCPs**[Citation Graph (, )][DBLP]**Intersecting Families are Essentially Contained in Juntas.**[Citation Graph (, )][DBLP]**Decodability of Group Homomorphisms beyond the Johnson Bound.**[Citation Graph (, )][DBLP]**Robust Local Testability of Tensor Products of LDPC Codes.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |