| 2002 | ||
|---|---|---|
| j5 | 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 | ||
| c3 | Andris Ambainis, Stephen A. Bloch, David L. Schweizer: Playing Twenty Questions with a Procrastinator. SODA 1999: 844-845 | |
| 1998 | ||
| j4 | Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith: Sharply Bounded Alternation and Quasilinear Time. Theory Comput. Syst. 31(2): 187-214 (1998) | |
| 1997 | ||
| j3 | ||
| 1996 | ||
| i1 | Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith: Sharply Bounded Alternation within P. Electronic Colloquium on Computational Complexity (ECCC) 3(11) (1996) | |
| 1994 | ||
| j2 | Stephen A. Bloch: Function-Algebraic Characterizations of Log and Polylog Parallel Time. Computational Complexity 4: 175-205 (1994) | |
| j1 | Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith: How hard are n2-hard problems? SIGACT News 25(2): 83-85 (1994) | |
| c2 | ||
| 1992 | ||
| c1 | Stephen A. Bloch: Functional Characterizations of Uniform Log-depth and Polylog-depth Circuit Families. Structure in Complexity Theory Conference 1992: 193-206 | |
| 1 | Andris Ambainis | |
| 2 | Jonathan F. Buss | |
| 3 | Judy Goldsmith | |
| 4 | David L. Schweizer |
Colors in the list of coauthors
Last update Wed May 22 08:11:26 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page