Noga Alon received his Ph.D. in Mathematics at the Hebrew University of Jerusalem under the supervision of Micha Perles. He is a Baumritter Professor of Mathematics and Computer Science at Tel Aviv University, and visits frequently the Institute for Advanced Study in Princeton. He works in Combinatorics, Graph Theory and their applications in Theoretical Computer Science, focusing on combinatorial algorithms, combinatorial geometry, combinatorial number theory, algebraic and probabilistic methods in Combinatorics, and has also been working on Circuit Complexity, Streaming algorithms, and topological methods in Combinatorics. He is a member of the Israel National Academy of Sciences and of Academia Europaea, and received several awards including the Pólya Prize, the Gödel Prize, the Israel Prize, and the EMET Prize. He is married to Nurit and has three daughters. More details can be found at Noga Alon's Home Page.

Shachar Lovett received his Ph.D. from the Weizmann Institute of Science in 2010 under the supervision of Omer Reingold and Ran Raz. He was a member in the Institute for Advanced Study School of Mathematics between 2010 and 2012. He is now an assistant professor in University of California San Diego School of Computer Science and Engineering. He works in Theoretical Computer Science with special emphasis on Computational Complexity, Coding theory, Randomness and Pseudo-randomness, Algebraic techniques and applications of Additive Combinatorics. He is married to Iris and has one daughter and one son. More details can be found at Shachar Lovett's Home Page.