Blo81 Stephen Bloch. Reflections of a computer language nut. In Jean Nazzaro, editor, Computer Connections for Gifted Children and Youth. CEC/ERIC, 1981.
BG92 Stephen Bloch and Judy Goldsmith. Sharply bounded alternation within . Technical Report 92-04, University of Manitoba Computer Science Dept, Apr 1992.
Blo92a Stephen Bloch. Alternating function classes within . Technical Report 92-16, University of Manitoba Computer Science Dept, Dec 1992.
Blo92b Stephen Bloch. Divide and Conquer in Parallel Complexity and Proof Theory. PhD thesis, University of California, San Diego, 1992.
Blo92c 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. See [Blo94].
BBG94 Stephen Bloch, Jonathan Buss, and Judy Goldsmith. How hard are -hard problems? SIGACT News, 25(2):83-85, June 1994.
Blo94 Stephen Bloch. Function-algebraic characterizations of log and polylog parallel time. computational complexity, 4(2):175-205, 1994. See [Blo92c].
Blo95 Stephen Bloch. On parallel hierarchies and . In Daniel Leivant, editor, Proceedings of Workshop on Logic and Computational Complexity, number 960 in Lecture Notes in Computer Science. Springer-Verlag, 1995. See [Blo98].
Blo96a Stephen Bloch. Integer is equal to Boolean . Technical Report 96-23, DIMACS Center at Rutgers University, July 1996.
Blo96b Stephen Bloch. On parallel hierarchies and . Technical Report 1996-004, Adelphi University Math/CS Dept, Sept 1996. See [Blo98].
BBG98 Stephen Bloch, Jonathan Buss, and Judy Goldsmith. Sharply bounded alternation and quasilinear time. Theory of Computing Systems, 31(2): 187-214, March 1998.
Blo98 Stephen Bloch. On parallel hierarchies and . Annals of Pure and Applied Logic, 89(2/3):231-273, Jan 1998. See [Blo95], [BLo96b].
ABS99 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 journal version: [ABS02]
Blo00 Stephen Bloch. Scheme and java in the first year. Journal of Computing Sciences in Colleges, 15(5):157-165, May 2000. Second-place Best Paper award at conference.
ABS02 Andris Ambainis, Stephen Bloch, and David Schweizer. Delayed binary search, or playing twenty questions with a procrastinator. Algorithmica, 32(4), January 2002. See [ABS99].
BFP03 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.
Blo03 Stephen Bloch. Teaching linked lists and recursion without conditionals or null. Journal of Computing Sciences in Colleges, 18(5):96-108, May 2003.