Prof. Dr. Olaf Beyersdorff
Prof. Dr. Olaf Beyersdorff
Image: Olaf BeyersdorffAddress:
Friedrich Schiller University Jena
Institute of Computer Science
Inselplatz 5
Room: 3054
07743 Jena
Germany
E-Mail: olaf.beyersdorff@uni-jena.de
Tel.: +49 (0)3641 9-46321
Fax: +49 (0)3641 9-46322
Since 2018 I am Professor of Theoretical Computer Science at Friedrich Schiller University Jena. My research interests are in algorithms, complexity, computational logic, and in particular proof complexity.
Before coming to Jena I spent six years at the University of Leeds, as Professor of Computational Logic (2017-18), Associate Professor (2015-17), and Lecturer (2012-15). Since 2018 I am a visiting professor at the University of Leeds.
Before that I was a visiting professor (2011/12) and visiting researcher (2009/10) at Sapienza University Rome, Lecturer at Leibniz University Hanover (2007-12) and postdoc at Humboldt University Berlin (2006/07). I obtained my PhD from Humboldt University Berlin in 2006 and completed my habilitation at Leibniz University Hanover in 2011.
Activities
- Editor: Journal on Satisfiability, Boolean Modeling, and Computation (JSAT)External link, ACM Transactions on Computational LogicExternal link, Guest editor for special editions at Logical Methods in Computer ScienceExternal link,
Springer Book Series Progress in Computer Science and Applied LogicExternal link - Member of Steering Committees: SAT Association (Chair), International Symposium on Theoretical Aspects of Computer Science (STACS)External link (co-chair), GI Fachgruppe Logic in Computer Science (Speaker)External link, Logical Methods in Computer ScienceExternal link (member of the Executive Board)
- PC (co-)chair (selected):
42nd International Symposium on Theoretical Aspects of Computer Science (STACS’25)External link,
41st International Symposium on Theoretical Aspects of Computer Science (STACS’24)External link,
21st International Conference on Theory and Applications of Satisfiability Testing (SAT’18)External link
- PC member of international conferences, including SAT (annually since 2014),
MFCS, STACS, AAAI, IJCAI, CSR, FSTTCS, CiE, LCC, TAMC - Judge of Competitions: QBFEVAL 2017-2022
- Organiser of international conferences: 42nd International Symposium on Theoretical Aspects of Computer Science (STACS)External link, Jena, 2025; Logic ColloquiumExternal link, Leeds, 2016
- Organiser of international workshops. Recent and selected examples:
Theory and Practice of SAT and Combinatorial Solving, Banff, Canada, 2026;
Milestones and Motifs in the Theory of Proofs, Algebraic Computation, and Lower Bounds, IIT Gandhinagar, India, 2024;
Dagstuhl seminar SAT and Interactions, Schloss Dagstuhl, 2024;
Dagstuhl seminar Theory and Practice of SAT Solving, Schloss Dagstuhl, 2022;
ICMS Research Workshop Complexity of Proofs and Computation, International Centre for Mathematical Sciences, Edinburgh, UK, 2022;
Dagstuhl seminar SAT and Interactions, Schloss Dagstuhl, 2020