1. Unified QBF certification and its applications
2. Valeriy Balabanov , Magdalena Widl , and Jie-Hong R. Jiang . 2014. QBF Resolution Systems and Their Proof Complexities . In Theory and Applications of Satisfiability Testing – SAT 2014 , Carsten Sinz and Uwe Egly (Eds.). Springer International Publishing , Cham, 154–169. Valeriy Balabanov, Magdalena Widl, and Jie-Hong R. Jiang. 2014. QBF Resolution Systems and Their Proof Complexities. In Theory and Applications of Satisfiability Testing – SAT 2014, Carsten Sinz and Uwe Egly (Eds.). Springer International Publishing, Cham, 154–169.
3. Olaf Beyersdorff . 2022. Proof Complexity of Quantified Boolean Logic – a Survey . In Mathematics for Computation (M4C), Marco Benini, Olaf Beyersdorff, Michael Rathjen, and Peter Schuster (Eds.). World Scientific , Singapore , 353–391. Olaf Beyersdorff. 2022. Proof Complexity of Quantified Boolean Logic – a Survey. In Mathematics for Computation (M4C), Marco Benini, Olaf Beyersdorff, Michael Rathjen, and Peter Schuster (Eds.). World Scientific, Singapore, 353–391.
4. Formulas with Large Weight: a New Technique for Genuine QBF Lower Bounds;Beyersdorff Olaf;Electron. Colloquium Comput. Complex.,2017
5. Lower Bound Techniques for QBF Expansion