#### Filter Results:

- Full text PDF available (11)

#### Publication Year

1984

2014

- This year (0)
- Last 5 years (1)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jonathan F. Buss, Judy Goldsmith
- SIAM J. Comput.
- 1993

Classes of machines using very limited amounts of nondeterminism are studied. The P =? NP question is related to questions about classes lying within P . Complete sets for these classes are given.â€¦ (More)

- Prosenjit Bose, Jonathan F. Buss, Anna Lubiw
- WADS
- 1993

- Jonathan F. Buss, Paris C. Kanellakis, Prabhakar Ragde, Alexander A. Shvartsman
- J. Algorithms
- 1996

We study eecient deterministic parallel algorithms on two models: restartable fail-stop CRCW PRAMs and asynchronous PRAMs. In the rst model, synchronous processors are subject to arbitrary stopâ€¦ (More)

- Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit
- Electronic Colloquium on Computational Complexity
- 1997

We consider the computational complexity of some problems dealing with matrix rank. Let E, S be subsets of a commutative ring R. Let x1 , x2 , ..., xt be variables. Given a matrix M=M(x1 , x2 , ...,â€¦ (More)

- Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber
- SIAM J. Comput.
- 1998

Directed s-t connectivity is the problem of detecting whether there is a path from vertex s to vertex t in a directed graph. We present the rst known deterministic sublinear space, polynomial timeâ€¦ (More)

- Jonathan F. Buss, Tarique Islam
- Theory of Computing Systems
- 2007

We show new upper bounds for problems in the W-hierarchy of fixed-parameter complexity. A crucial ingredient of our proofs is an extension to the W-RAM model, which permits more-powerful operationsâ€¦ (More)

- Jonathan F. Buss
- J. Comput. Syst. Sci.
- 1988

- Jonathan F. Buss, Peter W. Shor
- STOC
- 1984

The pa#enumber or book thickness of a graph is the minimum number of pages required to embed the graph in a book; i.e., if the vertices are arranged along the spine of a book, the pagenumber is theâ€¦ (More)

- Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
- SIGACT News
- 1994

Many of the "n2-hard" problems described by Gajentaan and Overmars can be solved using limited nondeterminism or other sharply-bounded quantifiers. Thus we suggest that problems are not among theâ€¦ (More)

- Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber
- Structure in Complexity Theory Conference
- 1992

Directed s-t connectivity is the problem of detecting whether there is a path from vertex s to vertex t in a directed graph. We present the rst known deterministic sublinear space, polynomial timeâ€¦ (More)