| Year |
Citation |
Score |
| 2018 |
Dinur I, Meir O. Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity Computational Complexity. 27: 375-462. DOI: 10.1007/S00037-017-0159-X |
0.366 |
|
| 2017 |
David R, Dinur I, Goldenberg E, Kindler G, Shinkar I. Direct Sum Testing Siam Journal On Computing. 46: 1336-1369. DOI: 10.1137/16M1061655 |
0.356 |
|
| 2015 |
Dinur I, Guruswami V. PCPs via the low-degree long code and hardness for constrained hypergraph coloring Israel Journal of Mathematics. 209: 611-649. DOI: 10.1007/S11856-015-1231-3 |
0.432 |
|
| 2015 |
Dinur I, Steurer D, Vidick T. A parallel repetition theorem for entangled projection games Computational Complexity. 24: 201-254. DOI: 10.1007/S00037-015-0098-3 |
0.317 |
|
| 2013 |
Dinur I, Harsha P. Composition of Low-Error 2-Query PCPs Using Decodable PCPs Siam Journal On Computing. 42: 2452-2486. DOI: 10.1137/100788161 |
0.341 |
|
| 2011 |
Dinur I, Fischer E, Kindler G, Raz R, Safra S. PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability Computational Complexity. 20: 413-504. DOI: 10.1007/S00037-011-0014-4 |
0.495 |
|
| 2009 |
Dinur I, Mossel E, Regev O. Conditional hardness for approximate coloring Siam Journal On Computing. 39: 843-873. DOI: 10.1137/07068062X |
0.374 |
|
| 2009 |
Dinur I, Friedgut E. Intersecting families are essentially contained in juntas Combinatorics, Probability & Computing. 18: 107-122. DOI: 10.1017/S0963548308009309 |
0.359 |
|
| 2008 |
Dinur I. PCPs with small soundness error Sigact News. 39: 41-57. DOI: 10.1145/1412700.1412713 |
0.303 |
|
| 2008 |
Dinur I, Tardos E. Special Issue on Foundations of Computer Science Siam Journal On Computing. 37. DOI: 10.1137/Smjcat000037000006000Vii000001 |
0.311 |
|
| 2008 |
Dinur I, Friedgut E, Regev O. Independent sets in graph powers are almost contained in juntas Geometric and Functional Analysis. 18: 77-97. DOI: 10.1007/S00039-008-0651-1 |
0.388 |
|
| 2007 |
Dinur I. The PCP theorem by gap amplification Journal of the Acm. 54: 12. DOI: 10.1145/1236457.1236459 |
0.51 |
|
| 2007 |
Dinur I, Friedgut E, Kindler G, O’Donnell R. On the Fourier tails of bounded functions over the discrete cube Israel Journal of Mathematics. 160: 389-412. DOI: 10.1007/S11856-007-0068-9 |
0.347 |
|
| 2006 |
Dinur I, Friedgut E. Proof of an intersection theorem via graph homomorphisms. Electronic Journal of Combinatorics. 13: 6. DOI: 10.37236/1144 |
0.303 |
|
| 2006 |
Dinur I, Reingold O. Assignment testers: Towards a combinatorial proof of the PCP theorem Siam Journal On Computing. 36: 975-1024. DOI: 10.1137/S0097539705446962 |
0.384 |
|
| 2005 |
Dinur I, Safra S. On the hardness of approximating minimum vertex cover Annals of Mathematics. 162: 439-485. DOI: 10.4007/Annals.2005.162.439 |
0.568 |
|
| 2005 |
Dinur I, Guruswami V, Khot S, Regev O. A new multilayered PCP and the hardness of hypergraph vertex cover Siam Journal On Computing. 34: 1129-1146. DOI: 10.1137/S0097539704443057 |
0.465 |
|
| 2005 |
Dinur I, Regev O, Smyth C. The hardness of 3-uniform hypergraph coloring Combinatorica. 25: 519-535. DOI: 10.1007/S00493-005-0032-4 |
0.424 |
|
| 2004 |
Dinur I, Safra S. On the hardness of approximating label-cover Information Processing Letters. 89: 247-254. DOI: 10.1016/J.Ipl.2003.11.007 |
0.583 |
|
| 2004 |
Alon N, Dinur I, Friedgut E, Sudakov B. Graph Products, Fourier Analysis and Spectral Techniques Geometric and Functional Analysis. 14: 913-940. DOI: 10.1007/S00039-004-0478-3 |
0.382 |
|
| 2003 |
Dinur I, Kindler G, Raz R, Safra S. Approximating CVP to Within Almost-Polynomial Factors is NP-Hard Combinatorica. 23: 205-243. DOI: 10.1007/S00493-003-0019-Y |
0.579 |
|
| Show low-probability matches. |