H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Mathematics H-index 113 Citations 51,446 669 World Ranking 2 National Ranking 1
Computer Science H-index 115 Citations 52,521 665 World Ranking 69 National Ranking 1

Research.com Recognitions

Awards & Achievements

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 - ACM Fellow For contributions in the study of expander graphs, derandomization and streaming algorithms.

2016 - Fellow of the American Mathematical Society For contributions to combinatorics, theoretical computer science, combinatorial geometry, information theory, and related areas.

2008 - Member of Academia Europaea

2000 - George Pólya Prize

Overview

What is she best known for?

The fields of study she is best known for:

  • Combinatorics
  • Discrete mathematics
  • Algebra

Noga Alon mainly focuses on Combinatorics, Discrete mathematics, Graph, Upper and lower bounds and Graph theory. Combinatorics is a component of her Vertex, Randomized algorithm, Integer, Binary logarithm and Graph power studies. In her research on the topic of Binary logarithm, Parallel algorithm, Pairwise independence, Maximal independent set and Family of sets is strongly related with Deterministic algorithm.

Her Discrete mathematics and Conjecture, Bipartite graph, Independent set, Random graph and Complement graph investigations all form part of her Discrete mathematics research activities. Her Upper and lower bounds research includes elements of Matching, Absolute value, Broadcasting and Boolean function. Her Expander mixing lemma study incorporates themes from Efficient algorithm, Eigenvalues and eigenvectors and Ramanujan graph.

Her most cited work include:

  • Eigen values and expanders (1010 citations)
  • Eigen values and expanders (1010 citations)
  • The Space Complexity of Approximating the Frequency Moments (980 citations)

What are the main themes of her work throughout her whole career to date?

Her main research concerns Combinatorics, Discrete mathematics, Graph, Upper and lower bounds and Conjecture. Her is involved in several facets of Combinatorics study, as is seen by her studies on Vertex, Binary logarithm, Bipartite graph, Degree and Graph power. Noga Alon studies Graph power, focusing on Bound graph in particular.

The study incorporates disciplines such as Graph theory and Set in addition to Discrete mathematics. Her research on Complement graph frequently links to adjacent areas such as Null graph.

She most often published in these fields:

  • Combinatorics (97.86%)
  • Discrete mathematics (62.67%)
  • Graph (19.43%)

What were the highlights of her more recent work (between 2014-2021)?

  • Combinatorics (97.86%)
  • Discrete mathematics (62.67%)
  • Graph (19.43%)

In recent papers she was focusing on the following fields of study:

Her primary areas of study are Combinatorics, Discrete mathematics, Graph, Upper and lower bounds and Random graph. Her research links Bounded function with Combinatorics. Her Discrete mathematics study combines topics from a wide range of disciplines, such as Function and Degree.

Her study in the field of Induced subgraph, Complete bipartite graph and Vertex is also linked to topics like Omega. As a part of the same scientific study, Noga Alon usually deals with the Upper and lower bounds, concentrating on VC dimension and frequently concerns with Moment curve, Rank and Sign. Her Random graph research is multidisciplinary, incorporating perspectives in Binary logarithm, Theta function, Diagonal and Linear algebra.

Between 2014 and 2021, her most popular works were:

  • Many T copies in H-free graphs (125 citations)
  • Many T copies in H-free graphs (125 citations)
  • Online Learning with Feedback Graphs: Beyond Bandits (41 citations)

In her most recent research, the most cited papers focused on:

  • Combinatorics
  • Algebra
  • Discrete mathematics

Noga Alon mostly deals with Combinatorics, Discrete mathematics, Graph, Upper and lower bounds and Random graph. Her study brings together the fields of Bounded function and Combinatorics. Noga Alon has included themes like Function and Asymptotically optimal algorithm in her Discrete mathematics study.

Noga Alon combines subjects such as Symmetrization and Directed graph with her study of Graph. The Upper and lower bounds study combines topics in areas such as Moment curve, Quadratic equation, Sign and Rank. Her Random graph study combines topics in areas such as Binary logarithm, Crowds, Complete graph and Wisdom of the crowd.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

The Space Complexity of Approximating the Frequency Moments

Noga Alon;Yossi Matias;Mario Szegedy.
Journal of Computer and System Sciences (1999)

2024 Citations

Eigen values and expanders

N Alon;N Alon.
Combinatorica (1986)

1473 Citations

Color-coding

Noga Alon;Raphael Yuster;Uri Zwick.
Journal of the ACM (1995)

1043 Citations

λ1, Isoperimetric inequalities for graphs, and superconcentrators

Noga Mordechai Alon;V. D. Milman.
Journal of Combinatorial Theory, Series B (1985)

1011 Citations

The Probabilistic Method: Alon/Probabilistic Method

Noga Alon;Joel H. Spencer.
(2004)

1000 Citations

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.
Journal of Algorithms (1985)

820 Citations

Combinatorial Nullstellensatz

Noga Alon.
Combinatorics, Probability and Computing archive (1999)

737 Citations

Simple Constructions of Almost k‐wise Independent Random Variables

Noga Alon;Oded Goldreich;Johan Håstad;René Peralta.
Random Structures and Algorithms (1992)

722 Citations

The Probabilistic Method: Alon/Probabilistic

Noga Alon;Joel H. Spencer.
(2008)

596 Citations

Finding and Counting Given Length Cycles

Noga Alon;Raphael Yuster;Uri Zwick.
Algorithmica (1997)

573 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

Top Scientists Citing Noga Alon

Benny Sudakov

Benny Sudakov

ETH Zurich

Publications: 239

Michael Krivelevich

Michael Krivelevich

Tel Aviv University

Publications: 124

Saket Saurabh

Saket Saurabh

University of Bergen

Publications: 115

Jacob Fox

Jacob Fox

Stanford University

Publications: 110

Fedor V. Fomin

Fedor V. Fomin

University of Bergen

Publications: 99

János Pach

János Pach

Alfréd Rényi Institute of Mathematics

Publications: 98

David P. Woodruff

David P. Woodruff

Carnegie Mellon University

Publications: 91

Yoshiharu Kohayakawa

Yoshiharu Kohayakawa

Universidade de São Paulo

Publications: 88

Oded Goldreich

Oded Goldreich

Weizmann Institute of Science

Publications: 87

Dana Ron

Dana Ron

Tel Aviv University

Publications: 85

József Balogh

József Balogh

University of Illinois at Urbana-Champaign

Publications: 84

Avi Wigderson

Avi Wigderson

Institute for Advanced Study

Publications: 83

Raphael Yuster

Raphael Yuster

University of Haifa

Publications: 83

Anders Yeo

Anders Yeo

University of Johannesburg

Publications: 81

Daniel Lokshtanov

Daniel Lokshtanov

University of California, Santa Barbara

Publications: 77

Something went wrong. Please try again later.