Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Klaus-Jörn Lange
2010 – today
- 2012
[c40]Klaus-Jörn Lange: The Boolean Formula Value Problem as Formal Language. Languages Alive 2012: 138-144- [c39]
- [c38]Christoph Behle, Andreas Krebs, Klaus-Jörn Lange, Pierre McKenzie: The Lower Reaches of Circuit Uniformity. MFCS 2012: 590-602
- 2011
- [i3]Christoph Behle, Andreas Krebs, Klaus-Jörn Lange, Pierre McKenzie: Low uniform versions of NC1. Electronic Colloquium on Computational Complexity (ECCC) 18: 95 (2011)
- 2010
- [j20]Klaus-Jörn Lange: A Note on the P-completeness of Deterministic One-way Stack Language. J. UCS 16(5): 795-799 (2010)
- [c37]Eric Allender, Klaus-Jörn Lange: Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata. IEEE Conference on Computational Complexity 2010: 172-180
- [i2]Eric Allender, Klaus-Jörn Lange: Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata. Electronic Colloquium on Computational Complexity (ECCC) 17: 70 (2010)
2000 – 2009
- 2007
- [j19]Andreas Krebs, Klaus-Jörn Lange, Stephanie Reifferscheid: Characterizing TC0 in Terms of Infinite Groups. Theory Comput. Syst. 40(4): 303-325 (2007)
- 2006
- [c36]Christoph Behle, Klaus-Jörn Lange: FO[<]-Uniformity. IEEE Conference on Computational Complexity 2006: 183-189
- 2005
- [j18]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)
- [c35]Andreas Krebs, Klaus-Jörn Lange, Stephanie Reifferscheid: Characterizing TC0 in Terms of Infinite Groups. STACS 2005: 496-507
- 2004
- [c34]Klaus-Jörn Lange: Some Results on Majority Quantifiers over Words. IEEE Conference on Computational Complexity 2004: 123-129
- [c33]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
- 2001
- [j17]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
- [j16]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)
- [j15]Klaus-Jörn Lange, Pierre McKenzie, Alain Tapp: Reversible Space Equals Deterministic Space. J. Comput. Syst. Sci. 60(2): 354-367 (2000)
- [c32]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
1990 – 1999
- 1998
- [j14]Eric Allender, Klaus-Jörn Lange: RUSPACE(log n) $\subseteq$ DSPACE (log2 n / log log n). Theory Comput. Syst. 31(5): 539-550 (1998)
- [c31]
- 1997
- [c30]Klaus-Jörn Lange: Are There Formal Languages Complete for SymSPACE(log n)? Foundations of Computer Science: Potential - Theory - Cognition 1997: 125-134
- [c29]Markus Holzer, Klaus-Jörn Lange: On the Complexity of Iterated Insertions. New Trends in Formal Languages 1997: 440-453
- [c28]Klaus-Jörn Lange, Pierre McKenzie, Alain Tapp: Reversible Space Equals Deterministic Space. IEEE Conference on Computational Complexity 1997: 45-50
- [c27]
- [c26]
- 1996
- [j13]Klaus-Jörn Lange: Complexity and Structure in Formal Language Theory. Fundam. Inform. 25(3): 327-352 (1996)
- [c25]
- [c24]
- [i1]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)
- 1995
- [j12]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
- [c23]Klaus-Jörn Lange, Peter Rossmanith: Unambiguous Polynomial Hierarchies and Exponential Size. Structure in Complexity Theory Conference 1994: 106-115
- [c22]
- 1993
- [j11]
- [c21]Klaus-Jörn Lange: Complexity and Structure in Formal Language Theory. Structure in Complexity Theory Conference 1993: 224-238
- [c20]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
- [c19]Markus Holzer, Klaus-Jörn Lange: On the Complexities of Linear LL(1) and LR(1) Grammars. FCT 1993: 299-308
- [c18]Klaus-Jörn Lange, Rolf Niedermeier: Data-Independences of Parallel Random Access Machines. FSTTCS 1993: 104-113
- 1992
- [c17]Klaus-Jörn Lange, Peter Rossmanith, Wojciech Rytter: Parallel Recognition and Ranking of Context-Free Languages. MFCS 1992: 24-36
- [c16]Carsten Damm, Markus Holzer, Klaus-Jörn Lange: Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers. MFCS 1992: 227-235
- [c15]Klaus-Jörn Lange, Peter Rossmanith: The Emptiness Problem for Intersections of Regular Languages. MFCS 1992: 346-354
- 1991
- [c14]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
- [c13]Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange, Peter Rossmanith: Unambiguity and Fewness for Logarithmic Space. FCT 1991: 168-179
- [c12]Jürgen Dassow, Klaus-Jörn Lange: Computational Calculus and Hardest Languages of Automata with Abstract Storages. FCT 1991: 200-209
- 1990
- [c11]
- [c10]Klaus-Jörn Lange, Peter Rossmanith: Characterizing Unambiguous Augmented Pushdown Automata by Circuits. MFCS 1990: 399-406
1980 – 1989
- 1989
- [j10]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
- [j9]Klaus-Jörn Lange: Decompositions of Nondeterministic Reductions. Theor. Comput. Sci. 58: 175-181 (1988)
- [c9]
- 1987
- [j8]Klaus-Jörn Lange, Michael Schudy: A further link between formal languages and complexity theory. Bulletin of the EATCS 33: 67-70 (1987)
- [j7]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)
- [c8]Matthias Jantzen, Manfred Kudlek, Klaus-Jörn Lange, Holger Petersen: Dyck1-Reductions of Context-free Languages. FCT 1987: 218-227
- [c7]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
- 1986
- [c6]Klaus-Jörn Lange: Decompositions of Nondeterministic Reductions (Extended Abstract). ICALP 1986: 206-214
- [c5]Klaus-Jörn Lange: Two Characterizations of the Logarithmic Alternation Hierarchy. MFCS 1986: 518-526
- 1985
- [j6]Klaus-Jörn Lange: A note on the closure of EDL-languages under erasing homomorphisms. Bulletin of the EATCS 25: 22-23 (1985)
- [j5]Klaus-Jörn Lange: Addendum to "A note on the closure of EOL languages under erasing homomorphismus". Bulletin of the EATCS 26: 55 (1985)
- [j4]Klaus-Jörn Lange, Emo Welzl: Recurrent Words and Simultaneous Growth in T0L Systems. Theor. Comput. Sci. 35: 1-15 (1985)
- [c4]
- [c3]Wilfried Brauer, Klaus-Jörn Lange: Non-Deterministic Two-Tape Automata are More Powerful Then Deterministic Ones. STACS 1985: 71-79
- 1984
- [j3]Klaus-Jörn Lange: DTOL Systems and Catenativity. Elektronische Informationsverarbeitung und Kybernetik 20(2/3): 81-92 (1984)
- [c2]
- 1983
- [c1]
- 1982
- [j2]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
- [j1]Klaus-Jörn Lange: Equivalence of Adult Languages and Extensions for DTOL Systems. Information and Control 47(2): 107-112 (1980)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-23 20:56 CET by the dblp team