Lunch will be served at 11:45 AM.
The tight connection between Discrete Mathematics and Theoretical Computer Science has been fruitful in the development of both areas in the recent decades. I will describe several examples illustrating this fact.
Noga Alon is a Professor of Mathematics at Princeton University and a Baumritter Professor Emeritus of Mathematics and Computer Science at Tel Aviv University, Israel. 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, Combinatorial Number Theory and Computational Learning.
Prof. Alon is a member of the Israel Academy of Sciences and Humanities and of the Academia Europaea, and an honorary member of the Hungarian Academy of Sciences. He received several awards, two recent ones are the 2022 Shaw Prize in Mathematical Sciences and the 2022 Knuth Prize for outstanding contributions to the foundations of computer science.