- Eric Blais, Johan Håstad, Rocco A. Servedio, Li-Yang Tan, 8572, Automata, Languages, and Programming, 2014, 235
- Shuichi Hirahara, Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, 292
- Amir Shpilka, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, 2007, 284
- Timothy Y. Chow, “Almost-natural proofs”, Journal of Computer and System Sciences, 77, no. 4, 2011, 728
- Benoît Libert, Damien Stehlé, Radu Titiu, “Adaptively Secure Distributed PRFs from $\textsf {LWE}$”, J Cryptol, 34, no. 3, 2021, 29
- Lijie Chen, Shuichi Hirahara, Igor Carboni Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam, “Beyond Natural Proofs: Hardness Magnification and Locality”, J. ACM, 69, no. 4, 2022, 1
- Sang-Un Lee, “Baby-Step 2<sup>k</sup>-ary Adult-Step Algorithm for Symmetric-Key Decryption”, The Journal of The Institute of Internet, Broadcasting and Communication, 15, no. 2, 2015, 23
- Lijie Chen, Ce Jin, R. Ryan Williams, Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, 1335
- Srinivasan Arunachalam, Alex B. Grilo, Tom Gur, Igor C. Oliveira, Aarthi Sundaram, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022, 562
- Russell Impagliazzo, 3821, FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005, 19