Stefan Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin, “Proof Complexity and the Binary Encoding of Combinatorial Principles”, SIAM J. Comput., 53:3 (2024), 764
Dmitry Sokolov, Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, 2008
Yilei Chen, Jiatu Li, Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, 620
Noah Fleming, Toniann Pitassi, Outstanding Contributions to Logic, 22, Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs, 2022, 497
Hanlin Ren, Rahul Santhanam, Zhikun Wang, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2022, 640
Lijie Chen, Shuichi Hirahara, Igor Carboni Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam, “Beyond Natural Proofs: Hardness Magnification and Locality”, J. ACM, 69:4 (2022), 1
Shachar Lovett, Kewen Wu, Jiapeng Zhang, “Decision List Compression by Mild Random Restrictions”, J. ACM, 68:6 (2021), 1
Rahul Santhanam, Iddo Tzameret, Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, 234
Shachar Lovett, Kewen Wu, Jiapeng Zhang, Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, 247
Moritz Müller, Ján Pich, “Feasibly constructive proofs of succinct weak circuit lower bounds”, Annals of Pure and Applied Logic, 171:2 (2020), 102735