Yuval Filmus obtained his Ph.D. at the University of Toronto, advised by Toni Pitassi. He spent two years as a postdoc at the Simons Institute in Berkeley and the IAS in Princeton. After that, he joined the Technion in Haifa, where he is now an Associate Professor. His main interests nowadays are Boolean function analysis and complexity theory.

Massimo Lauria got his Ph.D. at the Department of Computer Science of University “La Sapienza” in Rome in 2009, advised by Nicola Galesi. After that he bounced around Europe (and even further) for postdocs and visiting positions between 2011 and 2017, in particular Prague, Stockholm, Tokyo and Barcelona, where he honed his research skills in complexity theory and proof complexity. After that he went back to Rome in 2017 to join the Department of Statistical Science at University “La Sapienza” in Rome, where he has been an associate professor since 2020.

Mladen Mikša got his M.S. from the University of Zagreb in 2012, after which he did his Ph.D. at KTH, advised by Jakob Nordström, finishing in 2017. What happened after that is a mystery.

Jakob Nordström obtained his Master of Science degree in Computer Science and Mathematics at Stockholm University in 2001, and his PhD degree in Computer Science at KTH Royal Institute of Technology in 2008. During 2008-2010 he was a postdoctoral researcher at the Massachusetts Institute of Technology (MIT), after which he returned to KTH in 2011, where he became an associate professor and received his Docent degree (habilitation) in 2015. In 2019 he moved to the University of Copenhagen, where he is now a full professor, and since 2020 he also has a part-time affiliation with Lund University. These days, he spends roughly half of his time proving exponential-time lower bounds for NP-hard combinatorial problems, and the other half designing applied algorithms that solve such problems in linear time.

Marc Vinyals did his undergraduate studies at UPC in Barcelona and his Ph.D. studies at KTH in Stockholm, advised by Jakob Nordström, and finishing in 2017. After visiting TIFR in Mumbai and the Technion in Haifa, he worked as a Docent at St Petersburg State University. He has been a Lecturer at Waipapa Taumata Rau — University of Auckland since 2023. His main research interests are proof complexity, communication complexity, and the theory of satisfiability solving. When he is not in front of a whiteboard, he can be found near a stage or in a kayak.