Irit Dinur

Q: What Schools Are Affiliated With Irit Dinur

Irit Dinur is affiliated with the following schools: Weizmann Institute of Science, Tel Aviv University

Irit Dinur's AcademicInfluence.com Rankings

Irit Dinur

Mathematics

#1961

World Rank

#3109

Historical Rank

Measure Theory

#3255

World Rank

#3848

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Irit Dinur Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Irit Dinur is an Israeli computer scientist. She is professor of computer science at the Weizmann Institute of Science. Her research is in foundations of computer science and in combinatorics, and especially in probabilistically checkable proofs and hardness of approximation.

(See a Problem?)

Irit Dinur's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Revealing information while preserving privacy (2003) (1067)
On the hardness of approximating minimum vertex cover (2005) (642)
Analytical approach to parallel repetition (2013) (421)
The PCP theorem by gap amplification (2006) (409)
The importance of being biased (2002) (236)
Approximating CVP to Within Almost-Polynomial Factors is NP-Hard (2003) (235)
A new multilayered PCP and the hardness of hypergraph vertex cover (2003) (187)
Assignment testers: towards a combinatorial proof of the PCP-theorem (2004) (176)
Conditional hardness for approximate coloring (2005) (162)
The PCP theorem by gap amplification (2007) (153)
High Dimensional Expanders Imply Agreement Expanders (2017) (100)
The Hardness of 3-Uniform Hypergraph Coloring (2002) (96)
Graph Products, Fourier Analysis and Spectral Techniques (2004) (89)
Towards a proof of the 2-to-1 games conjecture? (2018) (78)
Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover (2016) (75)
On the Fourier tails of bounded functions over the discrete cube (2006) (70)
On the hardness of approximating label-cover (2004) (68)
Approximating SVPinfinity to within almost-polynomial factors is NP-hard (1998) (66)
On non-optimally expanding sets in Grassmann graphs (2018) (64)
PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability (1999) (63)
Intersecting Families are Essentially Contained in Juntas (2009) (62)
Robust Local Testability of Tensor Products of LDPC Codes (2006) (56)
Composition of Low-Error 2-Query PCPs Using Decodable PCPs (2009) (56)
A parallel repetition theorem for entangled projection games (2013) (52)
Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity (2016) (43)
Locally testable codes with constant rate, distance, and locality (2021) (39)
Independent Sets in Graph Powers are Almost Contained in Juntas (2008) (36)
Boolean function analysis on high-dimensional expanders (2018) (32)
Vertex Cover on k-Uniform Hypergraphs is Hard to Approximate within Factor (k-3-epsilon) (2002) (31)
Locally Testing Direct Product in the Low Error Range (2008) (30)
Agreement Testing Theorems on Layered Set Systems (2019) (30)
Direct Sum Testing (2015) (29)
List Decoding with Double Samplers (2018) (28)
PCPs via the low-degree long code and hardness for constrained hypergraph coloring (2013) (27)
Direct Product Testing (2014) (27)
ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network (2018) (25)
Derandomized Parallel Repetition via Structured PCPs (2010) (24)
On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors (2010) (22)
Hardness of Finding Independent Sets in Almost q-Colorable Graphs (2010) (20)
Decodability of group homomorphisms beyond the johnson bound (2008) (18)
Good Quantum LDPC Codes with Linear Time Decoders (2022) (17)
Explicit SoS lower bounds from high-dimensional expanders (2020) (17)
Locally testable codes via high-dimensional expanders (2020) (16)
Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition (2015) (15)
Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract] (2019) (15)
A Characterization of Multiclass Learnability (2022) (15)
Every set in P is strongly testable under a suitable encoding (2018) (11)
Multiplayer parallel repetition for expander games (2016) (11)
Dense Locally Testable Codes Cannot Have Constant Rate and Distance (2010) (10)
Exponentially Small Soundness for the Direct Product Z-test (2017) (9)
Low degree almost Boolean functions are sparse juntas (2017) (7)
Covering CSPs (2013) (7)
The Computational Benefit of Correlated Instances (2015) (7)
Cube vs. Cube Low Degree Test (2016) (7)
Proof of an Intersection Theorem via Graph Homomorphisms (2006) (7)
Boolean functions on high-dimensional expanders (2018) (5)
Near Coverings and Cosystolic Expansion - an example of topological property testing (2019) (4)
The Structure of Winning Strategies in Parallel Repetition Games (2010) (3)
PCPs with small soundness error (2008) (3)
Intersecting Families , Independent Sets and Coloring of Certain Graph Products (2009) (3)
Agreement tests on graphs and hypergraphs (2017) (2)
Direct Sum Testing: The General Case (2019) (2)
Probabilistically Checkable Proofs and Codes (2011) (2)
Derandomized Graph Product Results Using the Low Degree Long Code (2014) (2)
From Local to Robust Testing via Agreement Testing (2018) (2)
Proceedings of the Annual IEEE Conference on Computational Complexity: Preface (2005) (1)
Locally Testing Direct Products in the High Error Range (2008) (1)
Bipartite unique-neighbour expanders via Ramanujan graphs (2023) (1)
A pr 2 01 8 Boolean function analysis on high-dimensional expanders (2018) (1)
Near coverings and cosystolic expansion (2022) (1)
Privacy in public databases: A foundational approach (2005) (1)
PCPs via the low-degree long code and hardness for constrained hypergraph coloring (2015) (1)
Special Issue “Conference on Computational Complexity 2012” Guest editors’ foreword (2013) (0)
Lecture 1: Expanders and high dimensional expanders (2022) (0)
Clustering in the Boolean Hypercube in a List Decoding Regime (2013) (0)
Coboundary and cosystolic expansion without dependence on dimension or degree (2023) (0)
Pcp Verifiers (2007) (0)
Lecture 2: Trickle down theorem, and random walks on HDX (2022) (0)
Error-correcting Codes 1.1 Introduction (2006) (0)
RS & A 2007 Plenary Talks Local consistency in direct products (0)
Special Issue “Conference on Computational Complexity 2012” Guest editors’ foreword (2013) (0)
Complexity Column : PCPs with Small Soundness Error (2008) (0)
On non-optimally expanding sets in Grassmann graphs (2021) (0)
Explicit and structured sum of squares lower bounds from high dimensional expanders (2020) (0)
Special Issue on Foundations of Computer Science (2008) (0)
Lecture 4: Cohomological expansion (2022) (0)
Local Testability of Reed-Solomon Code (2005) (0)
Lecture 5: Cosystolic expansion and property testing (2022) (0)
Open questions in parallel repetition of games and PCPs (2014) (0)
Hardness Of Approximation Lecture 8 : Direct Product testing (2019) (0)
Complexity Theory (2019) (0)
Expanders in Higher Dimensions (Invited Talk) (2022) (0)
Lecture 3: Random walks on HDX (2022) (0)
Special Section on the Fifty-Seventh Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016) (2019) (0)
An Improved Lower Bound for Ap-proximating CVP (2000) (0)
Good Locally Testable Codes (2022) (0)
Testing tensor products (2019) (0)

This paper list is powered by the following services:

Other Resources About Irit Dinur

en.wikipedia.org

What Schools Are Affiliated With Irit Dinur?

Irit Dinur is affiliated with the following schools:

Irit Dinur's Academic­Influence.com Rankings