Jonathan F. Buss

Publication Activity (10 Years)

Years Active: 1984-2019
Publications (10 Years): 1

Top Topics

Optimal Strategy

Top Venues

Publications

Jan Gorzny, Jonathan F. Buss
Imbalance, Cutwidth, and the Structure of Optimal Orderings. COCOON (2019)
Jonathan F. Buss, Tarique Mesbaul Islam
The complexity of fixed-parameter problems: guest column. SIGACT News 39 (1) (2008)
Jonathan F. Buss, Tarique Islam
Algorithms in the W-Hierarchy. Theory Comput. Syst. 41 (3) (2007)
Jonathan F. Buss, Tarique Islam
Simplifying the weft hierarchy. Theor. Comput. Sci. 351 (3) (2006)
Jonathan F. Buss, Tarique Islam
Simplifying the Weft Hierarchy. IWPEC (2004)
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) (2003)
Neil Immerman, Jonathan F. Buss, David A. Mix Barrington
Number of Variables Is Equivalent to Space. J. Symb. Log. 66 (3) (2001)
Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit
The Computational Complexity of Some Problems of Linear Algebra. J. Comput. Syst. Sci. 58 (3) (1999)
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
Sharply Bounded Alternation and Quasilinear Time. Theory Comput. Syst. 31 (2) (1998)
Prosenjit Bose, Jonathan F. Buss, Anna Lubiw
Pattern Matching for Permutations. Inf. Process. Lett. 65 (5) (1998)
Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber
Connectivity. SIAM J. Comput. 27 (5) (1998)
Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit
The Computational Complexity of Some Problems of Linear Algebra Electron. Colloquium Comput. Complex. 4 (9) (1997)
Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit
The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract). STACS (1997)
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
Sharply Bounded Alternation within P. DMTCS (1996)
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
Sharply Bounded Alternation within P Electron. Colloquium Comput. Complex. 3 (11) (1996)
Jonathan F. Buss, Paris C. Kanellakis, Prabhakar Ragde, Alexander A. Shvartsman
Parallel Algorithms with Processor Failures and Delays. J. Algorithms 20 (1) (1996)
Jonathan F. Buss, Martin Tompa
Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five Inf. Comput. 120 (2) (1995)
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
How hard are n2-hard problems? SIGACT News 25 (2) (1994)
Jonathan F. Buss, Judy Goldsmith
Nondeterminism Within P. SIAM J. Comput. 22 (3) (1993)
Prosenjit Bose, Jonathan F. Buss, Anna Lubiw
Pattern Matching for Permutations. WADS (1993)
Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity Computational Complexity Conference (1992)
Jonathan F. Buss, Judy Goldsmith
Nondterminism Within P. STACS (1991)
Jonathan F. Buss
Processor Networks and Alternating Machines. SPAA (1990)
Jonathan F. Buss, Arnold L. Rosenberg, Judson D. Knott
Vertex Types in Book-Embeddings. SIAM J. Discret. Math. 2 (2) (1989)
Jonathan F. Buss
Relativized Alternation and Space-Bounded Computation. J. Comput. Syst. Sci. 36 (3) (1988)
Jonathan F. Buss
A theory of oracle machines. Computational Complexity Conference (1987)
Jonathan F. Buss
Relativized Alternation. Computational Complexity Conference (1986)
Jonathan F. Buss, Peter W. Shor
On the Pagenumber of Planar Graphs STOC (1984)