Anindya De is an Assistant Professor of Computer Science at Northwestern University. He received his Ph.D. from U. C. Berkeley in 2013 advised by Luca Trevisan and Umesh Vazirani. From 2013 to 2015, he was a postdoc at the Institute for Advanced Study and DIMACS. 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 post-doc at 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 in Mathematics at the University of Bonn and an Assistant Professor of Mathematics at the University of Texas, Austin. He received his Ph.D. 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.