Jonathan F. Buss

Available identifiers

Publication	Date of Publication	Type
Pattern matching for permutations	2023-01-18	Paper
The computational complexity of some problems of linear algebra	2022-11-09	Paper
Imbalance, cutwidth, and the structure of optimal orderings	2020-02-24	Paper
Pattern matching for permutations	2016-06-09	Paper
Algorithms in the W-hierarchy	2007-12-19	Paper
Simplifying the weft hierarchy	2006-04-06	Paper
Parameterized and Exact Computation	2005-08-23	Paper
Palindrome recognition using a multidimensional tape.	2003-08-17	Paper
Number of variables is equivalent to space	2001-12-06	Paper
The computational complexity of some problems of linear algebra	2000-02-08	Paper
https://portal.mardi4nfdi.de/entity/Q4217586	1999-03-02	Paper
Planar mesh refinement cannot be both local and regular	1998-12-02	Paper
A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity	1998-09-20	Paper
Sharply bounded alternation and quasilinear time	1998-05-26	Paper
Parallel Algorithms with Processor Failures and Delays	1996-02-20	Paper
Lower bounds on universal traversal sequences based on chains of length five	1995-09-17	Paper
Nondeterminism within $P^ * $	1993-09-01	Paper
https://portal.mardi4nfdi.de/entity/Q4035683	1993-05-18	Paper
Vertex Types in Book-Embeddings	1989-01-01	Paper
Relativized alternation and space-bounded computation	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4721649	1986-01-01	Paper

This page was built for person: Jonathan F. Buss