Irit Dinur Papers on DiSC'04 Revealing information while preserving privacy Publications Note: Links lead to the DBLP on the Web. Irit Dinur Irit Dinur, Kobbi Nissim : Revealing information while preserving privacy. PODS 2003 : 202-210 Irit Dinur, Venkatesan Guruswami , Subhash Khot , Oded Regev : A new multilayered PCP and the hardness of hypergraph vertex cover. STOC 2003 : 595-601 Irit Dinur, Oded Regev , Clifford D. Smyth : The Hardness of 3 - Uniform Hypergraph Coloring. FOCS 2002 : 33- Irit Dinur, Shmuel Safra : The importance of being biased. STOC 2002 : 33-42 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) Irit Dinur: Approximating SVP infinity to within almost-polynomial factors is NP-hard. Theor. Comput. Sci. 285 (1): 55-71 (2002) Irit Dinur, Shmuel Safra : The Importance of Being Biased Electronic Colloquium on Computational Complexity (ECCC) (104): (2001) Irit Dinur: Approximating SVP infty to within Almost-Polynomial Factors Is NP-Hard. CIAC 2000 : 263-276 Irit Dinur, Eldar Fischer , Guy Kindler , Ran Raz , Shmuel Safra : PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. STOC 1999 : 29-40 Irit Dinur, Shmuel Safra : On the Hardness of Approximating Label Cover Electronic Colloquium on Computational Complexity (ECCC) 6 (15): (1999) Irit Dinur: Approximating SVP infty to within Almost-Polynomial Factors is NP-hard Electronic Colloquium on Computational Complexity (ECCC) 6 (16): (1999) Irit Dinur, Guy Kindler , Shmuel Safra : Approximating-CVP to Within Almost-Polynomial Factors is NP-Hard. FOCS 1998 : 99-111 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) 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) 1 [ 1 ] [ 6 ] 2 [ 10 ] [ 13 ] 3 [ 10 ] [ 13 ] 4 [ 1 ] [ 2 ] [ 3 ] [ 6 ] 5 [ 14 ] 6 [ 1 ] [ 6 ] 7 [ 12 ] [ 13 ] 8 [ 1 ] [ 2 ] [ 3 ] [ 5 ] [ 6 ] [ 8 ] [ 11 ] 9 [ 12 ] ©2004 Association for Computing Machinery