Irit Dinur is a professor at the Weizmann Institute of Science. She received her Ph.D. in 2001 from Tel Aviv University under the supervision of Shmuel Safra. She is interested broadly in theoretical computer science and mathematics, and more specifically in complexity theory, probabilistically checkable proofs, hardness of approximation, and most recently in the growing area of high-dimensional expansion. She has a wife and three kids.

Prahladh Harsha is a theoretical computer scientist at the Tata Institute of Fundamental Research (TIFR). He received his B.Tech. degree in Computer Science and Engineering from the IIT Madras in 1998 and his S.M. and Ph.D. degrees in Computer Science from MIT in 2000 and 2004, respectively; his Ph.D. advisor was Madhu Sudan. Prior to joining TIFR in 2010, he was at Microsoft Research, Silicon Valley and at the Toyota Technological Institute at Chicago. His areas of interest include computational complexity, hardness of approximation, coding theory and information theory. Prahladh credits his mother for his interest in mathematics and dance. He is also deeply indebted to U Koteswara Rao, his high school mentor, for exposing him to both the beauty and the rigour in mathematics.

Tali Kaufman is a professor at Bar Ilan University in Israel. She received her Ph.D. degree from Tel-Aviv University in 2007 under the supervision of Noga Alon. Tali is interested in the theory of computation with a specific interest in locally testable codes, high-dimensional expanders and their potential implications to CS.

Noga Ron-Zewi is a professor at the Department of Computer Science at the University of Haifa in Israel. She graduated from the Technion (Israel Institute of Technology) in 2014. Her Ph.D. advisor was Eli Ben-Sasson. Her research interests are in the theory of computation, with a focus on research topics at the interface of communication and computation.