Stephen A. Bloch

According to our database, Stephen A. Bloch authored at least 23 papers between 1992 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2013

Functional game programming in Java-based CS1.

Stephen A. Bloch, Lee Stemkoski

J. Comput. Sci. Coll., 2013

Functional game programming in Java-based CS1.

Stephen A. Bloch

J. Comput. Sci. Coll., 2013

2012

Program by design: TeachScheme/ReachJava (abstract only).

Viera K. Proulx, Stephen A. Bloch

Proceedings of the 43rd ACM technical symposium on Computer science education, 2012

Program by design: from animations to data structures (abstract only).

Kathi Fisler, Stephen A. Bloch

Proceedings of the 43rd ACM technical symposium on Computer science education, 2012

2011

Program By Design: graphics-first programming without drowning in syntax.

Stephen A. Bloch

J. Comput. Sci. Coll., 2011

Teach Scheme, reach Java: introducing object-oriented programming without drowning in syntax: pre-conference workshop.

Stephen A. Bloch

J. Comput. Sci. Coll., 2011

2010

Teachscheme, ReachJava: introducing object-oriented programming without drowning in syntax: poster session.

Stephen A. Bloch

J. Comput. Sci. Coll., 2010

2008

Teach Scheme, reach Java: introducing object-oriented programming without drowning in syntax.

Stephen A. Bloch

J. Comput. Sci. Coll., 2008

Teach scheme, reach Java: introducing object-oriented programmming without drowning in syntax.

Stephen A. Bloch

J. Comput. Sci. Coll., 2008

2007

Teach scheme, reach Java: introducing object - oriented programming without drowning in syntax: tutorial presentation.

Stephen A. Bloch, Viera K. Proulx

J. Comput. Sci. Coll., 2007

TEACHSCHEME!: a functional-first approach to beginning programming.

Stephen A. Bloch

J. Comput. Sci. Coll., 2007

2003

Introductory computer science with focus on program design.

Stephen A. Bloch, Kathi Fisler, Viera K. Proulx

J. Comput. Sci. Coll., 2003

Teaching linked lists and recursion without conditionals or null.

Stephen A. Bloch

J. Comput. Sci. Coll., 2003

2002

Delayed Binary Search, or Playing Twenty Questions with a Procrastinator.

Andris Ambainis, Stephen A. Bloch, David L. Schweizer

Algorithmica, 2002

2000

Scheme and Java in the first year.

Stephen A. Bloch

J. Comput. Sci. Coll., 2000

1999

Playing Twenty Questions with a Procrastinator.

Andris Ambainis, Stephen A. Bloch, David L. Schweizer

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

Sharply Bounded Alternation and Quasilinear Time.

Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith

Theory Comput. Syst., 1998

1997

On Parallel Hierarchies and Rⁱ_k.

Stephen A. Bloch

Ann. Pure Appl. Log., 1997

1996

Sharply Bounded Alternation within P

Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith

Electron. Colloquium Comput. Complex., 1996

1994

How hard are n2-hard problems?

Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith

SIGACT News, 1994

Function-Algebraic Characterizations of Log and Polylog Parallel Time.

Stephen A. Bloch

Comput. Complex., 1994

On Parallel Hierarchies and R_k^i.

Stephen A. Bloch

Proceedings of the Logical and Computational Complexity. Selected Papers. Logic and Computational Complexity, 1994

1992

Functional Characterizations of Uniform Log-depth and Polylog-depth Circuit Families.

Stephen A. Bloch

Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992