 | 2002 |
|---|
| 9 |       | Andris Ambainis,
Stephen A. Bloch,
David L. Schweizer:
Delayed Binary Search, or Playing Twenty Questions with a Procrastinator.
Algorithmica 32(4): 641-651 (2002) |
| 1999 |
|---|
| 8 | | Andris Ambainis,
Stephen A. Bloch,
David L. Schweizer:
Playing Twenty Questions with a Procrastinator.
SODA 1999: 844-845 |
| 1998 |
|---|
| 7 | | Stephen A. Bloch,
Jonathan F. Buss,
Judy Goldsmith:
Sharply Bounded Alternation and Quasilinear Time.
Theory Comput. Syst. 31(2): 187-214 (1998) |
| 1997 |
|---|
| 6 | | Stephen A. Bloch:
On Parallel Hierarchies and Rik.
Ann. Pure Appl. Logic 89(2-3): 231-273 (1997) |
| 1996 |
|---|
| 5 | | Stephen A. Bloch,
Jonathan F. Buss,
Judy Goldsmith:
Sharply Bounded Alternation within P
Electronic Colloquium on Computational Complexity (ECCC) 3(11): (1996) |
| 1994 |
|---|
| 4 | | Stephen A. Bloch:
On Parallel Hierarchies and R_k^i.
LCC 1994: 52-76 |
| 3 | | Stephen A. Bloch:
Function-Algebraic Characterizations of Log and Polylog Parallel Time.
Computational Complexity 4: 175-205 (1994) |
| 2 | | Stephen A. Bloch,
Jonathan F. Buss,
Judy Goldsmith:
How hard are n2-hard problems?
SIGACT News 25(2): 83-85 (1994) |
| 1992 |
|---|
| 1 |  | Stephen A. Bloch:
Functional Characterizations of Uniform Log-depth and Polylog-depth Circuit Families.
Structure in Complexity Theory Conference 1992: 193-206 |
Data released under the ODC-BY 1.0 license — See also our legal information page