| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Christoph Behle, Andreas Krebs, Klaus-Jörn Lange, Pierre McKenzie |
Low uniform versions of NC1.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Eric Allender, Klaus-Jörn Lange |
Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Klaus-Jörn Lange |
A Note on the P-completeness of Deterministic One-way Stack Language. |
J. UCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Klaus-Jörn Lange |
Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata. |
IEEE Conference on Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
Symmetric Computation, Auxiliary Pushdown Automata, LogCFL, Reversible Computation |
| 1 | Andreas Krebs, Klaus-Jörn Lange, Stephanie Reifferscheid |
Characterizing TC0 in Terms of Infinite Groups. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Behle, Klaus-Jörn Lange |
FO[<]-Uniformity. |
IEEE Conference on Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Krebs, Klaus-Jörn Lange, Stephanie Reifferscheid |
Characterizing TC0 in Terms of Infinite Groups. |
STACS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange |
Some Results on Majority Quantifiers over Words. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange, Rolf Niedermeier |
Data Independence of Read, Write, and Control Structures in PRAM Computations. |
J. Comput. Syst. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange, Pierre McKenzie, Alain Tapp |
Reversible Space Equals Deterministic Space. |
J. Comput. Syst. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | David A. Mix Barrington, Peter Kadau, Klaus-Jörn Lange, Pierre McKenzie |
On the Complexity of Some Problems on Groups Input as Multiplication Tables. (PDF / PS) |
IEEE Conference on Computational Complexity |
2000 |
DBLP DOI BibTeX RDF |
logic, circuit complexity, group membership, integer arithmetic |
| 1 | Eric Allender, Klaus-Jörn Lange |
RUSPACE(log n) $\subseteq$ DSPACE (log2 n / log log n). |
Theory Comput. Syst. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange, Pierre McKenzie |
On the Complexity of Free Monoid Morphisms. |
ISAAC |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange |
An Unambiguous Class Possessing a Complete Set. |
STACS |
1997 |
DBLP DOI BibTeX RDF |
Topics Computational and structural complexity theory |
| 1 | Klaus-Jörn Lange |
Are There Formal Languages Complete for SymSPACE(log n)? |
Foundations of Computer Science: Potential - Theory - Cognition |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer, Klaus-Jörn Lange |
On the Complexity of Iterated Insertions. |
New Trends in Formal Languages |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange |
On the Distributed Realization of Parallel Algorithms. |
SOFSEM |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange, Pierre McKenzie, Alain Tapp |
Reversible Space Equals Deterministic Space. (PDF / PS) |
IEEE Conference on Computational Complexity |
1997 |
DBLP DOI BibTeX RDF |
determinism, reversible computation, Complexity classes, space bounds |
| 1 | Eric Allender, Klaus-Jörn Lange |
StUSPACE(log n) is Contained in DSPACE((log2n)/loglog n) |
Electronic Colloquium on Computational Complexity (ECCC) |
1996 |
DBLP BibTeX RDF |
|
| 1 | Klaus-Jörn Lange |
Complexity and Structure in Formal Language Theory. |
Fundam. Inform. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Klaus-Jörn Lange |
StUSPACE(log n) <= DSPACE(log²n / log log n). |
ISAAC |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Klaus-Jörn Lange, Klaus Reinhardt |
Advocating Ownership. |
FSTTCS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Yosi Ben-Asher, Klaus-Jörn Lange, David Peleg, Assaf Schuster |
The Complexity of Reconfiguring Network Models |
Inf. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange, Klaus Reinhardt |
Empty Alternation. |
MFCS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange, Peter Rossmanith |
Unambiguous Polynomial Hierarchies and Exponential Size. |
Structure in Complexity Theory Conference |
1994 |
DBLP BibTeX RDF |
|
| 1 | Klaus-Jörn Lange |
Unambiguity of Circuits. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Holzer, Klaus-Jörn Lange |
On the Complexities of Linear LL(1) and LR(1) Grammars. |
FCT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Klaus-Jörn Lange |
Complexity and Structure in Formal Language Theory. |
Structure in Complexity Theory Conference |
1993 |
DBLP BibTeX RDF |
|
| 1 | Klaus-Jörn Lange, Rolf Niedermeier |
Data-Independences of Parallel Random Access Machines. |
FSTTCS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange, Peter Rossmanith, Wojciech Rytter |
Parallel Recognition and Ranking of Context-Free Languages. |
MFCS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange, Peter Rossmanith |
The Emptiness Problem for Intersections of Regular Languages. |
MFCS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Markus Holzer, Klaus-Jörn Lange |
Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers. |
MFCS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Jürgen Dassow, Klaus-Jörn Lange |
Computational Calculus and Hardest Languages of Automata with Abstract Storages. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange, Peter Rossmanith |
Unambiguity and Fewness for Logarithmic Space. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominik Gomm, Michael Heckner, Klaus-Jörn Lange, Gerhard Riedle |
On the Design of Parallel Programs for Machines with Distributed Memory. |
EDMCC |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange, Peter Rossmanith |
Characterizing Unambiguous Augmented Pushdown Automata by Circuits. |
MFCS |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange |
Unambiguity of Circuits. |
Structure in Complexity Theory Conference |
1990 |
DBLP BibTeX RDF |
|
| 1 | Birgit Jenner, Bernd Kirsig, Klaus-Jörn Lange |
The Logarithmic Alternation Hierarchy Collapses: A \sum^\calL_2=APi^\calL_2 |
Inf. Comput. |
1989 |
DBLP BibTeX RDF |
|
| 1 | Klaus-Jörn Lange |
Decompositions of Nondeterministic Reductions. |
Theor. Comput. Sci. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange |
Complexity Theory and Formal Languages. |
IMYCS |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernd Kirsig, Klaus-Jörn Lange |
Separation with the Ruzzo, Simon, and Tompa Relativization Implies DSPACE(log n) != NSPACE(log n). |
Inf. Process. Lett. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange, Michael Schudy |
A further link between formal languages and complexity theory. |
Bulletin of the EATCS |
1987 |
DBLP BibTeX RDF |
|
| 1 | Klaus-Jörn Lange, Birgit Jenner, Bernd Kirsig |
The Logarithmic Alternation Hierarchiy Collapses: A Sigma^C_2 = A Pi^C_2. |
ICALP |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Jantzen, Manfred Kudlek, Klaus-Jörn Lange, Holger Petersen |
Dyck1-Reductions of Context-free Languages. |
FCT |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange |
Decompositions of Nondeterministic Reductions (Extended Abstract). |
ICALP |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange |
Two Characterizations of the Logarithmic Alternation Hierarchy. |
MFCS |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange, Emo Welzl |
Recurrent Words and Simultaneous Growth in T0L Systems. |
Theor. Comput. Sci. |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange |
Addendum to "A note on the closure of EOL languages under erasing homomorphismus". |
Bulletin of the EATCS |
1985 |
DBLP BibTeX RDF |
|
| 1 | Klaus-Jörn Lange |
A note on the closure of EDL-languages under erasing homomorphisms. |
Bulletin of the EATCS |
1985 |
DBLP BibTeX RDF |
|
| 1 | Wilfried Brauer, Klaus-Jörn Lange |
Non-Deterministic Two-Tape Automata are More Powerful Then Deterministic Ones. |
STACS |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange, Emo Welzl |
String grammars with disconnecting. |
FCT |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange |
DTOL Systems and Catenativity. |
Elektronische Informationsverarbeitung und Kybernetik |
1984 |
DBLP BibTeX RDF |
|
| 1 | Klaus-Jörn Lange |
Nondeterministic Logspace Reductions. |
MFCS |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange |
Context-Free Controlled ETOL Systems. |
ICALP |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Takashi Yokomori, Derick Wood, Klaus-Jörn Lange |
A Three-Restricted Normal Form Theorem for ET0L Languages. |
Inf. Process. Lett. |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus-Jörn Lange |
Equivalence of Adult Languages and Extensions for DTOL Systems |
Information and Control |
1980 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")