Stephen A. Bloch

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

Collaborative distances:

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

2002

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

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

Algorithmica, 2002

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