Uriel Feige is a professor at the Weizmann Institute, though this work was done while he was a member of the theory group at Microsoft Research. His main research interests involve studying the borderline between P and NP as it manifests itself in approximation algorithms, heuristics, and exact algorithms that are not necessarily polynomial time.

Elchanan Mossel is a Professor of Statistics and Computer Science at U.C. Berkeley. He received his Ph.D. in mathematics from Hebrew University in 2000. 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 here 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.

Dan Vilenchik graduated from Tel Aviv University in 2009; his advisor was Michael Krivelevich. His thesis focused on average-case analysis of optimization problem, in particular $k$-colorability and $k$-SAT. His interests include average-case analysis and combinational optimization.