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.

Ryan O'Donnell received a B.Sc. from the University of Toronto in 1999 and a Ph.D. from the MIT Mathematics Department in 2003. His Ph.D. advisor was Madhu Sudan. Following this he was a postdoc at IAS for a year in Avi Wigderson's group, and a postdoc at Microsoft Research for two years in Jennifer Chayes's group. Since 2006 he has been an assistant professor in the Computer Science Department at Carnegie Mellon University. Ryan's research interests include Analysis of Boolean Functions, Constraint Satisfaction Problems, Quantum Complexity, and Probability. He enjoys his spare time.

Rocco Servedio is a professor in the Department of Computer Science at Columbia University. He graduated from Harvard University, where his Ph.D. was supervised by Les Valiant. He is interested in computational complexity theory, computational learning theory, randomness in computing, property testing, and other topics.