Irit Dinur

5.0k citations

80 papers · 2.6k indexed · 1 hit paper · h-index 23

Impact in

Computational Theory and Mathematics top 0.2%
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
Computer Graphics and Computer-Aided Design top 1%
- Computational Geometry and Mesh Generation

Papers in ⓘ

Computational Theory and Mathematics 65
- Complexity and Algorithms in Graphs 49
- Advanced Graph Theory Research 25
- Formal Methods in Verification 8
- Computability, Logic, AI Algorithms 8
Artificial Intelligence 39
- Cryptography and Data Security 17
- Machine Learning and Algorithms 12

Co-authors: Kobbi Nissim (1 shared paper)Muli Safra (11 shared papers)David Steurer (4 shared papers)Oded Regev (6 shared papers)Eyal Shemesh (3 shared papers)Gad Cotter (3 shared papers)Abraham Rudnick (3 shared papers)Guy Kindler (12 shared papers)
Journals: SIAM Journal on Computing (6 papers)Computational Complexity (4 papers)COMBINATORICA (3 papers)Israel Journal of Mathematics (3 papers)Theory of Computing (2 papers)
Partner nations: Israel United States India

In The Last Decade

Irit Dinur

77 papers receiving 2.4k citations

Hit Papers

align trajectories log scale

Revealing information while preserving privacy 2003 · 546 citations

Peers

Countries citing papers authored by Irit Dinur

Since Specialization

Citations

This map shows the geographic impact of Irit Dinur's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Irit Dinur with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Irit Dinur more than expected).

Fields of papers citing papers by Irit Dinur

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Irit Dinur. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Irit Dinur. The network helps show where Irit Dinur may publish in the future.

Co-authors

The 25 scholars most cited alongside Irit Dinur, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Irit Dinur Line = papers co-authored together Irit Dinur links everyone, so they are left out of the graph.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Showing the 20 most-cited of 80 papers — load more, or switch the sort, to bring in the rest.

#	Work
1	Revealing information while preserving privacy Irit Dinur, Kobbi Nissim Hit paper breakdown →	2003	546
2	On the hardness of approximating vertex cover Annals of Mathematics ·Irit Dinur, Samuel Safra	2005	321
3	Posttraumatic Stress, Nonadherence, and Adverse Outcome in Survivors of a Myocardial Infarction Psychosomatic Medicine ·Eyal Shemesh, Rachel Yehuda, Olga Milo, Irit Dinur, Abraham Rudnick, Zvi Vered, Gad Cotter	2004	182
4	Analytical approach to parallel repetition Irit Dinur, David Steurer	2014	150
5	Lack of aspirin effect: aspirin resistance or resistance to taking aspirin? American Heart Journal ·Gad Cotter, Eyal Shemesh, Miriam Zehavi, Irit Dinur, Abraham Rudnick, Olga Milo, Zvi Vered, Rikardo Krakover, Edo Kaluski, Abraham Kornberg	2004	121
6	The importance of being biased Irit Dinur, Muli Safra	2002	120
7	A prospective study of posttraumatic stress symptoms and nonadherence in survivors of a myocardial infarction (MI) General Hospital Psychiatry ·Eyal Shemesh, Abraham Rudnick, Edo Kaluski, Olga Milovanov, Ahmed Salah, Daniela Alon, Irit Dinur, Alex Blatt, Mikael Metzkor, Ahuva Golik, Zvi Verd, Gad Cotter	2001	115
8	Approximating CVP to Within Almost-Polynomial Factors is NP-Hard COMBINATORICA ·Irit Dinur, Guy Kindler, Ran Raz, Muli Safra	2003	75
9	Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem SIAM Journal on Computing ·Irit Dinur, Omer Reingold	2006	68
10	A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover SIAM Journal on Computing ·Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev	2005	62
11	Conditional Hardness for Approximate Coloring SIAM Journal on Computing ·Irit Dinur, Elchanan Mossel, Oded Regev	2009	52
12	Good Quantum LDPC Codes with Linear Time Decoders Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, Thomas Vidick	2023	48
13	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Lecture notes in computer science ·Irit Dinur, (unknown)	2009	44
14	A new multilayered PCP and the hardness of hypergraph vertex cover Irit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev	2003	42
15	Graph Products, Fourier Analysis and Spectral Techniques Geometric and Functional Analysis ·Noga Alon, Irit Dinur, Ehud Friedgut, Benny Sudakov	2004	41
16	The Hardness of 3-Uniform Hypergraph Coloring COMBINATORICA ·Irit Dinur, Oded Regev, Clifford Smyth	2005	38
17	Conditional hardness for approximate coloring Irit Dinur, Elchanan Mossel, Oded Regev	2006	35
18	Breast cancer in the elderly: Histological, hormonal and surgical characteristics The Breast ·Itzhak Pappo, Tamar Karni, Judith Sandbank, Irit Dinur, A. Sella, Varda Stahl-Kent, Ilan Wasserman, Ariel Halevy	2007	32
19	Approximating-CVP to within almost-polynomial factors is NP-hard Irit Dinur, Guy Kindler, Muli Safra	2002	30
20	Intersecting Families are Essentially Contained in Juntas Combinatorics Probability Computing ·Irit Dinur, Ehud Friedgut	2008	26

About Irit Dinur

Irit Dinur is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Graphics and Computer-Aided Design, Discrete Mathematics and Combinatorics and Computer Networks and Communications, having authored 80 papers that have together received 2.6k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (49 papers), Advanced Graph Theory Research (25 papers), Cryptography and Data Security (17 papers), Computational Geometry and Mesh Generation (15 papers), Machine Learning and Algorithms (12 papers), Limits and Structures in Graph Theory (11 papers), Formal Methods in Verification (8 papers) and Computability, Logic, AI Algorithms (8 papers). The work is most often cited by research in Computational Theory and Mathematics (1.2k citations), Computer Graphics and Computer-Aided Design (207 citations), Discrete Mathematics and Combinatorics (168 citations), Artificial Intelligence (1.1k citations) and Computer Networks and Communications (493 citations). Irit Dinur has collaborated with scholars based in Israel, United States and India. Frequent co-authors include Kobbi Nissim, Muli Safra, David Steurer, Oded Regev, Eyal Shemesh, Gad Cotter, Abraham Rudnick, Guy Kindler, Omer Reingold and Ehud Friedgut. Their work appears in journals such as SIAM Journal on Computing, Computational Complexity, COMBINATORICA, Israel Journal of Mathematics and Theory of Computing.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact