On the Pagenumber of Planar Graphs - Jonathan F. Buss; Peter W. Shor (STOC, 1984)

Relativized Alternation. - Jonathan F. Buss (SCT, 1986)

A theory of oracle machines. - Jonathan F. Buss (SCT, 1987)

Relativized Alternation and Space-Bounded Computation. - Jonathan F. Buss (J. Comput. Syst. Sci., 1988)

Vertex Types in Book-Embeddings. - Jonathan F. Buss; Arnold L. Rosenberg; Judson D. Knott (SIAM J. Discret. Math., 1989)

Processor Networks and Alternating Machines. - Jonathan F. Buss (SPAA, 1990)

Nondterminism Within P. - Jonathan F. Buss; Judy Goldsmith (STACS, 1991)

A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity - Greg Barnes; Jonathan F. Buss; Walter L. Ruzzo; Baruch Schieber (SCT, 1992)

Nondeterminism Within P. - Jonathan F. Buss; Judy Goldsmith (SIAM J. Comput., 1993)

How hard are n2-hard problems? - Stephen A. Bloch; Jonathan F. Buss; Judy Goldsmith (SIGACT News, 1994)

Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five - Jonathan F. Buss; Martin Tompa (Inf. Comput., 1995)

Sharply Bounded Alternation within P - Stephen A. Bloch; Jonathan F. Buss; Judy Goldsmith (Electron. Colloquium Comput. Complex., 1996)

Parallel Algorithms with Processor Failures and Delays. - Jonathan F. Buss; Paris C. Kanellakis; Prabhakar Ragde; Alexander A. Shvartsman (J. Algorithms, 1996)

The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract). - Jonathan F. Buss; Gudmund Skovbjerg Frandsen; Jeffrey O. Shallit (STACS, 1997)

Pattern Matching for Permutations. - Prosenjit Bose; Jonathan F. Buss; Anna Lubiw (Inf. Process. Lett., 1998)

Sharply Bounded Alternation and Quasilinear Time. - Stephen A. Bloch; Jonathan F. Buss; Judy Goldsmith (Theory Comput. Syst., 1998)

A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity. - Greg Barnes; Jonathan F. Buss; Walter L. Ruzzo; Baruch Schieber (SIAM J. Comput., 1998)

The Computational Complexity of Some Problems of Linear Algebra. - Jonathan F. Buss; Gudmund Skovbjerg Frandsen; Jeffrey O. Shallit (J. Comput. Syst. Sci., 1999)

Number of Variables Is Equivalent to Space. - Neil Immerman; Jonathan F. Buss; David A. Mix Barrington (J. Symb. Log., 2001)

Palindrome recognition using a multidimensional tape. - Therese Biedl; Jonathan F. Buss; Erik D. Demaine; Martin L. Demaine; Mohammad Taghi Hajiaghayi; Tomás Vinar (Theor. Comput. Sci., 2003)

Simplifying the weft hierarchy. - Jonathan F. Buss; Tarique Islam (Theor. Comput. Sci., 2006)

Algorithms in the W-Hierarchy. - Jonathan F. Buss; Tarique Islam (Theory Comput. Syst., 2007)

The complexity of fixed-parameter problems: guest column. - Jonathan F. Buss; Tarique Mesbaul Islam (SIGACT News, 2008)

Imbalance, Cutwidth, and the Structure of Optimal Orderings. - Jan Gorzny; Jonathan F. Buss (COCOON, 2019)