Noga Alon is the Baumritter Professor of Mathematics and Computer Science at Tel Aviv University, in Israel. He serves on the editorial boards of more than a dozen international technical journals and has given invited lectures at many conferences, including plenary addresses at the 1996 European Congress of Mathematics and the 2002 International Congress of Mathematicians. He has published one book and more than five hundred research papers. 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. He is a member of the Israel Academy of Sciences and Humanities and of the Academia Europaea, and received the Erdős Prize, the Feher Prize, the Pólya Prize, the Bruno Memorial Award, the Landau Prize, the Gödel Prize, the Israel Prize, the EMET Prize, and honorary doctorates from ETH Zurich and the University of Waterloo.
- Pseudorandomness, Spring 2017. Visiting Scientist and Workshop Organizer.