Olaf Beyersdorff is a Professor of Theoretical Computer Science at Friedrich Schiller University Jena in Germany and visiting professor at the University of Leeds in the UK. His research topics include algorithms, complexity, computational logic, and in particular proof complexity. Before coming to Jena he held positions at the University of Leeds, Sapienza University Rome, Leibniz University Hanover and Humboldt University Berlin, where he obtained his PhD in 2006. He completed a habilitation at Leibniz University Hanover in 2011.

---