Igor C. Oliveira is a Royal Society University Research Fellow and Assistant Professor at the University of Warwick. He received his Ph.D. from Columbia University in 2015, advised by Tal Malkin and Rocco Servedio. Before joining the University of Warwick, he was a postdoctoral researcher in the Algorithms and Complexity Theory Group at the University of Oxford, a research fellow at the Simons Institute for the Theory of Computing (Berkeley), and a postdoctoral fellow at the School of Mathematics at Charles University in Prague. He is interested in computational complexity theory and its connections to algorithms, combinatorics, and mathematical logic.

Ján Pich is a Royal Society University Research Fellow and a Marie Skłodowska-Curie Research Fellow in the Algorithms and Complexity Theory Group at the University of Oxford. He received his Ph.D. from Charles University in Prague under the supervision of Jan Krajíček. Subsequently, he held postdoctoral positions at the University of Toronto, University of Leeds, University of Vienna and the Czech Academy of Sciences. He is interested in mathematical logic and complexity theory, in particular, in the proof complexity of circuit lower bounds.

Rahul Santhanam is a Professor of Computer Science at the University of Oxford, and a Tutorial Fellow at Magdalen College. He obtained his Ph.D. from the University of Chicago in 2005, working under the supervision of Lance Fortnow and Janos Simon. After postdoctoral stints at Simon Fraser University and the University of Toronto, he joined the University of Edinburgh as a Lecturer in Computer Science in 2008, and moved to the University of Oxford in 2016. His primary interests are in computational complexity theory and experimental poetry.