Prahladh Harsha is a reader at the Tata Institute of Fundamental Research, Mumbai, India. He obtained his Ph.D. from MIT under the supervision of Madhu Sudan. Prahladh's research interests include complexity theory, probabilistically checkable proofs, and communication complexity.

Adam Klivans is an Associate Professor of Computer Science at the University of Texas at Austin. His interests are in learning theory and its relationship with computational complexity. He is frequently confused with Adam Kalai.

Raghu Meka is a researcher at Microsoft Research, Silicon Valley, Mountain View. He received his Ph.D. from the University of Texas at Austin in 2011 under the supervision of David Zuckerman. His main interests are in complexity theory, pseudo-randomness, algorithm design, learning theory and more generally in anything to do with probability.