1. Robustness of average-case meta-complexity via pseudorandomness;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
2. Tradeoffs for small-depth Frege proofs;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
3. The Minimum Formula Size Problem is (ETH) Hard;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
4. Information in propositional proofs and algorithmic proof search;The Journal of Symbolic Logic;2021-09-27
5. Iterated lower bound formulas: a diagonalization-based approach to proof complexity;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15