Equivalence of Adult Languages and Extensions for DTOL Systems - Klaus-Jörn Lange (Inf. Control., 1980)

A Three-Restricted Normal Form Theorem for ET0L Languages. - Takashi Yokomori; Derick Wood; Klaus-Jörn Lange (Inf. Process. Lett., 1982)

Kontextfrei kontrollierte ETOL-Systeme. - Klaus-Jörn Lange (1982)

Context-Free Controlled ETOL Systems. - Klaus-Jörn Lange (ICALP, 1983)

Nondeterministic Logspace Reductions. - Klaus-Jörn Lange (MFCS, 1984)

DTOL Systems and Catenativity. - Klaus-Jörn Lange (J. Inf. Process. Cybern., 1984)

String grammars with disconnecting. - Klaus-Jörn Lange; Emo Welzl (FCT, 1985)

Non-Deterministic Two-Tape Automata are More Powerful Then Deterministic Ones. - Wilfried Brauer; Klaus-Jörn Lange (STACS, 1985)

Addendum to "A note on the closure of EOL languages under erasing homomorphismus". - Klaus-Jörn Lange (Bull. EATCS, 1985)

A note on the closure of EDL-languages under erasing homomorphisms. - Klaus-Jörn Lange (Bull. EATCS, 1985)

Recurrent Words and Simultaneous Growth in T0L Systems. - Klaus-Jörn Lange; Emo Welzl (Theor. Comput. Sci., 1985)

Decompositions of Nondeterministic Reductions (Extended Abstract). - Klaus-Jörn Lange (ICALP, 1986)

Two Characterizations of the Logarithmic Alternation Hierarchy. - Klaus-Jörn Lange (MFCS, 1986)

Dyck1-Reductions of Context-free Languages. - Matthias Jantzen; Manfred Kudlek; Klaus-Jörn Lange; Holger Petersen 001 (FCT, 1987)

The Logarithmic Alternation Hierarchiy Collapses: A Sigma^C_2 = A Pi^C_2. - Klaus-Jörn Lange; Birgit Jenner; Bernd Kirsig (ICALP, 1987)

String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing. - Klaus-Jörn Lange; Emo Welzl (Discret. Appl. Math., 1987)

A further link between formal languages and complexity theory. - Klaus-Jörn Lange; Michael Schudy (Bull. EATCS, 1987)

Separation with the Ruzzo, Simon, and Tompa Relativization Implies DSPACE(log n) != NSPACE(log n). - Bernd Kirsig; Klaus-Jörn Lange (Inf. Process. Lett., 1987)

Complexity Theory and Formal Languages. - Klaus-Jörn Lange (IMYCS, 1988)

Decompositions of Nondeterministic Reductions. - Klaus-Jörn Lange (Theor. Comput. Sci., 1988)

The Logarithmic Alternation Hierarchy Collapses: A∑2L = A∏2L. - Birgit Jenner; Bernd Kirsig; Klaus-Jörn Lange (Inf. Comput., 1989)

Characterizing Unambiguous Augmented Pushdown Automata by Circuits. - Klaus-Jörn Lange; Peter Rossmanith (MFCS, 1990)

Two results on unambiguous circuits - Klaus-Jörn Lange; Peter Rossmanith (Forschungsberichte, TU Munich, 1990)

On the Design of Parallel Programs for Machines with Distributed Memory. - Dominik Gomm; Michael Heckner; Klaus-Jörn Lange; Gerhard Riedle (EDMCC, 1991)

Unambiguity and Fewness for Logarithmic Space. - Gerhard Buntrock; Birgit Jenner; Klaus-Jörn Lange; Peter Rossmanith (FCT, 1991)

Computational Calculus and Hardest Languages of Automata with Abstract Storages. - Jürgen Dassow; Klaus-Jörn Lange (FCT, 1991)

Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers. - Carsten Damm; Markus Holzer 001; Klaus-Jörn Lange (MFCS, 1992)

The Emptiness Problem for Intersections of Regular Languages. - Klaus-Jörn Lange; Peter Rossmanith (MFCS, 1992)

Parallel Recognition and Ranking of Context-Free Languages. - Klaus-Jörn Lange; Peter Rossmanith; Wojciech Rytter (MFCS, 1992)

Deterministic OL Languages are of Very Low Complexity: DOL is in AC0. - Carsten Damm; Markus Holzer 001; Klaus-Jörn Lange; Peter Rossmanith (Developments in Language Theory, 1993)

On the Complexities of Linear LL(1) and LR(1) Grammars. - Markus Holzer 001; Klaus-Jörn Lange (FCT, 1993)

Data-Independences of Parallel Random Access Machines. - Klaus-Jörn Lange; Rolf Niedermeier (FSTTCS, 1993)

Unambiguity of Circuits. - Klaus-Jörn Lange (Theor. Comput. Sci., 1993)

Unambiguous Polynomial Hierarchies and Exponential Size. - Klaus-Jörn Lange; Peter Rossmanith (SCT, 1994)

Empty Alternation. - Klaus-Jörn Lange; Klaus Reinhardt (MFCS, 1994)

The Complexity of Reconfiguring Network Models - Yosi Ben-Asher; Klaus-Jörn Lange; David Peleg; Assaf Schuster (Inf. Comput., 1995)

Set Automata. - Klaus-Jörn Lange; Klaus Reinhardt (DMTCS, 1996)

Advocating Ownership. - Henning Fernau; Klaus-Jörn Lange; Klaus Reinhardt (FSTTCS, 1996)

StUSPACE(log n) <= DSPACE(log²n / log log n). - Eric Allender; Klaus-Jörn Lange (ISAAC, 1996)

StUSPACE(log n) is Contained in DSPACE((log2n)/loglog n) - Eric Allender; Klaus-Jörn Lange (Electron. Colloquium Comput. Complex., 1996)

Complexity and Structure in Formal Language Theory. - Klaus-Jörn Lange (Fundam. Informaticae, 1996)

On the Complexity of Iterated Insertions. - Markus Holzer 001; Klaus-Jörn Lange (New Trends in Formal Languages, 1997)

Are There Formal Languages Complete for SymSPACE(log n)? - Klaus-Jörn Lange (Foundations of Computer Science: Potential - Theory - Cognition, 1997)

On the Distributed Realization of Parallel Algorithms. - Klaus-Jörn Lange (SOFSEM, 1997)

An Unambiguous Class Possessing a Complete Set. - Klaus-Jörn Lange (STACS, 1997)

On the Complexity of Free Monoid Morphisms. - Klaus-Jörn Lange; Pierre McKenzie (ISAAC, 1998)

RUSPACE(log n) $ subseteq$ DSPACE (log2 n / log log n). - Eric Allender; Klaus-Jörn Lange (Theory Comput. Syst., 1998)

Reversible Space Equals Deterministic Space. - Klaus-Jörn Lange; Pierre McKenzie; Alain Tapp (J. Comput. Syst. Sci., 2000)

Data Independence of Read, Write, and Control Structures in PRAM Computations. - Klaus-Jörn Lange; Rolf Niedermeier (J. Comput. Syst. Sci., 2000)

On the Complexity of Some Problems on Groups Input as Multiplication Tables. - David A. Mix Barrington; Peter Kadau; Klaus-Jörn Lange; Pierre McKenzie (J. Comput. Syst. Sci., 2001)

Some Results on Majority Quantifiers over Words. - Klaus-Jörn Lange (CCC, 2004)

The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels. - Bernd Borchert; Klaus-Jörn Lange; Frank Stephan 001; Pascal Tesson; Denis Thérien (Developments in Language Theory, 2004)

The dot-depth and the polynomial hierarchies correspond on the delta levels. - Bernd Borchert; Klaus-Jörn Lange; Frank Stephan 001; Pascal Tesson; Denis Thérien (Int. J. Found. Comput. Sci., 2005)

FO[<]-Uniformity. - Christoph Behle; Klaus-Jörn Lange (CCC, 2006)

Characterizing TC0 in Terms of Infinite Groups. - Andreas Krebs; Klaus-Jörn Lange; Stephanie Reifferscheid (Theory Comput. Syst., 2007)

Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata. - Eric Allender; Klaus-Jörn Lange (Electron. Colloquium Comput. Complex., 2010)

A Note on the P-completeness of Deterministic One-way Stack Language. - Klaus-Jörn Lange (J. Univers. Comput. Sci., 2010)

Low uniform versions of NC1. - Christoph Behle; Andreas Krebs; Klaus-Jörn Lange; Pierre McKenzie (Electron. Colloquium Comput. Complex., 2011)

The Boolean Formula Value Problem as Formal Language. - Klaus-Jörn Lange (Languages Alive, 2012)

Dense Completeness. - Andreas Krebs; Klaus-Jörn Lange (Developments in Language Theory, 2012)

The Lower Reaches of Circuit Uniformity. - Christoph Behle; Andreas Krebs; Klaus-Jörn Lange; Pierre McKenzie (MFCS, 2012)

Visibly Counter Languages and Constant Depth Circuits. - Andreas Krebs; Klaus-Jörn Lange; Michael Ludwig (Electron. Colloquium Comput. Complex., 2014)

On Distinguishing NC1 and NL. - Andreas Krebs; Klaus-Jörn Lange; Michael Ludwig (DLT, 2015)

Visibly Counter Languages and the Structure of NC1. - Michael Hahn 001; Andreas Krebs; Klaus-Jörn Lange; Michael Ludwig (MFCS (2), 2015)

A Language-Theoretical Approach to Descriptive Complexity. - Michaël Cadilhac; Andreas Krebs; Klaus-Jörn Lange (DLT, 2016)

Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy. - Demen Güler; Andreas Krebs; Klaus-Jörn Lange; Petra Wolf 002 (LATA, 2018)

Visibly Pushdown Languages and Free Profinite Algebras. - Silke Czarnetzki; Andreas Krebs; Klaus-Jörn Lange (CoRR, 2018)