Irit Dinur

grad student

2002

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.
Dinur I, Meir O. (2018) Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity Computational Complexity. 27: 375-462
David R, Dinur I, Goldenberg E, et al. (2017) Direct Sum Testing Siam Journal On Computing. 46: 1336-1369
Dinur I, Guruswami V. (2015) PCPs via the low-degree long code and hardness for constrained hypergraph coloring Israel Journal of Mathematics. 209: 611-649
Dinur I, Steurer D, Vidick T. (2015) A parallel repetition theorem for entangled projection games Computational Complexity. 24: 201-254
Dinur I, Harsha P. (2013) Composition of Low-Error 2-Query PCPs Using Decodable PCPs Siam Journal On Computing. 42: 2452-2486
Dinur I, Fischer E, Kindler G, et al. (2011) PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability Computational Complexity. 20: 413-504
Dinur I, Mossel E, Regev O. (2009) Conditional hardness for approximate coloring Siam Journal On Computing. 39: 843-873
Dinur I, Friedgut E. (2009) Intersecting families are essentially contained in juntas Combinatorics, Probability & Computing. 18: 107-122
Dinur I. (2008) PCPs with small soundness error Sigact News. 39: 41-57
Dinur I, Tardos E. (2008) Special Issue on Foundations of Computer Science Siam Journal On Computing. 37