- Shuichi Hirahara, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018, 247
- Walter Dean, “Computational Complexity Theory and the Philosophy of Mathematics†”, Philosophia Mathematica, 27, № 3, 2019, 381
- Rahul Ilango, Jiatu Li, R. Ryan Williams, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, 1076
- Prerona Chatterjee, Mrinal Kumar, C Ramya, Ramprasad Saptharishi, Anamay Tengse, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, 870
- Ketan D. Mulmuley, Milind Sohoni, “Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties”, SIAM J. Comput., 38, № 3, 2008, 1175
- Scott Aaronson, Avi Wigderson, Proceedings of the fortieth annual ACM symposium on Theory of computing, 2008, 731
- Yizhi Huang, Rahul Ilango, Hanlin Ren, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, 1067
- Alexis Maciel, Toniann Pitassi, Alan R. Woods, Proceedings of the thirty-second annual ACM symposium on Theory of computing, 2000, 368
- Swastik Kopparty, Proceedings of the forty-third annual ACM symposium on Theory of computing, 2011, 489
- Pavel Pudlák, Logical Foundations of Mathematics and Computational Complexity, 2013, 365