Jonathan F. Buss

28 papers A* 1A 2B 2Misc 1Journal 17Unranked 5
YearRankTypeTitle / Venue / Authors
2019 Misc conf
Imbalance, Cutwidth, and the Structure of Optimal Orderings.
COCOON
Jan Gorzny, Jonathan F. Buss
2008 J jnl
The complexity of fixed-parameter problems: guest column.
SIGACT News
Jonathan F. Buss, Tarique Mesbaul Islam
2007 J jnl
Algorithms in the W-Hierarchy.
Theory Comput. Syst.
Jonathan F. Buss, Tarique Islam
2006 J jnl
Simplifying the weft hierarchy.
Theor. Comput. Sci.
Jonathan F. Buss, Tarique Islam
2004 — conf
Simplifying the Weft Hierarchy.
IWPEC
Jonathan F. Buss, Tarique Islam
2003 J jnl
Palindrome recognition using a multidimensional tape.
Theor. Comput. Sci.
Therese Biedl, Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, Mohammad Taghi Hajiaghayi, Tomás Vinar
2001 J jnl
Number of Variables Is Equivalent to Space.
J. Symb. Log.
Neil Immerman, Jonathan F. Buss, David A. Mix Barrington
1999 J jnl
The Computational Complexity of Some Problems of Linear Algebra.
J. Comput. Syst. Sci.
Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit
1998 J jnl
A Sublinear Space, Polynomial Time Algorithm for Directed
SIAM J. Comput.
Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber
1998 J jnl
Pattern Matching for Permutations.
Inf. Process. Lett.
Prosenjit Bose, Jonathan F. Buss, Anna Lubiw
1998 J jnl
Sharply Bounded Alternation and Quasilinear Time.
Theory Comput. Syst.
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
1997 J jnl
The Computational Complexity of Some Problems of Linear Algebra
Electron. Colloquium Comput. Complex.
Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit
1997 A conf
The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract).
STACS
Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit
1996 J jnl
Parallel Algorithms with Processor Failures and Delays.
J. Algorithms
Jonathan F. Buss, Paris C. Kanellakis, Prabhakar Ragde, Alexander A. Shvartsman
1996 J jnl
Sharply Bounded Alternation within P
Electron. Colloquium Comput. Complex.
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
1996 — conf
Sharply Bounded Alternation within P.
DMTCS
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
1995 J jnl
Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five
Inf. Comput.
Jonathan F. Buss, Martin Tompa
1994 J jnl
How hard are n2-hard problems?
SIGACT News
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
1993 J jnl
Nondeterminism Within P.
SIAM J. Comput.
Jonathan F. Buss, Judy Goldsmith
1993 B conf
Pattern Matching for Permutations.
WADS
Prosenjit Bose, Jonathan F. Buss, Anna Lubiw
1992 — conf
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
SCT
Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber
1991 A conf
Nondterminism Within P.
STACS
Jonathan F. Buss, Judy Goldsmith
1990 B conf
Processor Networks and Alternating Machines.
SPAA
Jonathan F. Buss
1989 J jnl
Vertex Types in Book-Embeddings.
SIAM J. Discret. Math.
Jonathan F. Buss, Arnold L. Rosenberg, Judson D. Knott
1988 J jnl
Relativized Alternation and Space-Bounded Computation.
J. Comput. Syst. Sci.
Jonathan F. Buss
1987 — conf
A theory of oracle machines.
SCT
Jonathan F. Buss
1986 — conf
Relativized Alternation.
SCT
Jonathan F. Buss
1984 A* conf
On the Pagenumber of Planar Graphs
STOC
Jonathan F. Buss, Peter W. Shor