2008 |
24 | EE | Jonathan F. Buss,
Tarique Mesbaul Islam:
The complexity of fixed-parameter problems: guest column.
SIGACT News 39(1): 33-46 (2008) |
2007 |
23 | EE | Jonathan F. Buss,
Tarique Islam:
Algorithms in the W-Hierarchy.
Theory Comput. Syst. 41(3): 445-457 (2007) |
2006 |
22 | EE | Jonathan F. Buss,
Tarique Islam:
Simplifying the weft hierarchy.
Theor. Comput. Sci. 351(3): 303-313 (2006) |
2004 |
21 | EE | Jonathan F. Buss,
Tarique Islam:
Simplifying the Weft Hierarchy.
IWPEC 2004: 187-199 |
2003 |
20 | EE | Therese C. Biedl,
Jonathan F. Buss,
Erik D. Demaine,
Martin L. Demaine,
Mohammad Taghi Hajiaghayi,
Tomás Vinar:
Palindrome recognition using a multidimensional tape.
Theor. Comput. Sci. 302(1-3): 475-480 (2003) |
2001 |
19 | | Neil Immerman,
Jonathan F. Buss,
David A. Mix Barrington:
Number of Variables Is Equivalent to Space.
J. Symb. Log. 66(3): 1217-1230 (2001) |
1999 |
18 | | Jonathan F. Buss,
Gudmund Skovbjerg Frandsen,
Jeffrey Shallit:
The Computational Complexity of Some Problems of Linear Algebra.
J. Comput. Syst. Sci. 58(3): 572-596 (1999) |
1998 |
17 | EE | Prosenjit Bose,
Jonathan F. Buss,
Anna Lubiw:
Pattern Matching for Permutations.
Inf. Process. Lett. 65(5): 277-283 (1998) |
16 | EE | Greg Barnes,
Jonathan F. Buss,
Walter L. Ruzzo,
Baruch Schieber:
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity.
SIAM J. Comput. 27(5): 1273-1282 (1998) |
15 | | Stephen A. Bloch,
Jonathan F. Buss,
Judy Goldsmith:
Sharply Bounded Alternation and Quasilinear Time.
Theory Comput. Syst. 31(2): 187-214 (1998) |
1997 |
14 | | Jonathan F. Buss,
Gudmund Skovbjerg Frandsen,
Jeffrey Shallit:
The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract).
STACS 1997: 451-462 |
13 | EE | Jonathan F. Buss,
Gudmund Skovbjerg Frandsen,
Jeffrey Shallit:
The Computational Complexity of Some Problems of Linear Algebra
Electronic Colloquium on Computational Complexity (ECCC) 4(9): (1997) |
1996 |
12 | EE | Stephen A. Bloch,
Jonathan F. Buss,
Judy Goldsmith:
Sharply Bounded Alternation within P
Electronic Colloquium on Computational Complexity (ECCC) 3(11): (1996) |
11 | | Jonathan F. Buss,
Paris C. Kanellakis,
Prabhakar Ragde,
Alexander A. Shvartsman:
Parallel Algorithms with Processor Failures and Delays.
J. Algorithms 20(1): 45-86 (1996) |
1995 |
10 | | Jonathan F. Buss,
Martin Tompa:
Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five
Inf. Comput. 120(2): 326-329 (1995) |
1993 |
9 | | Prosenjit Bose,
Jonathan F. Buss,
Anna Lubiw:
Pattern Matching for Permutations.
WADS 1993: 200-209 |
8 | | Jonathan F. Buss,
Judy Goldsmith:
Nondeterminism Within P.
SIAM J. Comput. 22(3): 560-572 (1993) |
1992 |
7 | | Greg Barnes,
Jonathan F. Buss,
Walter L. Ruzzo,
Baruch Schieber:
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
Structure in Complexity Theory Conference 1992: 27-33 |
1991 |
6 | | Jonathan F. Buss,
Judy Goldsmith:
Nondterminism Within P.
STACS 1991: 348-359 |
1990 |
5 | EE | Jonathan F. Buss:
Processor Networks and Alternating Machines.
SPAA 1990: 103-108 |
1989 |
4 | | Jonathan F. Buss,
Arnold L. Rosenberg,
Judson D. Knott:
Vertex Types in Book-Embeddings.
SIAM J. Discrete Math. 2(2): 156-175 (1989) |
1988 |
3 | | Jonathan F. Buss:
Relativized Alternation and Space-Bounded Computation.
J. Comput. Syst. Sci. 36(3): 351-378 (1988) |
1986 |
2 | | Jonathan F. Buss:
Relativized Alternation.
Structure in Complexity Theory Conference 1986: 66-76 |
1984 |
1 | | Jonathan F. Buss,
Peter W. Shor:
On the Pagenumber of Planar Graphs
STOC 1984: 98-100 |