Anindya De is an assistant professor of computer science at the University of Pennsylvania. He received his Ph.D. from U.C. Berkeley in 2013, advised by Luca Trevisan. He was a postdoc at the Institute for Advanced Study and DIMACS from 2013 to 2015 and an assistant professor at Northwestern University from 2015 to 2018. His research interests are in complexity theory, learning theory, discrete analysis and applied probability.

Elchanan Mossel is a professor of mathematics at MIT. He received his Ph.D. in mathematics from Hebrew University in 2000, advised by Yuval Peres. After his Ph.D., he was a postdoc in the Theory Group of Microsoft Research, Redmond, and a Miller fellow in Statistics and Computer Science at U.C. Berkeley. His research interests include combinatorial statistics, discrete Fourier analysis and influences, randomized algorithms, computational complexity, MCMC, Markov random fields, social choice, game theory and evolution.

Joe Neeman is a professor of mathematics at the University of Bonn and an assistant professor of mathematics at the University of Texas, Austin. He received his Ph.D. in 2013 from U.C. Berkeley, advised by Elchanan Mossel, after which he was a postdoc at U.T. Austin. He works in various areas of probability and on applications to computer science.