- Mikael Goldmann, Theoretical Advances in Neural Computation and Learning, 1994, 85
- Arkadev Chattopadhyay, Kristoffer Arnsfelt Hansen, 3580, Automata, Languages and Programming, 2005, 994
- Eric Allender, 1180, Foundations of Software Technology and Theoretical Computer Science, 1996, 1
- Alexander A. Sherstov, Proceedings of the forty-fourth annual ACM symposium on Theory of computing, 2012, 525
- Mikael Goldmann, “On the power of a threshold gate at the top”, Information Processing Letters, 63, no. 6, 1997, 287
- Kenneth W. Regan, Complexity Theory Retrospective II, 1997, 261
- Anna Gál, Vladimir Trifonov, “On the Correlation Between Parity and Modular Polynomials”, Theory Comput Syst, 50, no. 3, 2012, 516
- Ryan Williams, Proceedings of the forty-sixth annual ACM symposium on Theory of computing, 2014, 194
- E. Viola, 20th Annual IEEE Conference on Computational Complexity (CCC'05), 2005, 198
- Kei Uchizawa, Eiji Takimoto, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 2007, 169