Ankit Garg is a researcher at Microsoft Research India. Previously, he obtained his Ph.D. in computer science from Princeton University under the supervision of Mark Braverman, and then spent two years as a postdoc at Microsoft Research New England. Even before that, he got his undergraduate degree in computer science from the Indian Insitute of Technology Delhi. His research interests lie in algebraic complexity, optimization, and communication complexity. He grew up in Bathinda (a small city in Punjab, India) and like most Indians, loves playing and watching cricket.

Mika Göös is an assistant professor at EPFL in the Theory Group. Previously, he was a postdoc at Stanford Theory, the Institute for Advanced Study, and the ToC group at Harvard. He completed his Ph.D. at the University of Toronto under the watchful eye of Toniann Pitassi. He obtained his B.Sc. from Aalto University, and his M.Sc. from the University of Oxford. In his spare time, Mika enjoys rock climbing, hoping to climb a 7C-grade boulder one day.

Pritish Kamath is a postdoctoral scholar at the Toyota Technological Institute at Chicago. He completed his Ph.D. at MIT, co-advised by Madhu Sudan and Ronitt Rubinfeld. Prior to that, he completed a B.Tech. in Computer Science at IIT Bombay in 2012 after which he was a Research Fellow at Microsoft Research India until 2013, where he was mentored by Neeraj Kayal. He has broad interests in complexity theory and has worked in areas touching upon communication complexity, information theory, Boolean and algebraic circuit complexity and proof complexity. Most recently he has become interested in foundational aspects of machine learning. He likes to juggle multiple things in life; sometimes on a bicycle.

Dmitry Sokolov is a postdoc at Lund University and the University of Copenhagen. He got his Ph.D. in mathematics from the St. Petersburg Department of Steklov Mathematical Institute of the Russian Academy of Sciences under the supervision of Edward Hirsch and Dmitry Itsykson, and then spent two years as a postdoc at KTH Royal Institute of Technology. He defended his master's thesis in computer science at St. Petersburg Academic University. His research interests include proof complexity, communication complexity, and circuit complexity. He likes to play table tennis.