Back to Faculty Listings

Print the Profile

Diplomas / Degrees

Ph.D. Mathematics, Univ. California San Diego (1992)
B.S. Math and Computer Science, Virginia Tech (1986)

Recent Courses

Algorithms And Complexity
Computer Programming For Non-Majors
Directed Readings Design Analysis Algorith
Directed Readings Design Analysis Aligorith
Directed Readings Design And Analysis Algorith
Directed Readings Design/Analysis Algorith
Directed Readings Principle Of Programming Language
Directed Readings Principle Programming Languages
Directed Readings Principle Programming Language
Graphical User Interface Programming
Independent Study Introduction Programming: Java
Independent Study Java Programming
Introduction To Mathematical Logic
Introduction To Computer Programming ( Lab )
Introduction To Computer Programming (lab)
Introduction To Computer Programming (lecture)
Software I: Utilities And Internals
Survey Of Programming Languages
Symbolic Logic

Teaching Specializations / Interests

Computational complexity, design and analysis of algorithms, logic, computer programming pedagogy

Research Interests

Computational complexity theory, logic, computer science pedagogy

Grants / Sponsored Research

Co-PI on NSF/ESI grant "Computing Education for Every Student in Secondary Schools", $1,600,000, 2001-2005.

PI on NSF/DUE grant "Redesigning Introductory Computing: The Design Discipline", $500,000, 2007-2010.

Recent Articles

Showing first 5 of 7. View All

Bloch, S. (2003, 5). Teaching linked lists and recursion without conditionals or null. Journal of Computing Sciences in Colleges, 18:5, 96-108

Ambainis, A, Bloch, S, and Schweizer, D. (2002, 1). Delayed binary search, or playing twenty questions with a procrastinator. Algorithmica, 32:4, 641-651

Bloch, S. (2000, 5). Scheme and Java in the First Year. Journal of Computing in Small Colleges, 15:5, 157-165

Bloch, S, Buss, J, and Goldsmith, J. (1998, 3). Sharply bounded alternation and quasilinear time. Theory of Computing Systems, 31(2), 187-214

Bloch, S. (1998, 1). On parallel hierarchies and R^i_k. Annals of Pure and Applied Logic, 89(2/3), 231-273

Conference Presentations and Papers

Bloch, S. (11 April 2008). TeachScheme, ReachJava: Introducing OOP Without Drowning in Syntax. Consortium for Computing Sciences in Colleges Northeast, Staten Island, NY, Tutorial workshop

Bloch, S. (28 October 2006). TeachScheme!: a Functional-First Approach to Beginning Programming. Consortium for Computing Sciences in Colleges East, Fredericksburg, VA, Tutorial workshop

Bloch, S, Fisler, K, & Proulx, V. (25 April 2003). Introductory computer science with focus on program design. Consortium for Computing Sciences in Colleges Northeast, Providence, RI, Tutorial session

Bloch, S. (25 April 2003). Teaching linked lists and recursion without conditionals or null. Consortium on Computing Sciences in Colleges, Providence, RI, 96-108

Ambainis, A, Bloch, S, and Schweizer, D. (15 January 1999). Playing twenty questions with a procrastinator. Symposium on Discrete Algorithms, Philadelphia, S844-S845

Selected Dissertations Chaired

Sven Dietrich (1997). An A Formal Analysis of the Secure Sockets Layer Protocol.Adelphi

Professional Activities

Publicity co-Chair, CCSCNE conference 2006.
Papers co-Chair, CCSCNE 2008 and CCSCNE 2009.

Licenses & Certifications

Sun Certified Java Programmer, 2004
CompTIA Network+ Certification, 2004