Irit Dinur

2009
37	EE	Irit Dinur, Ehud Friedgut: Intersecting Families are Essentially Contained in Juntas. Combinatorics, Probability & Computing 18(1-2): 107-122 (2009)
2008
36	EE	Irit Dinur, Elazar Goldenberg: Locally Testing Direct Product in the Low Error Range. FOCS 2008: 613-622
35	EE	Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan: Decodability of group homomorphisms beyond the johnson bound. STOC 2008: 275-284
34	EE	Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan: Decodability of Group Homomorphisms beyond the Johnson Bound. Electronic Colloquium on Computational Complexity (ECCC) 15(020): (2008)
33		Irit Dinur, Éva Tardos: Special Issue on Foundations of Computer Science. SIAM J. Comput. 37(6): (2008)
32	EE	Irit Dinur: PCPs with small soundness error. SIGACT News 39(3): 41-57 (2008)
2007
31	EE	Irit Dinur: The PCP theorem by gap amplification. J. ACM 54(3): 12 (2007)
2006
30	EE	Irit Dinur, Madhu Sudan, Avi Wigderson: Robust Local Testability of Tensor Products of LDPC Codes. APPROX-RANDOM 2006: 304-315
29	EE	Irit Dinur: The PCP theorem by gap amplification. STOC 2006: 241-250
28	EE	Irit Dinur, Elchanan Mossel, Oded Regev: Conditional hardness for approximate coloring. STOC 2006: 344-353
27	EE	Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Donnell: On the fourier tails of bounded functions over the discrete cube. STOC 2006: 437-446
26	EE	Irit Dinur, Ehud Friedgut: Proof of an Intersection Theorem via Graph Homomorphisms. Electr. J. Comb. 13(1): (2006)
25	EE	Irit Dinur, Madhu Sudan, Avi Wigderson: Robust Local Testability of Tensor Products of LDPC Codes. Electronic Colloquium on Computational Complexity (ECCC) 13(118): (2006)
24	EE	Irit Dinur, Omer Reingold: Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem. SIAM J. Comput. 36(4): 975-1024 (2006)
2005
23	EE	Irit Dinur, Elchanan Mossel, Oded Regev: Conditional Hardness for Approximate Coloring CoRR abs/cs/0504062: (2005)
22	EE	Irit Dinur, Oded Regev, Clifford D. Smyth: The Hardness of 3-Uniform Hypergraph Coloring. Combinatorica 25(5): 519-535 (2005)
21	EE	Irit Dinur, Elchanan Mossel, Oded Regev: Conditional Hardness for Approximate Coloring Electronic Colloquium on Computational Complexity (ECCC)(039): (2005)
20	EE	Irit Dinur: The PCP theorem by gap amplification Electronic Colloquium on Computational Complexity (ECCC)(046): (2005)
19	EE	Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev: A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover. SIAM J. Comput. 34(5): 1129-1146 (2005)
2004
18	EE	Irit Dinur, Omer Reingold: Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem. FOCS 2004: 155-164
17	EE	Irit Dinur, Shmuel Safra: On the hardness of approximating label-cover. Inf. Process. Lett. 89(5): 247-254 (2004)
2003
16	EE	Irit Dinur, Kobbi Nissim: Revealing information while preserving privacy. PODS 2003: 202-210
15	EE	Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev: A new multilayered PCP and the hardness of hypergraph vertex cover. STOC 2003: 595-601
14	EE	Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev: A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover CoRR cs.CC/0304026: (2003)
13	EE	Irit Dinur, Guy Kindler, Ran Raz, Shmuel Safra: Approximating CVP to Within Almost-Polynomial Factors is NP-Hard. Combinatorica 23(2): 205-243 (2003)
2002
12	EE	Irit Dinur, Oded Regev, Clifford D. Smyth: The Hardness of 3 - Uniform Hypergraph Coloring. FOCS 2002: 33-
11	EE	Irit Dinur, Shmuel Safra: The importance of being biased. STOC 2002: 33-42
10	EE	Irit Dinur, Venkatesan Guruswami, Subhash Khot: Vertex Cover on k-Uniform Hypergraphs is Hard to Approximate within Factor (k-3-epsilon) Electronic Colloquium on Computational Complexity (ECCC)(027): (2002)
9	EE	Irit Dinur: Approximating SVPinfinity to within almost-polynomial factors is NP-hard. Theor. Comput. Sci. 285(1): 55-71 (2002)
2001
8	EE	Irit Dinur, Shmuel Safra: The Importance of Being Biased Electronic Colloquium on Computational Complexity (ECCC)(104): (2001)
2000
7	EE	Irit Dinur: Approximating SVPinfty to within Almost-Polynomial Factors Is NP-Hard. CIAC 2000: 263-276
1999
6	EE	Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra: PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. STOC 1999: 29-40
5	EE	Irit Dinur, Shmuel Safra: On the Hardness of Approximating Label Cover Electronic Colloquium on Computational Complexity (ECCC) 6(15): (1999)
4	EE	Irit Dinur: Approximating SVPinfty to within Almost-Polynomial Factors is NP-hard Electronic Colloquium on Computational Complexity (ECCC) 6(16): (1999)
1998
3	EE	Irit Dinur, Guy Kindler, Shmuel Safra: Approximating-CVP to Within Almost-Polynomial Factors is NP-Hard. FOCS 1998: 99-111
2	EE	Irit Dinur, Guy Kindler, Shmuel Safra: Approximating CVP to Within Almost Polynomial Factor is NP-Hard Electronic Colloquium on Computational Complexity (ECCC) 5(48): (1998)
1	EE	Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra: PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability Electronic Colloquium on Computational Complexity (ECCC) 5(66): (1998)

Coauthor Index

1	Eldar Fischer	[1] [6]
2	Ehud Friedgut	[26] [27] [37]
3	Elazar Goldenberg	[36]
4	Elena Grigorescu	[34] [35]
5	Venkatesan Guruswami	[10] [14] [15] [19]
6	Subhash Khot	[10] [14] [15] [19]
7	Guy Kindler	[1] [2] [3] [6] [13] [27]
8	Swastik Kopparty	[34] [35]
9	Elchanan Mossel	[21] [23] [28]
10	Kobbi Nissim	[16]
11	Ryan O'Donnell	[27]
12	Ran Raz	[1] [6] [13]
13	Oded Regev	[12] [14] [15] [19] [21] [22] [23] [28]
14	Omer Reingold	[18] [24]
15	Shmuel Safra	[1] [2] [3] [5] [6] [8] [11] [13] [17]
16	Clifford D. Smyth	[12] [22]
17	Madhu Sudan	[25] [30] [34] [35]
18	Éva Tardos	[33]
19	Avi Wigderson	[25] [30]

Colors in the list of coauthors