The Computational Complexity of Some Problems of Linear Algebra von Buss, Jonathan F, Frandsen, Gudmund S, Shallit, Jeffrey O

Volltext

Simplifying the weft hierarchy von Buss, Jonathan F., Islam, Tarique

Volltext

Pattern matching for permutations von Bose, Prosenjit, Buss, Jonathan F., Lubiw, Anna

Volltext

Imbalance, Cutwidth, and the Structure of Optimal Orderings von Gorzny, Jan, Buss, Jonathan F.

Volltext

Algorithms in the W-Hierarchy von Buss, Jonathan F., Islam, Tarique

Volltext

Nondeterminism within P von BUSS, J. F, GOLDSMITH, J

Volltext

A sublinear space, polynomial time algorithm for directed s-t connectivity von BARNES, G, BUSS, J. F, RUZZO, W. L, SCHIEBER, B

Volltext

Palindrome recognition using a multidimensional tape von Biedl, Therese, Buss, Jonathan F., Demaine, Erik D., Demaine, Martin L., Hajiaghayi, Mohammadtaghi, Vinař, Tomáš

Volltext

Simplifying the Weft Hierarchy von Buss, Jonathan F., Islam, Tarique

Volltext

Number of variables is equivalent to space von Immerman, Neil, Buss, Jonathan F., Barrington, David A. Mix

Volltext

Relativized alternation and space-bounded computation von Buss, Jonathan F.

Volltext

The Computational Complexity of Some Problems of Linear Algebra von Buss, Jonathan F., Frandsen, Gudmund Skovbjerg, Shallit, Jeffery O.

Volltext

Vertex Types in Book-Embeddings von Buss, Jonathan F., Rosenberg, Arnold L., Knott, Judson D.

Volltext

Pattern matching for permutations von Bose, Prosenjit, Buss, Jonathan F., Lubiw, Anna

Volltext

The computational complexity of some problems of linear algebra: Extended abstract von Buss, Jonathan F., Frandsen, Gudmund S., Shallit, Jeffrey O.

Volltext

The complexity of fixed-parameter problems: guest column von Buss, Jonathan F., Islam, Tarique M.

Volltext

Parallel Algorithms with Processor Failures and Delays von Buss, Jonathan F., Kanellakis, Paris C., Ragde, Prabhakar L., Shvartsman, Alex Allister

Volltext

Relativized alternation von Buss, Jonathan F.

Volltext

Nondeterminism within P von Buss, Jonathan F., Goldsmith, Judy

Volltext

How hard are n2-hard problems? von Bloch, Stephen A, Buss, Jonathan F, Goldsmith, Judy

Volltext