The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Irit Dinur: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Irit Dinur
    Approximating SVPinfty to within Almost-Polynomial Factors Is NP-Hard. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:263-276 [Conf]
  3. 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]
  4. 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]
  5. 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]
  6. Irit Dinur, Kobbi Nissim
    Revealing information while preserving privacy. [Citation Graph (0, 0)][DBLP]
    PODS, 2003, pp:202-210 [Conf]
  7. Irit Dinur
    The PCP theorem by gap amplification. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:241-250 [Conf]
  8. 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]
  9. 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]
  10. 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]
  11. Irit Dinur, Elchanan Mossel, Oded Regev
    Conditional hardness for approximate coloring. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:344-353 [Conf]
  12. Irit Dinur, Shmuel Safra
    The importance of being biased. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:33-42 [Conf]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. 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]
  21. 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]
  22. 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]
  23. Irit Dinur
    Approximating SVPinfty to within Almost-Polynomial Factors is NP-hard [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:16, pp:- [Journal]
  24. 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]
  25. 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]
  26. 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]
  27. Irit Dinur
    Approximating SVPinfinity to within almost-polynomial factors is NP-hard. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:285, n:1, pp:55-71 [Journal]
  28. Irit Dinur, Elchanan Mossel, Oded Regev
    Conditional Hardness for Approximate Coloring [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  29. Irit Dinur
    The PCP theorem by gap amplification. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2007, v:54, n:3, pp:12- [Journal]

  30. On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors. [Citation Graph (, )][DBLP]


  31. The Structure of Winning Strategies in Parallel Repetition Games. [Citation Graph (, )][DBLP]


  32. Derandomized Parallel Repetition of Structured PCPs. [Citation Graph (, )][DBLP]


  33. Locally Testing Direct Product in the Low Error Range. [Citation Graph (, )][DBLP]


  34. Composition of Low-Error 2-Query PCPs Using Decodable PCPs. [Citation Graph (, )][DBLP]


  35. Decodability of group homomorphisms beyond the johnson bound. [Citation Graph (, )][DBLP]


  36. Proof of an Intersection Theorem via Graph Homomorphisms. [Citation Graph (, )][DBLP]


  37. Derandomized Parallel Repetition of Structured PCPs [Citation Graph (, )][DBLP]


  38. Intersecting Families are Essentially Contained in Juntas. [Citation Graph (, )][DBLP]


  39. Decodability of Group Homomorphisms beyond the Johnson Bound. [Citation Graph (, )][DBLP]


  40. Robust Local Testability of Tensor Products of LDPC Codes. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002