Noga Alon is a Professor of Mathematics at Princeton University and a Professor Emeritus 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 held visiting positions in various research institutions, including MIT, the Institute for Advanced Study in Princeton and Microsoft Research Redmond and Herzliya.

He is an ACM Fellow and an AMS Fellow, a member of the Israel Academy of Sciences and Humanities, of the Academia Europaea and of the Hungarian Academy of Sciences, 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, the Dijkstra Prize and the Nerode 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.

Elchanan Mossel is a professor of mathematics at the Massachusetts Institute of Technology. His primary research fields are probability theory, combinatorics, and statistical inference. He received his Ph.D. in Mathematics at the Hebrew University of Jerusalem in 2000. He held a postdoctoral position at Microsoft Research, Redmond, and was a Miller Research Fellow at UC Berkeley before becoming a Professor at UC Berkeley, the Weizmann Institute, the University of Pennsylvania and finally MIT.

Mossel's research spans a number of topics across mathematics, statistics, economics, and computer science, including combinatorial statistics, discrete function inequalities, isoperimetry, game theory, social choice, computational complexity, and computational evolutionary biology.

Mossel held a Sloan Fellowship. He is a fellow of the American Mathematical Society and a Simons Fellow.

Robin Pemantle grew up in Berkeley in the 1960s and 70s. He became interested in probability theory when Persi Diaconis, a mathematician and former magician, visited M.I.T. He was supposed to be working on a dissertation in another subject, but found himself working mostly on problems he heard from Persi. During a year off traveling in the South Pacific, he ended up working on probability theory in various youth hostels and on boats. Pemantle got his Ph.D. in 1988, spent three years on post-doctoral fellowships at Berkeley, Cornell, and Oregon State, most of the 1990s at UW-Madison, three years at Ohio State, and is now at Penn.

Pemantle's research focuses on two areas. Within Probability Theory, the research concerns discrete probability models, including random graph theory, processes with reinforcement, statistical models and random walks. The other research area, analytic combinatorics, is the subject of a textbook with Mark C. Wilson (2013).

Pemantle has also been interested in Mathematics Education from an early age, growing up with an insider's view of an alternative school, and teaching mathematics to grades 5-8 during his college years and before.

Pemantle has held a Sloan Fellowship, a Presidential Faculty Fellowship, the Rollo Davidson Prize, and a Lilly Teaching Fellowship. He was a top five finisher in the Putnam Competition and is a Simons Fellow, a fellow of the American Mathematical Society and a fellow of the Institute for Mathematical Statistics.