Dependency Schemes in QBF Calculi: Semantics and Soundness. - Olaf Beyersdorff; Joshua Blinkhorn (Electron. Colloquium Comput. Complex., 2016)

Shortening QBF Proofs with Dependency Schemes. - Joshua Blinkhorn; Olaf Beyersdorff (SAT, 2017)

Formulas with Large Weight: a New Technique for Genuine QBF Lower Bounds. - Olaf Beyersdorff; Joshua Blinkhorn (Electron. Colloquium Comput. Complex., 2017)

Size, Cost, and Capacity: A Semantic Technique for Hard Random QBFs. - Olaf Beyersdorff; Joshua Blinkhorn; Luke Hinde (Electron. Colloquium Comput. Complex., 2017)

Dynamic Dependency Awareness for QBF. - Joshua Blinkhorn; Olaf Beyersdorff (IJCAI, 2018)

Genuine Lower Bounds for QBF Expansion. - Olaf Beyersdorff; Joshua Blinkhorn (STACS, 2018)

Building Strategies into QBF Proofs. - Olaf Beyersdorff; Joshua Blinkhorn; Meena Mahajan (Electron. Colloquium Comput. Complex., 2018)

Proof Complexity of QBF Symmetry Recomputation. - Joshua Blinkhorn; Olaf Beyersdorff (SAT, 2019)

Proof Complexity of Symmetry Learning in QBF. - Olaf Beyersdorff; Joshua Blinkhorn (Electron. Colloquium Comput. Complex., 2019)

Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF. - Olaf Beyersdorff; Joshua Blinkhorn; Leroy Chew; Renate A. Schmidt; Martin Suda 001 (J. Autom. Reason., 2019)

Quantified Boolean formulas: proof complexity and models of solving. - Joshua Blinkhorn (2019)

Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution. - Olaf Beyersdorff; Joshua Blinkhorn; Meena Mahajan (Electron. Colloquium Comput. Complex., 2020)

Hard QBFs for Merge Resolution. - Olaf Beyersdorff; Joshua Blinkhorn; Meena Mahajan; Tomás Peitl; Gaurav Sood 001 (Electron. Colloquium Comput. Complex., 2020)

Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths. - Olaf Beyersdorff; Joshua Blinkhorn; Tomás Peitl (Electron. Colloquium Comput. Complex., 2020)

Simulating DQBF Preprocessing Techniques with Resolution Asymmetric Tautologies. - Joshua Blinkhorn (Electron. Colloquium Comput. Complex., 2020)

Lower Bound Techniques for QBF Expansion. - Olaf Beyersdorff; Joshua Blinkhorn (Theory Comput. Syst., 2020)

Dynamic QBF Dependencies in Reduction and Expansion. - Olaf Beyersdorff; Joshua Blinkhorn (ACM Trans. Comput. Log., 2020)

Davis and Putnam Meet Henkin: Solving DQBF with Resolution. - Joshua Blinkhorn; Tomás Peitl; Friedrich Slivovsky (SAT, 2021)

Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths. - Olaf Beyersdorff; Joshua Blinkhorn; Tomás Peitl (Electron. Colloquium Comput. Complex., 2021)

A simple proof of QBF hardness. - Olaf Beyersdorff; Joshua Blinkhorn (Inf. Process. Lett., 2021)

Hardness Characterisations and Size-width Lower Bounds for QBF Resolution. - Olaf Beyersdorff; Joshua Blinkhorn; Meena Mahajan; Tomás Peitl (ACM Trans. Comput. Log., 2023)