- Scott Aaronson, Avi Wigderson, “Algebrization”, ACM Trans. Comput. Theory, 1, no. 1, 2009, 1
- Oded Goldreich, 1853, Automata, Languages and Programming, 2000, 687
- Kazuyuki Amano, Akira Maruoka, 3341, Algorithms and Computation, 2004, 28
- Alexandre de Castro, “One-way-ness in the input-saving (Turing) machine”, Physica A: Statistical Mechanics and its Applications, 415, 2014, 473
- Jan Bydžovský, Moritz Müller, “Polynomial time ultrapowers and the consistency of circuit lower bounds”, Arch. Math. Logic, 59, no. 1-2, 2020, 127
- Eric Allender, 5010, Computer Science – Theory and Applications, 2008, 3
- Thomas Seiller, “Interaction Graphs”, ACM Trans. Comput. Logic, 19, no. 3, 2018, 1
- Neeraj Kayal, Vineet Nair, Chandan Saha, Sébastien Tavenas, “Reconstruction of Full Rank Algebraic Branching Programs”, ACM Trans. Comput. Theory, 11, no. 1, 2019, 1
- Lijie Chen, Hanlin Ren, “Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization”, SIAM J. Comput., 51, no. 3, 2022, STOC20-115
- Eric Allender, Bireswar Das, “Zero knowledge and circuit minimization”, Information and Computation, 256, 2017, 2