World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
32
Citations
6880
World Ranking
12929
National Ranking
199

Mathematics

D-Index
31
Citations
6771
World Ranking
3278
National Ranking
61

Overview

Irit Dinur is affiliated with the Weizmann Institute of Science in Israel. Their research spans multiple areas within computer science and mathematics, with a focus on computational theory and its mathematical foundations.

Their publication record encompasses a range of topics, including complexity theory, machine learning, algorithms, and error correcting codes. Notable recent papers include:

  • Good Quantum LDPC Codes with Linear Time Decoders, 2022, arXiv (Cornell University)
  • Near coverings and cosystolic expansion, 2022, Archiv der Mathematik
  • List-Decoding with Double Samplers, 2021, SIAM Journal on Computing
  • A Characterization of Multiclass Learnability, 2022, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
  • Locally testable codes via high-dimensional expanders, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Their work has appeared most frequently in:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • SIAM Journal on Computing
  • Theory of Computing
  • Oberwolfach Reports

Coauthors commonly collaborating with Irit Dinur include:

  • Prahladh Harsha
  • Yotam Dikstein
  • Yuval Filmus
  • Alexander Lubotzky
  • Tali Kaufman

Dinur's research covers various subfields of study such as:

  • Computational Theory and Mathematics
  • Artificial Intelligence
  • Geometry and Topology
  • Computer Networks and Communications
  • Molecular Biology

Their main fields of study are Computer Science and Mathematics, with emphasis on theoretical aspects.

Primary research topics explored by Dinur include:

  • Complexity and Algorithms in Graphs
  • Machine Learning and Algorithms
  • Error Correcting Code Techniques
  • Graph theory and applications
  • Coding theory and cryptography
  • Computability, Logic, AI Algorithms
  • Formal Methods in Verification

Best Publications

  • Revealing information while preserving privacy

    Irit Dinur;Kobbi Nissim

  • On the hardness of approximating minimum vertex cover

    Irit Dinur;Samuel Safra

  • The PCP theorem by gap amplification

    Irit Dinur

  • Analytical approach to parallel repetition

    Irit Dinur;David Steurer

  • The importance of being biased

    Irit Dinur;Shmuel Safra

  • Approximating CVP to Within Almost-Polynomial Factors is NP-Hard

    I. Dinur;G. Kindler;R. Raz;S. Safra

  • Approximating-CVP to within almost-polynomial factors is NP-hard

    I. Dinur;G. Kindler;S. Safra

  • A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover

    Irit Dinur;Venkatesan Guruswami;Subhash Khot;Oded Regev

  • Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem

    Irit Dinur;Omer Reingold

  • The Hardness of 3-Uniform Hypergraph Coloring

    Irit Dinur;Oded Regev;Clifford Smyth

  • Conditional Hardness for Approximate Coloring

    Irit Dinur;Elchanan Mossel;Oded Regev

  • High Dimensional Expanders Imply Agreement Expanders

    Irit Dinur;Tali Kaufman

  • Towards a proof of the 2-to-1 games conjecture?

    Irit Dinur;Subhash Khot;Guy Kindler;Dor Minzer

  • Graph Products, Fourier Analysis and Spectral Techniques

    N. Alon;I. Dinur;E. Friedgut;B. Sudakov;B. Sudakov

  • On the hardness of approximating label-cover

    Irit Dinur;Shmuel Safra

  • Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover.

    Irit Dinur

  • On the fourier tails of bounded functions over the discrete cube

    Irit Dinur;Ehud Friedgut;Guy Kindler;Ryan O'Donnell

  • On the Fourier tails of bounded functions over the discrete cube

    Irit Dinur;Ehud Friedgut;Guy Kindler;Ryan O’Donnell

  • Approximating SVPinfinity to within almost-polynomial factors is NP-hard

    Unknown

  • Intersecting families are essentially contained in juntas

    Irit Dinur;Ehud Friedgut

  • PCP characterizations of NP: towards a polynomially-small error-probability

    Irit Dinur;Eldar Fischer;Guy Kindler;Ran Raz

Frequent Co-Authors

Oded Regev
Oded Regev Courant Institute of Mathematical Sciences
Subhash Khot
Subhash Khot Courant Institute of Mathematical Sciences
Venkatesan Guruswami
Venkatesan Guruswami University of California, Berkeley
David Steurer
David Steurer ETH Zurich
Madhu Sudan
Madhu Sudan Harvard University
Ran Raz
Ran Raz Princeton University
Thomas Vidick
Thomas Vidick California Institute of Technology
Omer Reingold
Omer Reingold Stanford University
Ryan O'Donnell
Ryan O'Donnell Carnegie Mellon University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For Mathematics graduates looking to expand their expertise, pursuing advanced online degrees can open diverse career opportunities. Programs like dba programs online offer pathways into data-driven business leadership, blending analytical skills with strategic management.

If you are interested in finance, an online masters in finance programs can complement your mathematical background, preparing you for roles in investment analysis, risk management, or quantitative finance.

For professionals aiming to quickly boost their credentials, exploring the shortest online mba degrees allows for accelerated business education that can enhance leadership roles across industries.

Alternatively, a specialization in marketing technology through an ms in digital marketing degree cost usa program can integrate mathematical analytics with digital strategies, targeting careers in market research, digital campaigns, and consumer insights.

Best Scientists Citing Irit Dinur

Trending Scientists