1. On the existence of strong proof complexity generators;The Bulletin of Symbolic Logic;2023-11-22
2. Schema Complexity in Propositional-Based Logics;Mathematics;2021-10-21
3. Strong co-nondeterministic lower bounds for NP cannot be proved feasibly;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
4. Why are Proof Complexity Lower Bounds Hard?;2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS);2019-11
5. Bibliography;Proof Complexity;2019-03-28