Olaf Beyersdorff is a Professor of Theoretical Computer Science at Friedrich Schiller University Jena, Germany. His research interests are in algorithms, complexity, computational logic, and in particular proof complexity.
Before joining Jena in 2018, Olaf spent six years at the University of Leeds (UK) as a Professor of Computational Logic (2017-18), an Associate Professor (2015-17), and a Lecturer (2012-15). Before that he was a Visiting Professor (2011/12) and Visiting Researcher (2009/10) at Sapienza University Rome, a Lecturer at Leibniz University Hanover (2007-12) and a Postdoctoral Researcher at Humboldt University Berlin (2006/07). Olaf obtained his PhD from Humboldt University Berlin in 2006 and completed his habilitation at Leibniz University Hanover in 2011.
- Satisfiability: Theory, Practice, and Beyond, Spring 2021. Visiting Scientist.