| 2007 |
|---|
| 56 | EE | Andreas Krebs,
Klaus-Jörn Lange,
Stephanie Reifferscheid:
Characterizing TC0 in Terms of Infinite Groups.
Theory Comput. Syst. 40(4): 303-325 (2007) |
| 2006 |
|---|
| 55 | EE | Christoph Behle,
Klaus-Jörn Lange:
FO[<]-Uniformity.
IEEE Conference on Computational Complexity 2006: 183-189 |
| 2005 |
|---|
| 54 | EE | Andreas Krebs,
Klaus-Jörn Lange,
Stephanie Reifferscheid:
Characterizing TC0 in Terms of Infinite Groups.
STACS 2005: 496-507 |
| 53 | EE | Bernd Borchert,
Klaus-Jörn Lange,
Frank Stephan,
Pascal Tesson,
Denis Thérien:
The dot-depth and the polynomial hierarchies correspond on the delta levels.
Int. J. Found. Comput. Sci. 16(4): 625-644 (2005) |
| 2004 |
|---|
| 52 | EE | Bernd Borchert,
Klaus-Jörn Lange,
Frank Stephan,
Pascal Tesson,
Denis Thérien:
The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels.
Developments in Language Theory 2004: 89-101 |
| 51 | EE | Klaus-Jörn Lange:
Some Results on Majority Quantifiers over Words.
IEEE Conference on Computational Complexity 2004: 123-129 |
| 2001 |
|---|
| 50 | | David A. Mix Barrington,
Peter Kadau,
Klaus-Jörn Lange,
Pierre McKenzie:
On the Complexity of Some Problems on Groups Input as Multiplication Tables.
J. Comput. Syst. Sci. 63(2): 186-200 (2001) |
| 2000 |
|---|
| 49 | EE | David A. Mix Barrington,
Peter Kadau,
Klaus-Jörn Lange,
Pierre McKenzie:
On the Complexity of Some Problems on Groups Input as Multiplication Tables.
IEEE Conference on Computational Complexity 2000: 62-69 |
| 48 | | Klaus-Jörn Lange,
Rolf Niedermeier:
Data Independence of Read, Write, and Control Structures in PRAM Computations.
J. Comput. Syst. Sci. 60(1): 109-144 (2000) |
| 47 | | Klaus-Jörn Lange,
Pierre McKenzie,
Alain Tapp:
Reversible Space Equals Deterministic Space.
J. Comput. Syst. Sci. 60(2): 354-367 (2000) |
| 1998 |
|---|
| 46 | EE | Klaus-Jörn Lange,
Pierre McKenzie:
On the Complexity of Free Monoid Morphisms.
ISAAC 1998: 247-256 |
| 45 | EE | Eric Allender,
Klaus-Jörn Lange:
RUSPACE(log n) $\subseteq$ DSPACE (log2 n / log log n).
Theory Comput. Syst. 31(5): 539-550 (1998) |
| 1997 |
|---|
| 44 | EE | Klaus-Jörn Lange:
Are There Formal Languages Complete for SymSPACE(log n)?
Foundations of Computer Science: Potential - Theory - Cognition 1997: 125-134 |
| 43 | EE | Klaus-Jörn Lange,
Pierre McKenzie,
Alain Tapp:
Reversible Space Equals Deterministic Space.
IEEE Conference on Computational Complexity 1997: 45-50 |
| 42 | | Markus Holzer,
Klaus-Jörn Lange:
On the Complexity of Iterated Insertions.
New Trends in Formal Languages 1997: 440-453 |
| 41 | | Klaus-Jörn Lange:
On the Distributed Realization of Parallel Algorithms.
SOFSEM 1997: 37-52 |
| 40 | | Klaus-Jörn Lange:
An Unambiguous Class Possessing a Complete Set.
STACS 1997: 339-350 |
| 1996 |
|---|
| 39 | | Henning Fernau,
Klaus-Jörn Lange,
Klaus Reinhardt:
Advocating Ownership.
FSTTCS 1996: 286-297 |
| 38 | | Eric Allender,
Klaus-Jörn Lange:
StUSPACE(log n) <= DSPACE(log²n / log log n).
ISAAC 1996: 193-202 |
| 37 | EE | Eric Allender,
Klaus-Jörn Lange:
StUSPACE(log n) is Contained in DSPACE((log2n)/loglog n)
Electronic Colloquium on Computational Complexity (ECCC) 3(48): (1996) |
| 36 | | Klaus-Jörn Lange:
Complexity and Structure in Formal Language Theory.
Fundam. Inform. 25(3): 327-352 (1996) |
| 1995 |
|---|
| 35 | | Yosi Ben-Asher,
Klaus-Jörn Lange,
David Peleg,
Assaf Schuster:
The Complexity of Reconfiguring Network Models
Inf. Comput. 121(1): 41-58 (1995) |
| 1994 |
|---|
| 34 | | Klaus-Jörn Lange,
Klaus Reinhardt:
Empty Alternation.
MFCS 1994: 494-503 |
| 33 | | Klaus-Jörn Lange,
Peter Rossmanith:
Unambiguous Polynomial Hierarchies and Exponential Size.
Structure in Complexity Theory Conference 1994: 106-115 |
| 1993 |
|---|
| 32 | | Carsten Damm,
Markus Holzer,
Klaus-Jörn Lange,
Peter Rossmanith:
Deterministic OL Languages are of Very Low Complexity: DOL is in AC0.
Developments in Language Theory 1993: 305-313 |
| 31 | | Markus Holzer,
Klaus-Jörn Lange:
On the Complexities of Linear LL(1) and LR(1) Grammars.
FCT 1993: 299-308 |
| 30 | | Klaus-Jörn Lange,
Rolf Niedermeier:
Data-Independences of Parallel Random Access Machines.
FSTTCS 1993: 104-113 |
| 29 | | Klaus-Jörn Lange:
Complexity and Structure in Formal Language Theory.
Structure in Complexity Theory Conference 1993: 224-238 |
| 28 | | Klaus-Jörn Lange:
Unambiguity of Circuits.
Theor. Comput. Sci. 107(1): 77-94 (1993) |
| 1992 |
|---|
| 27 | | Carsten Damm,
Markus Holzer,
Klaus-Jörn Lange:
Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers.
MFCS 1992: 227-235 |
| 26 | | Klaus-Jörn Lange,
Peter Rossmanith,
Wojciech Rytter:
Parallel Recognition and Ranking of Context-Free Languages.
MFCS 1992: 24-36 |
| 25 | | Klaus-Jörn Lange,
Peter Rossmanith:
The Emptiness Problem for Intersections of Regular Languages.
MFCS 1992: 346-354 |
| 1991 |
|---|
| 24 | | Dominik Gomm,
Michael Heckner,
Klaus-Jörn Lange,
Gerhard Riedle:
On the Design of Parallel Programs for Machines with Distributed Memory.
EDMCC 1991: 381-391 |
| 23 | | Gerhard Buntrock,
Birgit Jenner,
Klaus-Jörn Lange,
Peter Rossmanith:
Unambiguity and Fewness for Logarithmic Space.
FCT 1991: 168-179 |
| 22 | | Jürgen Dassow,
Klaus-Jörn Lange:
Computational Calculus and Hardest Languages of Automata with Abstract Storages.
FCT 1991: 200-209 |
| 1990 |
|---|
| 21 | | Klaus-Jörn Lange,
Peter Rossmanith:
Characterizing Unambiguous Augmented Pushdown Automata by Circuits.
MFCS 1990: 399-406 |
| 20 | | Klaus-Jörn Lange:
Unambiguity of Circuits.
Structure in Complexity Theory Conference 1990: 130-137 |
| 1989 |
|---|
| 19 | | Birgit Jenner,
Bernd Kirsig,
Klaus-Jörn Lange:
The Logarithmic Alternation Hierarchy Collapses: A \sum^\calL_2=APi^\calL_2
Inf. Comput. 80(3): 269-287 (1989) |
| 1988 |
|---|
| 18 | | Klaus-Jörn Lange:
Complexity Theory and Formal Languages.
IMYCS 1988: 19-36 |
| 17 | | Klaus-Jörn Lange:
Decompositions of Nondeterministic Reductions.
Theor. Comput. Sci. 58: 175-181 (1988) |
| 1987 |
|---|
| 16 | | Matthias Jantzen,
Manfred Kudlek,
Klaus-Jörn Lange,
Holger Petersen:
Dyck1-Reductions of Context-free Languages.
FCT 1987: 218-227 |
| 15 | | Klaus-Jörn Lange,
Birgit Jenner,
Bernd Kirsig:
The Logarithmic Alternation Hierarchiy Collapses: A Sigma^C_2 = A Pi^C_2.
ICALP 1987: 531-541 |
| 14 | | Klaus-Jörn Lange,
Michael Schudy:
A further link between formal languages and complexity theory.
Bulletin of the EATCS 33: 67-70 (1987) |
| 13 | | Bernd Kirsig,
Klaus-Jörn Lange:
Separation with the Ruzzo, Simon, and Tompa Relativization Implies DSPACE(log n) != NSPACE(log n).
Inf. Process. Lett. 25(1): 13-15 (1987) |
| 1986 |
|---|
| 12 | | Klaus-Jörn Lange:
Decompositions of Nondeterministic Reductions (Extended Abstract).
ICALP 1986: 206-214 |
| 11 | | Klaus-Jörn Lange:
Two Characterizations of the Logarithmic Alternation Hierarchy.
MFCS 1986: 518-526 |
| 1985 |
|---|
| 10 | | Klaus-Jörn Lange,
Emo Welzl:
String grammars with disconnecting.
FCT 1985: 249-256 |
| 9 | | Wilfried Brauer,
Klaus-Jörn Lange:
Non-Deterministic Two-Tape Automata are More Powerful Then Deterministic Ones.
STACS 1985: 71-79 |
| 8 | | Klaus-Jörn Lange:
A note on the closure of EDL-languages under erasing homomorphisms.
Bulletin of the EATCS 25: 22-23 (1985) |
| 7 | | Klaus-Jörn Lange:
Addendum to "A note on the closure of EOL languages under erasing homomorphismus".
Bulletin of the EATCS 26: 55 (1985) |
| 6 | | Klaus-Jörn Lange,
Emo Welzl:
Recurrent Words and Simultaneous Growth in T0L Systems.
Theor. Comput. Sci. 35: 1-15 (1985) |
| 1984 |
|---|
| 5 | | Klaus-Jörn Lange:
Nondeterministic Logspace Reductions.
MFCS 1984: 378-388 |
| 4 | | Klaus-Jörn Lange:
DTOL Systems and Catenativity.
Elektronische Informationsverarbeitung und Kybernetik 20(2/3): 81-92 (1984) |
| 1983 |
|---|
| 3 | | Klaus-Jörn Lange:
Context-Free Controlled ETOL Systems.
ICALP 1983: 723-733 |
| 1982 |
|---|
| 2 | | Takashi Yokomori,
Derick Wood,
Klaus-Jörn Lange:
A Three-Restricted Normal Form Theorem for ET0L Languages.
Inf. Process. Lett. 14(3): 97-100 (1982) |
| 1980 |
|---|
| 1 | | Klaus-Jörn Lange:
Equivalence of Adult Languages and Extensions for DTOL Systems
Information and Control 47(2): 107-112 (1980) |
