SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Klaus-Jörn Lange: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.003secs, Finished in 0.459secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP