Professor Olaf Beyersdorff
Before joining the University of Leeds 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.
- Deputy Director of Research and Innovation
My research interests are in the area of computational complexity, computational logic, and algorithms. In particular, I am fascinated by the interplay of logical, combinatorial, and algebraic techniques. Proof complexity is one of the fields where this interplay functions in very fruitful manner, and this is one of the central themes of my research.
My main research fields are
- Computational Complexity
- Proof Complexity
- SAT and QBF solving
- Bounded Arithmetic
- Non-classical Logics
- Satisfiability problems
I am currently involved in the following research projects
- Parameterized Proof Complexity (2014-2016)
PI, funded by Engineering and Physical Sciences Research Council (EPSRC)
- Abstract Mathematics for Actual Computation: Hilbert's Program in the 21st Century (2014-2016)
PI, funded by the John Templeton Foundation
- Correctness by Construction (2014-2017)
Coordinator, funded by EU, Marie Curie International Research Staff Exchange Scheme
Recent and forthcoming invited talks: Proof Complexity Workshop 2016, Dagstuhl Seminar Circuits, Logic and Games 2015, QUANTIFY 2015, LCC 2015, Dagstuhl Seminar Theory and Practice of SAT Solving 2015, Indo-UK workshop on Computational Complexity Theory 2015, Annual conference of the BLC 2013
I am currently module leader for the BSc module Information Management and Security and the MSc module Algorithms.
Research groups and institutes
- Algorithms and Complexity
Postgraduate research opportunities
We welcome enquiries from motivated and qualified applicants from all around the world who are interested in PhD study.
Projects currently available: