Dr. Joshua Blinkhorn

Joshua Blinkhorn

Image: Joshua Blinkhorn


Institute of Computer Science
Friedrich Schiller University Jena
Ernst-Abbe-Platz 2
Room: 3324
07743 Jena
Germany

E-Mail: joshua.blinkhorn@uni-jena.de

Tel.: +49 (0)3641 9-46324
Fax: +49 (0)3641 9-46322

Biography

After obtaining a first-class BA in Mathematics from the Open University (2015),
I completed a PhD in proof complexity at the University of Leeds (2019).
I work currently as a postdoctoral researcher in the Computer Science Institute at the University of Jena.

Research Interests

I continue to work in proof complexity, with particular emphasis on quantified Boolean formulas and models of solving.
My broader interests lie in computational complexity and automated reasoning.
I also maintain a casual and lifelong fascination with theories of natural philosophy.

Publication Record

A complete list of my publications is to be found hereExternal link.

Scientific Activities

I am serving on the program committee of the QBF workshop 2020.

Talks

  • Hardness Characterisations and Size-Width for QBF – Dagsthul 2020 (invited)
  • Proof Complexity of QBF Symmetry Recomputation – SAT 2019 (conference paper)
  • Building Strategies into QBF Proofs – IMSc Chennai 2019 (invited), TU Wien 2019 (invited), QBF 2019 (contributed)
  • Lower-bound Techniques for QBF Expansion' STACS 2018 (conference paper)
  • Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs – ITCS 2018 (conference
    paper), BCTCS 2018 (contributed)
  • Shortening QBF Proofs with Dependency Schemes – SAT 2017 (conference paper), IJCAI 2018 (best paper track presentation)
  • QBF Calculi: Semantics and Soundness – CP 2016 (conference paper), Schloss Dagstuhl 2016
    (invited), QBF 2016 (contributed), BCTCS 2016 (contributed)