Travelled to:1 × Latvia
2 × Canada
6 × USA
Collaborated with:G.Kindler S.Safra O.Regev D.Steurer E.Goldenberg ∅ K.Nissim P.Harsha E.Mossel E.Grigorescu S.Kopparty M.Sudan E.Friedgut R.O'Donnell V.Guruswami S.Khot E.Fischer R.Raz
Talks about:pcp (3) polynomi (2) error (2) decod (2) bound (2) hard (2) polyloglog (1) hypergraph (1) homomorph (1) character (1)
Person: Irit Dinur
DBLP: Dinur:Irit
Contributed to:
20152014
201320082006
2003200320021999Wrote 11 papers:
- STOC-2015-DinurHK #composition #fault #query
- Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition (ID, PH, GK), pp. 267–276.
- STOC-2014-DinurS #approach #parallel
- Analytical approach to parallel repetition (ID, DS), pp. 624–633.
- ICALP-v1-2013-DinurG #clustering
- Clustering in the Boolean Hypercube in a List Decoding Regime (ID, EG), pp. 413–424.
- STOC-2008-DinurGKS #bound #morphism
- Decodability of group homomorphisms beyond the johnson bound (ID, EG, SK, MS), pp. 275–284.
- STOC-2006-Dinur #theorem
- The PCP theorem by gap amplification (ID), pp. 241–250.
- STOC-2006-DinurFKO #bound #fourier #on the
- On the fourier tails of bounded functions over the discrete cube (ID, EF, GK, RO), pp. 437–446.
- STOC-2006-DinurMR #approximate
- Conditional hardness for approximate coloring (ID, EM, OR), pp. 344–353.
- PODS-2003-DinurN #privacy
- Revealing information while preserving privacy (ID, KN), pp. 202–210.
- STOC-2003-DinurGKR #multi
- A new multilayered PCP and the hardness of hypergraph vertex cover (ID, VG, SK, OR), pp. 595–601.
- STOC-2002-DinurS
- The importance of being biased (ID, SS), pp. 33–42.
- STOC-1999-DinurFKRS #towards
- PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability (ID, EF, GK, RR, SS), pp. 29–40.