2022 - Research.com Computer Science in Israel Leader Award
2022 - Research.com Mathematics 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
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 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.
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.
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.
The Space Complexity of Approximating the Frequency Moments
Noga Alon;Yossi Matias;Mario Szegedy.
Journal of Computer and System Sciences (1999)
Eigen values and expanders
N Alon;N Alon.
Combinatorica (1986)
Color-coding
Noga Alon;Raphael Yuster;Uri Zwick.
Journal of the ACM (1995)
λ1, Isoperimetric inequalities for graphs, and superconcentrators
Noga Mordechai Alon;V. D. Milman.
Journal of Combinatorial Theory, Series B (1985)
The Probabilistic Method: Alon/Probabilistic Method
Noga Alon;Joel H. Spencer.
(2004)
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)
Combinatorial Nullstellensatz
Noga Alon.
Combinatorics, Probability and Computing archive (1999)
Simple Constructions of Almost k‐wise Independent Random Variables
Noga Alon;Oded Goldreich;Johan Håstad;René Peralta.
Random Structures and Algorithms (1992)
The Probabilistic Method: Alon/Probabilistic
Noga Alon;Joel H. Spencer.
(2008)
Finding and Counting Given Length Cycles
Noga Alon;Raphael Yuster;Uri Zwick.
Algorithmica (1997)
If you think any of the details on this page are incorrect, let us know.
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:
ETH Zurich
Tel Aviv University
Tel Aviv University
University of Haifa
Technion – Israel Institute of Technology
New York University
University of Illinois at Urbana-Champaign
Tel Aviv University
Rutgers, The State University of New Jersey
CentraleSupélec
Sapienza University of Rome
Missouri University of Science and Technology
General Electric (United States)
University of Lyon System
Aarhus University
Inserm : Institut national de la santé et de la recherche médicale
Martin Luther University Halle-Wittenberg
University of Georgia
University of Washington
The University of Texas at Austin
Cedars-Sinai Medical Center
Erasmus University Rotterdam
World Bank
Stanford University
Utrecht University