|
36
|
Structure and Importance of Logspace-MOD-Classes
– Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel
- 1992
|
|
10
|
Advocating Ownership
– Henning Fernau, Klaus-Jörn Lange, Klaus Reinhardt
- 1996
|
|
6
|
Unambiguous polynomial hierarchies and exponential size
– Peter Rossmanith
- 1994
|
|
8
|
Unambiguous Computations and Locally Definable Acceptance Types
– Rolf Niedermeier, Peter Rossmanith
- 1998
|
|
4
|
Empty alternation
– Klaus-jörn Lange, Klaus Reinhardt
- 1994
|
|
5
|
Unambiguous Simulations of Auxiliary Pushdown Automata and Circuits
– Rolf Niedermeier, Peter Rossmanith
- 1992
|
|
1
|
Counting and empty alternating pushdown automata
– Klaus Reinhardt
- 1992
|
|
17
|
Isolation, Matching, and Counting: Uniform and Nonuniform Upper Bounds
– Eric Allender, Klaus Reinhardt, Shiyu Zhon
- 1998
|
|
|
On the Complexity of Iterated Insertions
– Markus Holzer, Klaus-Jörn Lange
- 1997
|
|
|
StUSPACE(log n) \subseteq DSPACE(log² n/ log log n)
– Eric Allender, Klaus-Jörn Lange
|
|
|
RUSPACE(log n) \subseteq DSPACE(log² n/log log n)
– Eric Allender, Klaus-Jörn Lange
- 1998
|
|
30
|
Making Nondeterminism Unambiguous
– Klaus Reinhardt, Eric Allender
- 1997
|
|
19
|
The Complexity of Reconfiguring Network Models
– Y. Ben-asher, K. -j. Lange, D. Peleg, A. Schuster
- 1992
|
|
1
|
Data-Independence of Read, Write, and Control Structures in PRAM computations
– Klaus-Jörn Lange, Rolf Niedermeier
- 1998
|
|
3
|
Uniform Circuits and Exclusive Read PRAMs
– Inga Niepel, Peter Rossmanith
- 1991
|
|
3
|
Conditional Context-Free Languages of Finite Index
– Henning Fernau, Markus Holzer
- 1997
|
|
4
|
Some observations about relativization of space bounded computations
– Juris Hartmanis, Richard Chang, Jim Kadin, Stephen G. Mitchell
- 1988
|
|
21
|
Logspace and Logtime Leaf Languages
– Birgit Jenner, Pierre McKenzie, Denis Thérien
- 1996
|
|
22
|
On the Hardness of Graph Isomorphism
– Jacobo Torán
|
