- Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson, “Pseudorandom Generators in Propositional Proof Complexity”, SIAM J. Comput., 34, no. 1, 2004, 67
- Ketan D. Mulmuley, “On P vs. NP and geometric complexity theory”, J. ACM, 58, no. 2, 2011, 1
- Ryan Williams, Proceedings of the forty-sixth annual ACM symposium on Theory of computing, 2014, 194
- Philippe Moser, “Resource-bounded measure on probabilistic classes”, Information Processing Letters, 106, no. 6, 2008, 241
- Ryan Williams, “Nonuniform ACC Circuit Lower Bounds”, J. ACM, 61, no. 1, 2014, 1
- Markus Bläser, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018, 1193
- Lijie Chen, Ce Jin, R. Ryan Williams, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, 1240
- E. Viola, 20th Annual IEEE Conference on Computational Complexity (CCC'05), 2005, 198
- Eric Allender, Michal Koucký, 2008 23rd Annual IEEE Conference on Computational Complexity, 2008, 31
- Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass, 10993, Advances in Cryptology – CRYPTO 2018, 2018, 753