Klaus-Jörn Lange

Publication Activity (10 Years)

Years Active: 1980-2018
Publications (10 Years): 6

Top Venues

DLT

CoRR

Theory Comput.

Electron. Colloquium Comput. Complex.

University of Hamburg, Germany (PHD)

Education History

University of Hamburg, Germany

PHD

Publications

Silke Czarnetzki, Andreas Krebs, Klaus-Jörn Lange
Visibly Pushdown Languages and Free Profinite Algebras. CoRR (2018)
Demen Güler, Andreas Krebs, Klaus-Jörn Lange, Petra Wolf
Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy. LATA (2018)
Michaël Cadilhac, Andreas Krebs, Klaus-Jörn Lange
A Language-Theoretical Approach to Descriptive Complexity. DLT (2016)
Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig
and NL. DLT (2015)
Michael Hahn, Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig
. MFCS (2) (2015)
Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig
Visibly Counter Languages and Constant Depth Circuits. STACS (2015)
Eric Allender, Klaus-Jörn Lange
Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata. Theory Comput. 10 (2014)
Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig
Visibly Counter Languages and Constant Depth Circuits. Electron. Colloquium Comput. Complex. 21 (2014)
Klaus-Jörn Lange
The Boolean Formula Value Problem as Formal Language. Languages Alive (2012)
Christoph Behle, Andreas Krebs, Klaus-Jörn Lange, Pierre McKenzie
The Lower Reaches of Circuit Uniformity. MFCS (2012)
Andreas Krebs, Klaus-Jörn Lange
Dense Completeness. Developments in Language Theory (2012)
Christoph Behle, Andreas Krebs, Klaus-Jörn Lange, Pierre McKenzie
Low uniform versions of NC1. Electron. Colloquium Comput. Complex. 18 (2011)
Eric Allender, Klaus-Jörn Lange
Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata. Computational Complexity Conference (2010)
Eric Allender, Klaus-Jörn Lange
Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata. Electron. Colloquium Comput. Complex. 17 (2010)
Klaus-Jörn Lange
A Note on the P-completeness of Deterministic One-way Stack Language. J. Univers. Comput. Sci. 16 (5) (2010)
Andreas Krebs, Klaus-Jörn Lange, Stephanie Reifferscheid
in Terms of Infinite Groups. Theory Comput. Syst. 40 (4) (2007)
Christoph Behle, Klaus-Jörn Lange
FO[<]-Uniformity. Computational Complexity Conference (2006)
Andreas Krebs, Klaus-Jörn Lange, Stephanie Reifferscheid
in Terms of Infinite Groups. STACS (2005)
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) (2005)
Klaus-Jörn Lange
Some Results on Majority Quantifiers over Words. Computational Complexity Conference (2004)
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)
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) (2001)
Klaus-Jörn Lange, Rolf Niedermeier
Data Independence of Read, Write, and Control Structures in PRAM Computations. J. Comput. Syst. Sci. 60 (1) (2000)
Klaus-Jörn Lange, Pierre McKenzie, Alain Tapp
Reversible Space Equals Deterministic Space. J. Comput. Syst. Sci. 60 (2) (2000)
David A. Mix Barrington, Peter Kadau, Klaus-Jörn Lange, Pierre McKenzie
On the Complexity of Some Problems on Groups Input as Multiplication Tables. Computational Complexity Conference (2000)
Eric Allender, Klaus-Jörn Lange
). Theory Comput. Syst. 31 (5) (1998)
Klaus-Jörn Lange, Pierre McKenzie
On the Complexity of Free Monoid Morphisms. ISAAC (1998)
Klaus-Jörn Lange
An Unambiguous Class Possessing a Complete Set. STACS (1997)
Klaus-Jörn Lange
Are There Formal Languages Complete for SymSPACE(log n)? Foundations of Computer Science: Potential - Theory - Cognition (1997)
Markus Holzer, Klaus-Jörn Lange
On the Complexity of Iterated Insertions. New Trends in Formal Languages (1997)
Klaus-Jörn Lange
On the Distributed Realization of Parallel Algorithms. SOFSEM (1997)
Klaus-Jörn Lange, Pierre McKenzie, Alain Tapp
Reversible Space Equals Deterministic Space. Computational Complexity Conference (1997)
Henning Fernau, Klaus-Jörn Lange, Klaus Reinhardt
Advocating Ownership. FSTTCS (1996)
Klaus-Jörn Lange, Klaus Reinhardt
Set Automata. DMTCS (1996)
Eric Allender, Klaus-Jörn Lange
StUSPACE(log n) <= DSPACE(log²n / log log n). ISAAC (1996)
Klaus-Jörn Lange
Complexity and Structure in Formal Language Theory. Fundam. Informaticae 25 (3) (1996)
Eric Allender, Klaus-Jörn Lange
n)/loglog n) Electron. Colloquium Comput. Complex. 3 (48) (1996)
Yosi Ben-Asher, Klaus-Jörn Lange, David Peleg, Assaf Schuster
The Complexity of Reconfiguring Network Models Inf. Comput. 121 (1) (1995)
Klaus-Jörn Lange, Peter Rossmanith
Unambiguous Polynomial Hierarchies and Exponential Size. Computational Complexity Conference (1994)
Klaus-Jörn Lange, Klaus Reinhardt
Empty Alternation. MFCS (1994)
Klaus-Jörn Lange
Unambiguity of Circuits. Theor. Comput. Sci. 107 (1) (1993)
Klaus-Jörn Lange, Rolf Niedermeier
Data-Independences of Parallel Random Access Machines. FSTTCS (1993)
Markus Holzer, Klaus-Jörn Lange
On the Complexities of Linear LL(1) and LR(1) Grammars. FCT (1993)
Klaus-Jörn Lange
Complexity and Structure in Formal Language Theory. Computational Complexity Conference (1993)
Carsten Damm, Markus Holzer, Klaus-Jörn Lange, Peter Rossmanith
. Developments in Language Theory (1993)
Klaus-Jörn Lange, Peter Rossmanith, Wojciech Rytter
Parallel Recognition and Ranking of Context-Free Languages. MFCS (1992)
Carsten Damm, Markus Holzer, Klaus-Jörn Lange
Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers. MFCS (1992)
Klaus-Jörn Lange, Peter Rossmanith
The Emptiness Problem for Intersections of Regular Languages. MFCS (1992)
Dominik Gomm, Michael Heckner, Klaus-Jörn Lange, Gerhard Riedle
On the Design of Parallel Programs for Machines with Distributed Memory. EDMCC (1991)
Jürgen Dassow, Klaus-Jörn Lange
Computational Calculus and Hardest Languages of Automata with Abstract Storages. FCT (1991)
Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange, Peter Rossmanith
Unambiguity and Fewness for Logarithmic Space. FCT (1991)
Klaus-Jörn Lange, Peter Rossmanith
Two results on unambiguous circuits Forschungsberichte, TU Munich (1990)
Klaus-Jörn Lange
Unambiguity of Circuits. Computational Complexity Conference (1990)
Klaus-Jörn Lange, Peter Rossmanith
Characterizing Unambiguous Augmented Pushdown Automata by Circuits. MFCS (1990)
Birgit Jenner, Bernd Kirsig, Klaus-Jörn Lange
. Inf. Comput. 80 (3) (1989)
Klaus-Jörn Lange
Complexity Theory and Formal Languages. IMYCS (1988)
Klaus-Jörn Lange
Decompositions of Nondeterministic Reductions. Theor. Comput. Sci. 58 (1988)
Klaus-Jörn Lange, Emo Welzl
String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing. Discret. Appl. Math. 16 (1) (1987)
Klaus-Jörn Lange, Michael Schudy
A further link between formal languages and complexity theory. Bull. EATCS 33 (1987)
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) (1987)
Matthias Jantzen, Manfred Kudlek, Klaus-Jörn Lange, Holger Petersen
-Reductions of Context-free Languages. FCT (1987)
Klaus-Jörn Lange, Birgit Jenner, Bernd Kirsig
The Logarithmic Alternation Hierarchiy Collapses: A Sigma^C_2 = A Pi^C_2. ICALP (1987)
Klaus-Jörn Lange
Two Characterizations of the Logarithmic Alternation Hierarchy. MFCS (1986)
Klaus-Jörn Lange
Decompositions of Nondeterministic Reductions (Extended Abstract). ICALP (1986)
Klaus-Jörn Lange
Addendum to "A note on the closure of EOL languages under erasing homomorphismus". Bull. EATCS 26 (1985)
Klaus-Jörn Lange, Emo Welzl
String grammars with disconnecting. FCT (1985)
Klaus-Jörn Lange, Emo Welzl
Recurrent Words and Simultaneous Growth in T0L Systems. Theor. Comput. Sci. 35 (1985)
Klaus-Jörn Lange
A note on the closure of EDL-languages under erasing homomorphisms. Bull. EATCS 25 (1985)
Wilfried Brauer, Klaus-Jörn Lange
Non-Deterministic Two-Tape Automata are More Powerful Then Deterministic Ones. STACS (1985)
Klaus-Jörn Lange
DTOL Systems and Catenativity. J. Inf. Process. Cybern. 20 (2/3) (1984)
Klaus-Jörn Lange
Nondeterministic Logspace Reductions. MFCS (1984)
Klaus-Jörn Lange
Context-Free Controlled ETOL Systems. ICALP (1983)
Takashi Yokomori, Derick Wood, Klaus-Jörn Lange
A Three-Restricted Normal Form Theorem for ET0L Languages. Inf. Process. Lett. 14 (3) (1982)
Klaus-Jörn Lange
Equivalence of Adult Languages and Extensions for DTOL Systems Inf. Control. 47 (2) (1980)

Klaus-Jörn Lange.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Klaus-Jörn Lange