World's Best Scientists 2026 revealed!
Award Badge
Computer Science
Israel
2026
Award Badge
Mathematics
Israel
2026

D-Index & Metrics

Computer Science

D-Index
122
Citations
57103
World Ranking
140
National Ranking
2

Mathematics

D-Index
122
Citations
56952
World Ranking
12
National Ranking
1

Research.com Recognitions

  • 2026 - Research.com Computer Science in Israel Leader Award
  • 2026 - Research.com Mathematics in Israel Leader Award
  • 2025 - Research.com Computer Science in Israel Leader Award
  • 2025 - Research.com Mathematics in Israel Leader Award
  • 2023 - Research.com Computer Science in Israel Leader Award
  • 2023 - Research.com Mathematics in Israel Leader Award
  • 2022 - Research.com Computer Science in Israel Leader Award
  • 2021 - Steele Prize for Mathematical Exposition
  • 2019 - ACM Paris Kanellakis Theory and Practice Award For seminal work on the foundations of streaming algorithms and their application to large scale data analytics.
  • 2016 - Fellow of the American Mathematical Society For contributions to combinatorics, theoretical computer science, combinatorial geometry, information theory, and related areas.
  • 2016 - ACM Fellow For contributions in the study of expander graphs, derandomization and streaming algorithms.
  • 2008 - Member of Academia Europaea
  • 2000 - George Pólya Prize

Overview

Noga Alon is affiliated with Tel Aviv University in Israel. Their research spans several main fields including Computer Science and Mathematics, with a significant focus on areas such as Computational Theory and Mathematics, and Discrete Mathematics and Combinatorics. Additional subfields of study include Artificial Intelligence, Geometry and Topology, and Molecular Biology.

Their work covers an array of topics centered chiefly on graph theory and its applications. Key research themes include:

  • Limits and Structures in Graph Theory
  • Advanced Graph Theory Research
  • Graph theory and applications
  • Complexity and Algorithms in Graphs
  • Graph theory and CDMA systems
  • Graph Labeling and Dimension Problems
  • Machine Learning and Algorithms

Among Noga Alon's recent papers are:

  • "Turán graphs with bounded matching number," 2023, Journal of Combinatorial Theory Series B
  • "Divisible subdivisions," 2021, Journal of Graph Theory
  • "Typical and extremal aspects of friends-and-strangers graphs," 2022, Journal of Combinatorial Theory Series B
  • "Palette Sparsification Beyond (Δ+1) Vertex Coloring," 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Asymmetric List Sizes in Bipartite Graphs," 2021, Radboud Repository (Radboud University)

Noga Alon has collaborated frequently with several co-authors, including:

  • Noah Kravitz
  • Matija Bucić
  • Michael Krivelevich
  • Colin Defant
  • Shay Moran

Their publications appear notably in venues such as:

  • arXiv (Cornell University)
  • SIAM Journal on Discrete Mathematics
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Journal of Graph Theory
  • Israel Journal of Mathematics

A number of awards and recognitions have been conferred on Noga Alon, including:

  • Steele Prize for Mathematical Exposition (2021)
  • ACM Paris Kanellakis Theory and Practice Award (2019) for seminal work on the foundations of streaming algorithms and their application to large scale data analytics
  • Fellow of the American Mathematical Society (2016) for contributions to combinatorics, theoretical computer science, combinatorial geometry, information theory, and related areas
  • ACM Fellow (2016) for work in the study of expander graphs, derandomization and streaming algorithms
  • Member of Academia Europaea (2008)
  • George Pólya Prize (2000)

Best Publications

  • The Space Complexity of Approximating the Frequency Moments

    Noga Alon;Yossi Matias;Mario Szegedy

  • The space complexity of approximating the frequency moments

    Noga Alon;Yossi Matias;Mario Szegedy

  • Eigen values and expanders

    N Alon;N Alon

  • Color-coding

    Noga Alon;Raphael Yuster;Uri Zwick

  • λ1, Isoperimetric inequalities for graphs, and superconcentrators

    Noga Mordechai Alon;V. D. Milman

  • The Probabilistic Method: Alon/Probabilistic Method

    Noga Alon;Joel H. Spencer

  • A fast and simple randomized parallel algorithm for the maximal independent set problem

    Noga Alon;Noga Alon;Laszlo Babai;Laszlo Babai;Alon Itai;Alon Itai

  • Combinatorial Nullstellensatz

    Noga Alon

  • Simple Constructions of Almost k-wise Independent Random Variables

    Noga Alon;Oded Goldreich;Johan Håstad;René Peralta

  • The Probabilistic Method: Alon/Probabilistic

    Noga Alon;Joel H. Spencer

  • Finding and counting given length cycles

    Noga Alon;Raphael Yuster;Uri Zwick

  • Colorings and orientations of graphs

    Noga Mordechai Alon;M. Tarsi

  • Scale-sensitive dimensions, uniform convergence, and learnability

    Noga Alon;Shai Ben-David;Nicolò Cesa-Bianchi;David Haussler

  • Finding a large hidden clique in a random graph

    Noga Alon;Michael Krivelevich;Benny Sudakov

  • Efficient Testing of Large Graphs

    Noga Alon;Eldar Fischer;Michael Krivelevich;Mario Szegedy

  • The monotone circuit complexity of Boolean functions

    N. Alon;N. Alon;R. B. Boppana

  • Explicit construction of linear sized tolerant networks

    N. Alon;F. R. K. Chung

  • A lower bound for radio broadcast

    Noga Alon;Noga Alon;Amotz Bar-Noy;Nathan Linial;Nathan Linial;David Peleg

  • A Graph-Theoretic Game and its Application to the $k$-Server Problem

    Noga Alon;Richard M. Karp;David Peleg;Douglas West

  • The algorithmic aspects of the regularity lemma

    N. Alon;R. A. Duke;H. Lefmann;V. Rödl

  • Finding a large hidden clique in a random graph

    Noga Alon;Michael Krivelevich;Benny Sudakov

Frequent Co-Authors

Benny Sudakov
Benny Sudakov ETH Zurich
Michael Krivelevich
Michael Krivelevich Tel Aviv University
Yossi Azar
Yossi Azar Tel Aviv University
Raphael Yuster
Raphael Yuster University of Haifa
Moshe Tennenholtz
Moshe Tennenholtz Technion – Israel Institute of Technology
Eyal Lubetzky
Eyal Lubetzky Courant Institute of Mathematical Sciences
Joel Spencer
Joel Spencer Courant Institute of Mathematical Sciences
Michal Feldman
Michal Feldman Tel Aviv University
Alexandr V. Kostochka
Alexandr V. Kostochka University of Illinois at Urbana-Champaign

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

Pursuing a degree in Mathematics opens doors to various interdisciplinary career options. Many students complement their math skills with business-focused programs to enhance their career prospects. For those interested in finance, exploring the cheapest online masters in finance can be a strategic way to combine quantitative skills with financial expertise.

Additionally, professionals looking to fast-track their careers might consider accelerated online MBA programs. These programs provide a flexible and time-efficient path to gain managerial and leadership skills, essential for math graduates pursuing upper management roles.

For those with an interest in market analysis and strategic decision-making, enrolling in marketing graduate programs offers a solid foundation in consumer behavior and digital marketing, complementing analytical skills with creativity.

Finally, many students opt for 1 year MBA programs in USA to quickly enhance their qualifications and access broader career opportunities. Such focused programs are ideal for math graduates aiming to integrate technical expertise with strong business acumen.

Best Scientists Citing Noga Alon

Trending Scientists

Recently Published Articles