- Joshua A. Grochow, 2014 IEEE 29th Conference on Computational Complexity (CCC), 2014, 274
- Joshua A. Grochow, Toniann Pitassi, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 2014, 110
- Alexander Razborov, “Guest Column”, SIGACT News, 47, no. 2, 2016, 66
- Shuichi Hirahara, Mikito Nanashima, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022, 751
- R. Impagliazzo, V. Kabanets, A. Wigderson, Proceedings 16th Annual IEEE Conference on Computational Complexity, 2000, 2
- Boaz Barak, Shien Jin Ong, Salil Vadhan, “Derandomization in Cryptography”, SIAM J. Comput., 37, no. 2, 2007, 380
- Aloni Cohen, Shafi Goldwasser, Vinod Vaikuntanathan, 9015, Theory of Cryptography, 2015, 61
- Valentine Kabanets, Russell Impagliazzo, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, 2003, 355
- Alexander Razborov, “Pseudorandom generators hard for k-DNF resolution and polynomial calculus resolution”, Ann. Math., 181, no. 2, 2015, 415
- Igor C. Oliveira, Rahul Santhanam, Roei Tell, “Expander-Based Cryptography Meets Natural Proofs”, comput. complex., 31, no. 1, 2022, 4