1. William Allen. Arithmetizing uniform NC. Annals of Pure and Applied Logic, 53:1 – 50, 1991.
2. Stephen Bellantoni. Predicative Recursion and Computational Complexity. PhD thesis, University of Toronto, 1992.
3. Stephen Bellantoni. Predicative recursion and the polytime hierarchy. In Peter Clote and Jeffery Remmel, editors, Feasible Mathematics II, Perspectives in Computer Science. Birkhäuser, 1994.
4. Stephen Bellantoni and Stephen Cook. A new recursion-theoretic characterization of the poly-time functions. Computational Complexity, 2: 97 – 110, 1992.
5. Stephen Bloch. Functional characterizations of uniform log-depth and polylog-depth circuit families. In Proceedings of the Seventh Annual Structure in Complexity Theory Conference, pages 193–206. IEEE Computer Society Press, 1992.