|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 19 occurrences of 15 keywords
|
|
|
|
|
Results
Found 53 publication records. Showing 53 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Irit Dinur, Tali Kaufman |
Dense locally testable codes cannot have constant rate and distance.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra |
PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability. |
Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Or Meir |
Derandomized Parallel Repetition via Structured PCPs. |
Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Tali Kaufman |
Dense Locally Testable Codes Cannot Have Constant Rate and Distance. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Or Meir |
Derandomized Parallel Repetition via Structured PCPs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Irit Dinur, Tali Kaufman |
Dense locally testable codes cannot have constant rate and distance |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Irit Dinur, Or Meir |
Derandomized Parallel Repetition of Structured PCPs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Irit Dinur, Prahladh Harsha |
Composition of Low-Error 2-Query PCPs Using Decodable PCPs. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Elazar Goldenberg |
The Structure of Winning Strategies in Parallel Repetition Games. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Igor Shinkar |
On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Subhash Khot, Will Perkins, Muli Safra |
Hardness of Finding Independent Sets in Almost 3-Colorable Graphs. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Or Meir |
Derandomized Parallel Repetition of Structured PCPs. |
IEEE Conference on Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
Low error, Direct Product Test, Derandomized Parallel Repetition, PCP, Direct Product, de-Bruijn |
| 1 | Irit Dinur, Prahladh Harsha |
Composition of low-error 2-query PCPs using decodable PCPs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Irit Dinur, Ehud Friedgut |
Intersecting Families are Essentially Contained in Juntas. |
Combinatorics, Probability & Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Elchanan Mossel, Oded Regev |
Conditional Hardness for Approximate Coloring. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Klaus Jansen, Joseph Naor, José D. P. Rolim (eds.) |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Prahladh Harsha |
Composition of Low-Error 2-Query PCPs Using Decodable PCPs. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
locally decodable, low soundness error, composition, PCP |
| 1 | Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan |
Decodability of Group Homomorphisms beyond the Johnson Bound. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Irit Dinur |
PCPs with small soundness error. |
SIGACT News |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Éva Tardos |
Special Issue on Foundations of Computer Science. |
SIAM J. Comput. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Irit Dinur, Elazar Goldenberg |
Locally Testing Direct Product in the Low Error Range. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan |
Decodability of group homomorphisms beyond the johnson bound. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
hadamard codes, list decoding, sublinear time algorithms |
| 1 | Irit Dinur |
The PCP theorem by gap amplification. |
J. ACM |
2007 |
DBLP DOI BibTeX RDF |
Gap amplification, PCP |
| 1 | Irit Dinur, Madhu Sudan, Avi Wigderson |
Robust Local Testability of Tensor Products of LDPC Codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Irit Dinur, Ehud Friedgut |
Proof of an Intersection Theorem via Graph Homomorphisms. |
Electr. J. Comb. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Irit Dinur, Omer Reingold |
Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Madhu Sudan, Avi Wigderson |
Robust Local Testability of Tensor Products of LDPC Codes. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur |
The PCP theorem by gap amplification. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
gap amplification, PCP |
| 1 | Irit Dinur, Elchanan Mossel, Oded Regev |
Conditional hardness for approximate coloring. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
graph coloring, hardness of approximation, unique games conjecture |
| 1 | Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Donnell |
On the fourier tails of bounded functions over the discrete cube. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
boolean functions, Fourier analysis, symmetry-breaking |
| 1 | Irit Dinur |
The PCP theorem by gap amplification |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Irit Dinur, Elchanan Mossel, Oded Regev |
Conditional Hardness for Approximate Coloring |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Irit Dinur, Oded Regev, Clifford D. Smyth |
The Hardness of 3-Uniform Hypergraph Coloring. |
Combinatorica |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 68Q17 |
| 1 | Irit Dinur, Elchanan Mossel, Oded Regev |
Conditional Hardness for Approximate Coloring |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev |
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Shmuel Safra |
On the hardness of approximating label-cover. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Omer Reingold |
Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Guy Kindler, Ran Raz, Shmuel Safra |
Approximating CVP to Within Almost-Polynomial Factors is NP-Hard. |
Combinatorica |
2003 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000): 68Q17 |
| 1 | Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev |
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Irit Dinur, Kobbi Nissim |
Revealing information while preserving privacy. |
PODS |
2003 |
DBLP DOI BibTeX RDF |
integrity and security, subset-sums with noise, data reconstruction |
| 1 | Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev |
A new multilayered PCP and the hardness of hypergraph vertex cover. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
hypergraph vertex cover, long code, multilayered PCP, hardness of approximation |
| 1 | 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) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Irit Dinur |
Approximating SVPinfinity to within almost-polynomial factors is NP-hard. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Oded Regev, Clifford D. Smyth |
The Hardness of 3 - Uniform Hypergraph Coloring. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Shmuel Safra |
The importance of being biased. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Shmuel Safra |
The Importance of Being Biased |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Irit Dinur |
Approximating SVPinfty to within Almost-Polynomial Factors Is NP-Hard. |
CIAC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur |
Approximating SVPinfty to within Almost-Polynomial Factors is NP-hard |
Electronic Colloquium on Computational Complexity (ECCC) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Irit Dinur, Shmuel Safra |
On the Hardness of Approximating Label Cover |
Electronic Colloquium on Computational Complexity (ECCC) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra |
PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Guy Kindler, Shmuel Safra |
Approximating CVP to Within Almost Polynomial Factor is NP-Hard |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | 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) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Irit Dinur, Guy Kindler, Shmuel Safra |
Approximating-CVP to Within Almost-Polynomial Factors is NP-Hard. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
CVP, closest-vector, approximation, lattice |
Displaying result #1 - #53 of 53 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")