Theoretische Informatik 1
Prof. Dr. Olaf Beyersdorff
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.
Contact
Address:
Friedrich Schiller University Jena
Institute of Computer Science
Ernst-Abbe-Platz 2
07743 Jena
Germany
E-Mail: olaf dot beyersdorff at uni-jena dot de
Tel.: +49 (0)3641 9-46320
Fax: +49 (0)3641 9-46322
Current and recent projects
- Quantifizierte Boolesche Formeln: Beweiskomplexität und Solving (2021-2024), funded by the German Research Foundation (DFG)
- Hardness in QBF proof complexity (2021–2023) funded by the German Academic Exchange Service (DAAD)
- A New Dawn of Intuitionism: Mathematical and Philosophical AdvancesExternal link (2017-2020)
funded by the John Templeton Foundation - Grant for returning Scientists to Germany (2018-2021)
funded by the German Scholars Organisation and the Carl Zeiss Foundation - Correctness by Construction (2014-2017)
Coordinator, funded by EU, Marie Curie International Research Staff Exchange Scheme - Parameterized Proof ComplexityExternal link (2014-2016)
PI, funded by Engineering and Physical Sciences Research Council (EPSRC) - Abstract Mathematics for Actual Computation: Hilbert's Program in the 21st CenturyExternal link (2014-2016)
PI, funded by the John Templeton Foundation
Activities
- Editor: Journal on Satisfiability, Boolean Modeling, and Computation (JSAT)
- PC member: AAAI 2021External link, SAT 2021External link, IJCAI 2021External link, SAT 2020, AAAI 2020, SAT 2019External link, IJCAI 2019External link, CSR 2019External link, SAT 2018External link (co-chair), IJCAI-ECAI-2018, CiE 2018External link, SAT 2017External link, LCC 2017, STACS 2017External link, FSTTCS 2016External link, SAT 2016External link, QBF 2016External link, Mathematics for ComputationExternal link 2016 (chair), SAT 2015External link, QUANTIFY 2015External link, Workshop on Proof ComplexityExternal link 2014 (chair), SAT 2014External link, LCC 2014, TAMC 2011, AITC 2010
- Member of Steering Committees: GI Fachgruppe Logic in Computer Science (Speaker)External link, SAT Association (Vice Chair), LCCExternal link (since 2016)
- Judge of Competitions: QBFEVAL 2020, QBFEVAL 2019, QBFEVAL 2018External link, QBFEVAL 2017External link
- Organiser: ICMS External linkworkshop Complexity of Proofs and Computation planned for 2021, Dagstuhl Seminar Theory and Practice of SAT SolvingExternal link, Dagstuhl Seminar SAT and InteractionsExternal link 2020, 25th annual meeting of the GI-Fachgruppe "Logik in der InformatikExternal link” 2019, Workshop on Proof ComplexityExternal link 2018, Special Session on SAT Solving at CiE 2018External link, Logic Colloquium 2016External link, Dagstuhl Seminar SAT and InteractionsExternal link 2016, Dagstuhl Seminar Optimal Algorithms and ProofsExternal link 2014, Workshop on Proof ComplexityExternal link 2014, Workshop Limits of Theorem Proving 2012, 58. Workshop Algorithms and Complexity (Theorietag) 2009
- Recent and forthcoming invited talks: Prague Logic Colloquium 2019External link, RiSE Winter School 2018, Logic Summer School at ANU College of Engineering & Computer Science, 2017, Proof Complexity WorkshopExternal link 2016, Dagstuhl Seminar Circuits, Logic and GamesExternal link 2015, QUANTIFY 2015External link, LCC 2015External link, Dagstuhl Seminar Theory and Practice of SAT SolvingExternal link 2015, Indo-UK workshop on Computational Complexity TheoryExternal link 2015, Annual conference of the BLC 2013
- Lecturer at Summer Schools: ESSLLI 2015External link, SAT/SMT Summer School 2013External link, ESSLLI 2011, ESSLLI 2010