Stephen Bloch. Reflections of a computer language nut. In Jean Nazzaro, editor, Computer Connections for Gifted Children and Youth. CEC/ERIC, 1981.
Stephen Bloch and Judy Goldsmith. Sharply bounded alternation within P. Technical Report 92-04, University of Manitoba Computer Science Dept, Apr 1992.
Stephen Bloch. Alternating function classes within P. Technical Report 92-16, University of Manitoba Computer Science Dept, Dec 1992.
Stephen Bloch. Divide and Conquer in Parallel Complexity and Proof Theory. PhD thesis, University of California, San Diego, 1992.
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. Supserseded by [Blo94].
Stephen Bloch, Jonathan Buss, and Judy Goldsmith. How hard are n2-hard problems? SIGACT News, 25(2):83-85, June 1994.
Stephen Bloch. Function-algebraic characterizations of log and polylog parallel time. computational complexity, 4(2):175-205, 1994. See [Blo92c].
Stephen Bloch. On parallel hierarchies and Rik. In Daniel Leivant, editor, Proceedings of Workshop on Logic and Computational Complexity, number 960 in Lecture Notes in Computer Science. Springer-Verlag, 1995. Superseded by [Blo98].
Stephen Bloch. Integer NC1 is equal to Boolean NC1. Technical Report 96-23, DIMACS Center at Rutgers University, July 1996.
Stephen Bloch. On parallel hierarchies and Rik. Technical Report 1996-004, Adelphi University Math/CS Dept, Sept 1996. Superseded by [Blo98].
Stephen Bloch, Jonathan Buss, and Judy Goldsmith. Sharply bounded alternation and quasilinear time. Theory of Computing Systems, 31(2):187-214, March 1998.
Stephen Bloch. On parallel hierarchies and Rik. Annals of Pure and Applied Logic, 89(2/3):231-273, Jan 1998. See [Blo95], [Blo96b].
Andris Ambainis, Stephen Bloch, and David Schweizer. Playing twenty questions with a procrastinator. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages S844-S845, January 1999. See [ABS02].
Stephen Bloch. Scheme and Java in the First Year. Journal of Computing in Small Colleges 15:5, 157-165, May 2000. (Second-place winner, Best Paper Award at the conference.)
Andris Ambainis, Stephen Bloch, and David Schweizer. Delayed binary search, or playing twenty questions with a procrastinator. Algorithmica 32:4, pp. 641-651, January 2002. See [ABS99].
Stephen Bloch, Kathi Fisler, and Viera Proulx. Introductory computer science with focus on program design. In Journal of Computing Sciences in Colleges, volume 18:5, pages 70-71. Consortium for Computing Sciences in Colleges, Northeast, May 2003. Tutorial session.
Stephen Bloch. Teaching linked lists and recursion without conditionals or null. Journal of Computing Sciences in Colleges, 18(5):96-108, May 2003.
Stephen Bloch and Viera Proulx. TeachScheme, ReachJava: Introducing OOP without Drowning in Syntax. Tutorial, CCSCNE07 (abstract in Journal of Computing Sciences in Colleges 22:4, April 2007.)
Stephen Bloch. Picturing Programs: an Introduction to Computer Programming, College Publications, London (UK) 2010, ISBN 978-1-84890-015-8.