Irit Dinur - RankMe

165 papers A* 31A 17C 1Journal 106Unranked 8

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Agreement Tests on Graphs and Hypergraphs. SIAM J. Comput. Irit Dinur, Yuval Filmus, Prahladh Harsha
2025	J	`jnl`	Expansion without Connectivity: A Property Testing Perspective. Electron. Colloquium Comput. Complex. Irit Dinur, Oded Goldreich
2025	A	`conf`	New Codes on High Dimensional Expanders. CCC Irit Dinur, Siqi Liu, Rachel Yun Zhang
2024	A*	`conf`	Agreement Theorems for High Dimensional Expanders in the Low Acceptance Regime: The Role of Covers. STOC Yotam Dikstein, Irit Dinur
2024	J	`jnl`	Bipartite Unique Neighbour Expanders via Ramanujan Graphs. Entropy Ron Asherov, Irit Dinur
2024	J	`jnl`	Boolean Function Analysis on High-Dimensional Expanders. Comb. Yotam Dikstein, Irit Dinur, Yuval Filmus, Prahladh Harsha
2024	A	`conf`	Coboundary and Cosystolic Expansion Without Dependence on Dimension or Degree. APPROX/RANDOM Yotam Dikstein, Irit Dinur
2024	A*	`conf`	Expansion of High-Dimensional Cubical Complexes: with Application to Quantum Locally Testable Codes. FOCS Irit Dinur, Ting-Chun Lin, Thomas Vidick
2024	J	`jnl`	Expansion of higher-dimensional cubical complexes with application to quantum locally testable codes. CoRR Irit Dinur, Ting-Chun Lin, Thomas Vidick
2024	A*	`conf`	Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs. FOCS Yotam Dikstein, Irit Dinur, Alexander Lubotzky
2024	J	`jnl`	Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs. CoRR Yotam Dikstein, Irit Dinur, Alexander Lubotzky
2024	J	`jnl`	Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs. Electron. Colloquium Comput. Complex. Yotam Dikstein, Irit Dinur, Alexander Lubotzky
2024	J	`jnl`	Sparse juntas on the biased hypercube. TheoretiCS Irit Dinur, Yuval Filmus, Prahladh Harsha
2024	A*	`conf`	Swap Cosystolic Expansion. STOC Yotam Dikstein, Irit Dinur
2023	J	`jnl`	Agreement theorems for high dimensional expanders in the small soundness regime: the role of covers. CoRR Yotam Dikstein, Irit Dinur
2023	J	`jnl`	Agreement theorems for high dimensional expanders in the small soundness regime: the role of covers. Electron. Colloquium Comput. Complex. Yotam Dikstein, Irit Dinur
2023	J	`jnl`	Bipartite unique-neighbour expanders via Ramanujan graphs. CoRR Ron Asherov, Irit Dinur
2023	J	`jnl`	Coboundary and cosystolic expansion without dependence on dimension or degree. CoRR Yotam Dikstein, Irit Dinur
2023	J	`jnl`	Coboundary and cosystolic expansion without dependence on dimension or degree. Electron. Colloquium Comput. Complex. Yotam Dikstein, Irit Dinur
2023	J	`jnl`	Exponentially Small Soundness for the Direct Product Z-test. Theory Comput. Irit Dinur, Inbal Livni Navon
2023	A*	`conf`	Good Quantum LDPC Codes with Linear Time Decoders. STOC Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, Thomas Vidick
2023	J	`jnl`	New Codes on High Dimensional Expanders. CoRR Irit Dinur, Siqi Liu, Rachel Yun Zhang
2023	J	`jnl`	New Codes on High Dimensional Expanders. Electron. Colloquium Comput. Complex. Irit Dinur, Siqi Liu, Rachel Yun Zhang
2023	J	`jnl`	Swap cosystolic expansion. CoRR Yotam Dikstein, Irit Dinur
2023	J	`jnl`	Swap cosystolic expansion. Electron. Colloquium Comput. Complex. Yotam Dikstein, Irit Dinur
2023	J	`jnl`	The linear time encoding scheme fails to encode. CoRR Yotam Dikstein, Irit Dinur, Shiri Sivan
2022	A*	`conf`	A Characterization of Multiclass Learnability. FOCS Nataly Brukhim, Daniel Carmon, Irit Dinur, Shay Moran, Amir Yehudayoff
2022	J	`jnl`	A Characterization of Multiclass Learnability. CoRR Nataly Brukhim, Daniel Carmon, Irit Dinur, Shay Moran, Amir Yehudayoff
2022	J	`jnl`	A Characterization of Multiclass Learnability. Electron. Colloquium Comput. Complex. Nataly Brukhim, Daniel Carmon, Irit Dinur, Shay Moran, Amir Yehudayoff
2022	—	`conf`	Expanders in Higher Dimensions (Invited Talk). FSTTCS Irit Dinur
2022	J	`jnl`	From Local to Robust Testing via Agreement Testing. Theory Comput. Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi
2022	J	`jnl`	Good Locally Testable Codes. CoRR Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, Shahar Mozes
2022	A*	`conf`	Locally testable codes with constant rate, distance, and locality. STOC Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, Shahar Mozes
2021	A	`conf`	Explicit SoS Lower Bounds from High-Dimensional Expanders. ITCS Irit Dinur, Yuval Filmus, Prahladh Harsha, Madhur Tulsiani
2021	J	`jnl`	List-Decoding with Double Samplers. SIAM J. Comput. Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma
2021	J	`jnl`	Locally Testable Codes with constant rate, distance, and locality. CoRR Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, Shahar Mozes
2021	J	`jnl`	Locally Testable Codes with constant rate, distance, and locality. Electron. Colloquium Comput. Complex. Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, Shahar Mozes
2020	J	`jnl`	Explicit SoS lower bounds from high-dimensional expanders. CoRR Irit Dinur, Yuval Filmus, Prahladh Harsha, Madhur Tulsiani
2020	J	`jnl`	Explicit and structured sum of squares lower bounds from high dimensional expanders. Electron. Colloquium Comput. Complex. Irit Dinur, Yuval Filmus, Prahladh Harsha, Madhur Tulsiani
2020	J	`jnl`	Locally testable codes via high-dimensional expanders. CoRR Yotam Dikstein, Irit Dinur, Prahladh Harsha, Noga Ron-Zewi
2020	J	`jnl`	Locally testable codes via high-dimensional expanders. Electron. Colloquium Comput. Complex. Yotam Dikstein, Irit Dinur, Prahladh Harsha, Noga Ron-Zewi
2019	A*	`conf`	Agreement Testing Theorems on Layered Set Systems. FOCS Yotam Dikstein, Irit Dinur
2019	J	`jnl`	Agreement testing theorems on layered set systems. CoRR Yotam Dikstein, Irit Dinur
2019	J	`jnl`	Agreement testing theorems on layered set systems. Electron. Colloquium Comput. Complex. Yotam Dikstein, Irit Dinur
2019	A*	`conf`	Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract]. SODA Irit Dinur, Yuval Filmus, Prahladh Harsha
2019	—	`conf`	Direct Sum Testing: The General Case. APPROX-RANDOM Irit Dinur, Konstantin Golubev
2019	J	`jnl`	Direct sum testing - the general case. Electron. Colloquium Comput. Complex. Irit Dinur, Konstantin Golubev
2019	A	`conf`	Every Set in P Is Strongly Testable Under a Suitable Encoding. ITCS Irit Dinur, Oded Goldreich, Tom Gur
2019	A	`conf`	From Local to Robust Testing via Agreement Testing. ITCS Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi
2019	A*	`conf`	List Decoding with Double Samplers. SODA Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma
2019	J	`jnl`	Near Coverings and Cosystolic Expansion - an example of topological property testing. Electron. Colloquium Comput. Complex. Irit Dinur, Roy Meshulam
2019	J	`jnl`	Special Section on the Fifty-Seventh Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016). SIAM J. Comput. Irit Dinur, Or Meir, Swastik Kopparty
2019	J	`jnl`	Testing tensor products. CoRR Irit Dinur, Konstantin Golubev
2018	—	`conf`	Boolean Function Analysis on High-Dimensional Expanders. APPROX-RANDOM Yotam Dikstein, Irit Dinur, Yuval Filmus, Prahladh Harsha
2018	J	`jnl`	Boolean function analysis on high-dimensional expanders. Electron. Colloquium Comput. Complex. Irit Dinur, Yotam Dikstein, Yuval Filmus, Prahladh Harsha
2018	J	`jnl`	Boolean functions on high-dimensional expanders. CoRR Yotam Dikstein, Irit Dinur, Yuval Filmus, Prahladh Harsha
2018	A	`conf`	ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network. ITCS Irit Dinur, Pasin Manurangsi
2018	J	`jnl`	ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network. CoRR Irit Dinur, Pasin Manurangsi
2018	J	`jnl`	ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network. Electron. Colloquium Comput. Complex. Irit Dinur, Pasin Manurangsi
2018	J	`jnl`	Every set in P is strongly testable under a suitable encoding. Electron. Colloquium Comput. Complex. Irit Dinur, Oded Goldreich, Tom Gur
2018	J	`jnl`	From Local to Robust Testing via Agreement Testing. Electron. Colloquium Comput. Complex. Irit Dinur, Tali Kaufman, Noga Ron-Zewi
2018	J	`jnl`	List Decoding with Double Samplers. CoRR Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma
2018	J	`jnl`	List Decoding with Double Samplers. Electron. Colloquium Comput. Complex. Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma
2018	A*	`conf`	On non-optimally expanding sets in Grassmann graphs. STOC Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra
2018	J	`jnl`	Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity. Comput. Complex. Irit Dinur, Or Meir
2018	A*	`conf`	Towards a proof of the 2-to-1 games conjecture? STOC Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra
2017	J	`jnl`	Agreement tests on graphs and hypergraphs. CoRR Irit Dinur, Yuval Filmus, Prahladh Harsha
2017	J	`jnl`	Agreement tests on graphs and hypergraphs. Electron. Colloquium Comput. Complex. Irit Dinur, Yuval Filmus, Prahladh Harsha
2017	A	`conf`	Cube vs. Cube Low Degree Test. ITCS Amey Bhangale, Irit Dinur, Inbal Livni Navon
2017	J	`jnl`	Direct Sum Testing. SIAM J. Comput. Roee David, Irit Dinur, Elazar Goldenberg, Guy Kindler, Igor Shinkar
2017	A	`conf`	Exponentially Small Soundness for the Direct Product Z-Test. CCC Irit Dinur, Inbal Livni Navon
2017	J	`jnl`	Exponentially Small Soundness for the Direct Product Z-test. Electron. Colloquium Comput. Complex. Irit Dinur, Inbal Livni Navon
2017	A*	`conf`	High Dimensional Expanders Imply Agreement Expanders. FOCS Irit Dinur, Tali Kaufman
2017	J	`jnl`	High dimensional expanders imply agreement expanders. Electron. Colloquium Comput. Complex. Irit Dinur, Tali Kaufman
2017	J	`jnl`	Low degree almost Boolean functions are sparse juntas. CoRR Irit Dinur, Yuval Filmus, Prahladh Harsha
2017	J	`jnl`	Low degree almost Boolean functions are sparse juntas. Electron. Colloquium Comput. Complex. Irit Dinur, Yuval Filmus, Prahladh Harsha
2017	A	`conf`	Multiplayer Parallel Repetition for Expanding Games. ITCS Irit Dinur, Prahladh Harsha, Rakesh Venkat, Henry Yuen
2017	J	`jnl`	On Non-Optimally Expanding Sets in Grassmann Graphs. Electron. Colloquium Comput. Complex. Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra
2016	J	`jnl`	Cube vs. Cube Low Degree Test. CoRR Amey Bhangale, Irit Dinur, Inbal Livni Navon
2016	J	`jnl`	Cube vs. Cube Low Degree Test. Electron. Colloquium Comput. Complex. Amey Bhangale, Irit Dinur, Inbal Livni Navon
2016	A*	`ed.`	IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, Hyatt Regency, New Brunswick, New Jersey, USA, October 9-11, 2016 FOCS Irit Dinur
2016	J	`jnl`	Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover. Electron. Colloquium Comput. Complex. Irit Dinur
2016	J	`jnl`	Multiplayer parallel repetition for expander games. CoRR Irit Dinur, Prahladh Harsha, Rakesh Venkat, Henry Yuen
2016	J	`jnl`	Multiplayer parallel repetition for expander games. Electron. Colloquium Comput. Complex. Irit Dinur, Prahladh Harsha, Rakesh Venkat, Henry Yuen
2016	A	`conf`	Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity. CCC Irit Dinur, Or Meir
2016	J	`jnl`	Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity. Electron. Colloquium Comput. Complex. Irit Dinur, Or Meir
2016	J	`jnl`	Towards a Proof of the 2-to-1 Games Conjecture? Electron. Colloquium Comput. Complex. Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra
2015	J	`jnl`	A parallel repetition theorem for entangled projection games. Comput. Complex. Irit Dinur, David Steurer, Thomas Vidick
2015	A	`conf`	Derandomized Graph Product Results Using the Low Degree Long Code. STACS Irit Dinur, Prahladh Harsha, Srikanth Srinivasan, Girish Varma
2015	A	`conf`	Direct Sum Testing. ITCS Roee David, Irit Dinur, Elazar Goldenberg, Guy Kindler, Igor Shinkar
2015	A*	`conf`	Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition. STOC Irit Dinur, Prahladh Harsha, Guy Kindler
2015	J	`jnl`	Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition. CoRR Irit Dinur, Prahladh Harsha, Guy Kindler
2015	J	`jnl`	Polynomially Low Error PCPs with polyloglogn Queries via Modular Composition. Electron. Colloquium Comput. Complex. Irit Dinur, Prahladh Harsha, Guy Kindler
2015	A	`conf`	The Computational Benefit of Correlated Instances. ITCS Irit Dinur, Shafi Goldwasser, Huijia Lin
2014	A	`conf`	A Parallel Repetition Theorem for Entangled Projection Games. CCC Irit Dinur, David Steurer, Thomas Vidick
2014	A*	`conf`	Analytical approach to parallel repetition. STOC Irit Dinur, David Steurer
2014	J	`jnl`	Derandomized Graph Product Results using the Low Degree Long Code. CoRR Irit Dinur, Prahladh Harsha, Srikanth Srinivasan, Girish Varma
2014	A	`conf`	Direct Product Testing. CCC Irit Dinur, David Steurer
2014	J	`jnl`	Direct Sum Testing. Electron. Colloquium Comput. Complex. Roee David, Irit Dinur, Elazar Goldenberg, Guy Kindler, Igor Shinkar
2014	J	`jnl`	The Computational Benefit of Correlated Instances. Electron. Colloquium Comput. Complex. Irit Dinur, Shafi Goldwasser, Huijia Lin
2013	J	`jnl`	A parallel repetition theorem for entangled projection games. CoRR Irit Dinur, David Steurer, Thomas Vidick
2013	J	`jnl`	Analytical Approach to Parallel Repetition CoRR Irit Dinur, David Steurer
2013	—	`conf`	Clustering in the Boolean Hypercube in a List Decoding Regime. ICALP (1) Irit Dinur, Elazar Goldenberg
2013	J	`jnl`	Clustering in the Boolean Hypercube in a List Decoding Regime. Electron. Colloquium Comput. Complex. Irit Dinur, Elazar Goldenberg
2013	J	`jnl`	Composition of Low-Error 2-Query PCPs Using Decodable PCPs. SIAM J. Comput. Irit Dinur, Prahladh Harsha
2013	A	`conf`	Covering CSPs. CCC Irit Dinur, Gillat Kol
2013	J	`jnl`	Direct Product Testing. Electron. Colloquium Comput. Complex. Irit Dinur, David Steurer
2013	J	`jnl`	On the Conditional Hardness of Coloring a 4-colorable Graph with Super-Constant Number of Colors. Electron. Colloquium Comput. Complex. Irit Dinur, Igor Shinkar
2013	A*	`conf`	PCPs via Low-Degree Long Code and Hardness for Constrained Hypergraph Coloring. FOCS Irit Dinur, Venkatesan Guruswami
2013	J	`jnl`	PCPs via low-degree long code and hardness for constrained hypergraph coloring. Electron. Colloquium Comput. Complex. Irit Dinur, Venkatesan Guruswami
2013	J	`jnl`	Special Issue "Conference on Computational Complexity 2012" Guest editors' foreword. Comput. Complex. Boaz Barak, Irit Dinur
2012	J	`jnl`	Covering CSPs. Electron. Colloquium Comput. Complex. Irit Dinur, Gillat Kol
2011	—	`conf`	Dense Locally Testable Codes Cannot Have Constant Rate and Distance. APPROX-RANDOM Irit Dinur, Tali Kaufman
2011	J	`jnl`	Dense locally testable codes cannot have constant rate and distance. Electron. Colloquium Comput. Complex. Irit Dinur, Tali Kaufman
2011	J	`jnl`	Derandomized Parallel Repetition via Structured PCPs. Comput. Complex. Irit Dinur, Or Meir
2011	J	`jnl`	PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability. Comput. Complex. Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra
2010	—	`ch.`	Composition of Low-Error 2-Query PCPs Using Decodable PCPs. Property Testing Irit Dinur, Prahladh Harsha
2010	J	`jnl`	Dense locally testable codes cannot have constant rate and distance CoRR Irit Dinur, Tali Kaufman
2010	J	`jnl`	Derandomized Parallel Repetition of Structured PCPs CoRR Irit Dinur, Or Meir
2010	A	`conf`	Derandomized Parallel Repetition of Structured PCPs. CCC Irit Dinur, Or Meir
2010	J	`jnl`	Derandomized Parallel Repetition via Structured PCPs. Electron. Colloquium Comput. Complex. Irit Dinur, Or Meir
2010	A*	`conf`	Hardness of Finding Independent Sets in Almost 3-Colorable Graphs. FOCS Irit Dinur, Subhash Khot, Will Perkins, Muli Safra
2010	—	`conf`	On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors. APPROX-RANDOM Irit Dinur, Igor Shinkar
2010	—	`conf`	The Structure of Winning Strategies in Parallel Repetition Games. APPROX-RANDOM Irit Dinur, Elazar Goldenberg
2009	—	`ed.`	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 Irit Dinur, Klaus Jansen, Joseph Naor, José D. P. Rolim
2009	A*	`conf`	Composition of Low-Error 2-Query PCPs Using Decodable PCPs. FOCS Irit Dinur, Prahladh Harsha
2009	J	`jnl`	Composition of low-error 2-query PCPs using decodable PCPs. Electron. Colloquium Comput. Complex. Irit Dinur, Prahladh Harsha
2009	J	`jnl`	Conditional Hardness for Approximate Coloring. SIAM J. Comput. Irit Dinur, Elchanan Mossel, Oded Regev
2009	J	`jnl`	Intersecting Families are Essentially Contained in Juntas. Comb. Probab. Comput. Irit Dinur, Ehud Friedgut
2008	J	`jnl`	Decodability of Group Homomorphisms beyond the Johnson Bound. Electron. Colloquium Comput. Complex. Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan
2008	A*	`conf`	Decodability of group homomorphisms beyond the johnson bound. STOC Irit Dinur, Elena Grigorescu, Swastik Kopparty, Madhu Sudan
2008	A*	`conf`	Locally Testing Direct Product in the Low Error Range. FOCS Irit Dinur, Elazar Goldenberg
2008	J	`jnl`	PCPs with small soundness error. SIGACT News Irit Dinur
2008	J	`jnl`	Special Issue on Foundations of Computer Science. SIAM J. Comput. Irit Dinur, Éva Tardos
2007	J	`jnl`	The PCP theorem by gap amplification. J. ACM Irit Dinur
2006	J	`jnl`	Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem. SIAM J. Comput. Irit Dinur, Omer Reingold
2006	A*	`conf`	Conditional hardness for approximate coloring. STOC Irit Dinur, Elchanan Mossel, Oded Regev
2006	A*	`conf`	On the fourier tails of bounded functions over the discrete cube. STOC Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Donnell
2006	J	`jnl`	Proof of an Intersection Theorem via Graph Homomorphisms. Electron. J. Comb. Irit Dinur, Ehud Friedgut
2006	—	`conf`	Robust Local Testability of Tensor Products of LDPC Codes. APPROX-RANDOM Irit Dinur, Madhu Sudan, Avi Wigderson
2006	J	`jnl`	Robust Local Testability of Tensor Products of LDPC Codes. Electron. Colloquium Comput. Complex. Irit Dinur, Madhu Sudan, Avi Wigderson
2006	A*	`conf`	The PCP theorem by gap amplification. STOC Irit Dinur
2005	J	`jnl`	A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover. SIAM J. Comput. Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev
2005	J	`jnl`	Conditional Hardness for Approximate Coloring CoRR Irit Dinur, Elchanan Mossel, Oded Regev
2005	J	`jnl`	Conditional Hardness for Approximate Coloring Electron. Colloquium Comput. Complex. Irit Dinur, Elchanan Mossel, Oded Regev
2005	J	`jnl`	The Hardness of 3-Uniform Hypergraph Coloring. Comb. Irit Dinur, Oded Regev, Clifford D. Smyth
2005	J	`jnl`	The PCP theorem by gap amplification Electron. Colloquium Comput. Complex. Irit Dinur
2004	A*	`conf`	Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem. FOCS Irit Dinur, Omer Reingold
2004	J	`jnl`	On the hardness of approximating label-cover. Inf. Process. Lett. Irit Dinur, Shmuel Safra
2003	J	`jnl`	A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover CoRR Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev
2003	A*	`conf`	A new multilayered PCP and the hardness of hypergraph vertex cover. STOC Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev
2003	J	`jnl`	Approximating CVP to Within Almost-Polynomial Factors is NP-Hard. Comb. Irit Dinur, Guy Kindler, Ran Raz, Shmuel Safra
2003	A*	`conf`	Revealing information while preserving privacy. PODS Irit Dinur, Kobbi Nissim
2002	J	`jnl`	Approximating SVP Theor. Comput. Sci. Irit Dinur
2002	A*	`conf`	The Hardness of 3 - Uniform Hypergraph Coloring. FOCS Irit Dinur, Oded Regev, Clifford D. Smyth
2002	A*	`conf`	The importance of being biased. STOC Irit Dinur, Shmuel Safra
2002	J	`jnl`	Vertex Cover on k-Uniform Hypergraphs is Hard to Approximate within Factor (k-3-epsilon) Electron. Colloquium Comput. Complex. Irit Dinur, Venkatesan Guruswami, Subhash Khot
2001	J	`jnl`	The Importance of Being Biased Electron. Colloquium Comput. Complex. Irit Dinur, Shmuel Safra
2000	C	`conf`	Approximating SVP CIAC Irit Dinur
1999	J	`jnl`	Approximating SVP Electron. Colloquium Comput. Complex. Irit Dinur
1999	J	`jnl`	On the Hardness of Approximating Label Cover Electron. Colloquium Comput. Complex. Irit Dinur, Shmuel Safra
1999	A*	`conf`	PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. STOC Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra
1998	J	`jnl`	Approximating CVP to Within Almost Polynomial Factor is NP-Hard Electron. Colloquium Comput. Complex. Irit Dinur, Guy Kindler, Shmuel Safra
1998	A*	`conf`	Approximating-CVP to Within Almost-Polynomial Factors is NP-Hard. FOCS Irit Dinur, Guy Kindler, Shmuel Safra
1998	J	`jnl`	PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability Electron. Colloquium Comput. Complex. Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra