Irit Dinur
Impact in
- Computational Theory and Mathematics top 0.2%
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
-
- Computational Geometry and Mesh Generation
Papers in
-
- Complexity and Algorithms in Graphs 57
- Advanced Graph Theory Research 27
- Formal Methods in Verification 9
- Computability, Logic, AI Algorithms 9
-
- Computational Geometry and Mesh Generation 15
- Co-authors
- Kobbi Nissim (1 shared paper)Muli Safra (11 shared papers)David Steurer (4 shared papers)Oded Regev (9 shared papers)Guy Kindler (11 shared papers)Omer Reingold (2 shared papers)Abraham Rudnick (3 shared papers)Eyal Shemesh (3 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
- IsraelUnited StatesIndia
In The Last Decade
Irit Dinur
83 papers receiving 3.1k citations
Irit Dinur's Hit Papers
Peers
Comparison fields: 5 of 124
- Computational Theory and Mathematics 1.7k
- Computer Graphics and Computer-Aided Design 283
- Discrete Mathematics and Combinatorics 200
- Artificial Intelligence 1.4k
- Computer Networks and Communications 670
Countries citing papers authored by Irit Dinur
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
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.
All Works
Showing the 20 most-cited of 86 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Revealing information while preserving privacy Hit paper breakdown → | 2003 | 656 |
| 2 | On the hardness of approximating vertex cover Hit paper breakdown → | 2005 | 411 |
| 3 | 2014 | 230 | |
| 4 | 2004 | 205 | |
| 5 | 2002 | 166 | |
| 6 | 2004 | 132 | |
| 7 | 2001 | 126 | |
| 8 | 2003 | 106 | |
| 9 | 2006 | 85 | |
| 10 | 2005 | 83 | |
| 11 | 2009 | 76 | |
| 12 | 2000 | 69 | |
| 13 | 2023 | 60 | |
| 14 | 2005 | 51 | |
| 15 | 2003 | 50 | |
| 16 | 2009 | 50 | |
| 17 | 2004 | 44 | |
| 18 | 2002 | 42 | |
| 19 | 2006 | 38 | |
| 20 | 2006 | 35 |
About Irit Dinur
Irit Dinur is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Artificial Intelligence, Discrete Mathematics and Combinatorics and Geometry and Topology, having authored 86 papers that have together received 3.3k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (57 papers), Advanced Graph Theory Research (27 papers), Cryptography and Data Security (23 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 (9 papers) and Computability, Logic, AI Algorithms (9 papers). The work is most often cited by research in Computational Theory and Mathematics (1.7k citations), Computer Graphics and Computer-Aided Design (283 citations), Discrete Mathematics and Combinatorics (200 citations), Artificial Intelligence (1.4k citations) and Computer Networks and Communications (670 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, Guy Kindler, Omer Reingold, Abraham Rudnick, Eyal Shemesh, Gad Cotter 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.