Online Publications

  1. Irit Dinur, Elazar Goldenberg
    Locally Testing Direct Products in the High Error Range
    Submitted.
    [Pdf] [BibTeX]

  2. Irit Dinur, Ehud Friedgut
    Intersecting families are essentially contained in juntas.
    Submitted.
    [Pdf] [BibTeX]

  3. Irit Dinur, Madhu Sudan, Avi Wigderson
    Robust local testability of tensor products of LDPC codes.
    RANDOM 2006.
    [Pdf] [BibTeX]

  4. Irit Dinur, Ehud Friedgut, Oded Regev
    Independent Sets in Graph Powers are Almost Contained in Juntas
    Accepted, GAFA. Funded by I.B.R.M.
    [Pdf] [BibTeX]

  5. Irit Dinur
    The PCP Theorem by gap amplification.
    JACM, to appear. Conference version appeared in Proc. of 38th STOC, pp. 241-250, 2006.
    [Pdf] [BibTeX]

  6. Irit Dinur, Elchanan Mossel, Oded Regev
    Conditional Hardness for Approximate Coloring.
    Proc. of 38th STOC, pp. 344-353, 2006.
    [Postscript] [BibTeX]

  7. Irit Dinur, Ehud Friedgut
    Proof of an intersection theorem via graph homomorphisms.
    Electronic Journal of Combinatorics, 13(1), 2006.
    [Pdf] [BibTeX]

  8. Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Donnell
    On the Fourier tails of bounded functions over the discrete cube.
    Proc. of 38th STOC, pp. 437-446, 2006.
    [Pdf] [BibTeX]

  9. Irit Dinur, Omer Reingold
    Assignment Testers: Towards a combinatorial proof of the PCP theorem.
    To appear in special issue of SICOMP on "Randomness and Computation". Preliminary version in FOCS 2004.
    [Pdf] [BibTeX]

  10. Noga Alon, Irit Dinur, Ehud Friedgut, Benny Sudakov
    Graph Products, Fourier Analysis and Spectral Techniques.
    GAFA, vol. 14, no. 5, pp. 913-940 (2004).
    [Postscript] [BibTeX]

  11. Irit Dinur, Kobbi Nissim
    On the Privacy of Statistical Databases.
    Proc. of PODS, 2003.
    [Postscript] [BibTeX]

  12. Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev
    A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover.
    Proc. of 35th STOC, 2003.
    [Postscript] [BibTeX]

  13. Irit Dinur, Oded Regev, Clifford Smyth
    On the Hardness of Coloring 3-Uniform Hyper-Graphs.
    Proc. of 43rd FOCS, 2002.
    [Postscript] [BibTeX]

  14. Irit Dinur, Venkatesan Guruswami, Subhash Khot
    Vertex Cover on k-Uniform Hypergraphs is Hard to Approximate within Factor (k-3-epsilon).
    ECCC TR02-027, Results in this paper have been subsumed by (9).
    [Postscript] [BibTeX]

  15. Irit Dinur, Shmuel Safra
    On the Hardness of Approximating Minimum Vertex-Cover.
    Annals of Mathematics, 162(1):439-485, 2005. (Preliminary version in STOC 2002, titled "On the Importance of Being Biased").
    [Pdf] [BibTeX]

  16. Irit Dinur, Shmuel Safra
    On the hardness of approximating label-cover.
    Information Processing Letters, 89(5):247-254, 2004.
    [Postscript] [BibTeX]

  17. Irit Dinur
    Approximating SVPinfty to within almost polynomial factors is NP-hard.
    Information Processing Letters, 89(5):247-254, 2004.
    [Postscript] [BibTeX]

  18. Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra
    PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability.
    Proc. of 31st STOC, 1999.
    [Postscript] [BibTeX]

  19. Irit Dinur, Guy Kindler, Ran Raz, Shmuel Safra
    An Improved Lower Bound for Approximating-CVP.
    Combinatorica, 23(2):205-243, 2003.
    [Postscript] [BibTeX]

  20. Irit Dinur, Guy Kindler , Shmuel Safra
    Approximating-CVP to Within Almost-Polynomial Factors is NP-hard.
    Proc. of 39th FOCS(1998). This is the conference version of previous item.
    [Postscript] [BibTeX]