Noga Alon is a Professor of Mathematics at Princeton University and a Baumritter Emeritus Professor of Mathematics and Computer Science at Tel Aviv University, Israel. He received his Ph.D. in Mathematics at the Hebrew University of Jerusalem in 1983 and had visiting positions in various research institutes including MIT, the Institute for Advanced Study in Princeton and Microsoft Research.
He is an ACM Fellow and an AMS Fellow, a member of the Israel Academy of Sciences and Humanities and of the Academia Europaea, and received the Erdos Prize, the Feher Prize, the Polya Prize, the Bruno Memorial Award, the Landau Prize, the Goedel Prize, the Israel Prize, the EMET Prize and the Dijkstra Prize.
His research interests are mainly in Combinatorics, Graph Theory and their applications in Theoretical Computer Science. His main contributions include the study of expander graphs and their applications, the investigation of derandomization techniques, the foundation of streaming algorithms, the development and applications of algebraic and probabilistic methods in Discrete Mathematics and the study of problems in Information Theory, Combinatorial Geometry and Combinatorial Number Theory.