default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKlaus-Jörn Lange
Person information
- affiliation: University of Tübingen, Germany
- affiliation (former): TU Munich, Germany
- affiliation (former, PhD 1983): University of Hamburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c46]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: 156-168- [i6]Silke Czarnetzki, Andreas Krebs, Klaus-Jörn Lange:
Visibly Pushdown Languages and Free Profinite Algebras. CoRR abs/1810.12731 (2018) - 2016
- [c45]Michaël Cadilhac, Andreas Krebs, Klaus-Jörn Lange:
A Language-Theoretical Approach to Descriptive Complexity. DLT 2016: 64-76 - 2015
- [c44]Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig:
On Distinguishing NC1 and NL. DLT 2015: 340-351 - [c43]Michael Hahn, Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig:
Visibly Counter Languages and the Structure of NC1. MFCS (2) 2015: 384-394 - [c42]Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig:
Visibly Counter Languages and Constant Depth Circuits. STACS 2015: 594-607 - 2014
- [j22]Eric Allender
, Klaus-Jörn Lange:
Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata. Theory Comput. 10: 199-215 (2014) - [i5]Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig:
Visibly Counter Languages and Constant Depth Circuits. Electron. Colloquium Comput. Complex. TR14 (2014) - 2012
- [c41]Klaus-Jörn Lange:
The Boolean Formula Value Problem as Formal Language. Languages Alive 2012: 138-144 - [c40]Andreas Krebs, Klaus-Jörn Lange:
Dense Completeness. Developments in Language Theory 2012: 178-189 - [c39]Christoph Behle, Andreas Krebs, Klaus-Jörn Lange, Pierre McKenzie:
The Lower Reaches of Circuit Uniformity. MFCS 2012: 590-602 - 2011
- [i4]Christoph Behle, Andreas Krebs, Klaus-Jörn Lange, Pierre McKenzie:
Low uniform versions of NC1. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j21]Klaus-Jörn Lange:
A Note on the P-completeness of Deterministic One-way Stack Language. J. Univers. Comput. Sci. 16(5): 795-799 (2010) - [c38]Eric Allender, Klaus-Jörn Lange:
Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata. CCC 2010: 172-180 - [i3]Eric Allender, Klaus-Jörn Lange:
Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2007
- [j20]Andreas Krebs, Klaus-Jörn Lange, Stephanie Reifferscheid:
Characterizing TC0 in Terms of Infinite Groups. Theory Comput. Syst. 40(4): 303-325 (2007) - 2006
- [c37]Christoph Behle, Klaus-Jörn Lange:
FO[<]-Uniformity. CCC 2006: 183-189 - 2005
- [j19]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) - [c36]Andreas Krebs, Klaus-Jörn Lange, Stephanie Reifferscheid:
Characterizing TC0 in Terms of Infinite Groups. STACS 2005: 496-507 - 2004
- [c35]Klaus-Jörn Lange:
Some Results on Majority Quantifiers over Words. CCC 2004: 123-129 - [c34]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
- [j18]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
- [j17]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) - [j16]Klaus-Jörn Lange, Pierre McKenzie, Alain Tapp:
Reversible Space Equals Deterministic Space. J. Comput. Syst. Sci. 60(2): 354-367 (2000) - [c33]David A. Mix Barrington, Peter Kadau, Klaus-Jörn Lange, Pierre McKenzie:
On the Complexity of Some Problems on Groups Input as Multiplication Tables. CCC 2000: 62-69
1990 – 1999
- 1998
- [j15]Eric Allender, Klaus-Jörn Lange:
RUSPACE(log n) $\subseteq$ DSPACE (log2 n / log log n). Theory Comput. Syst. 31(5): 539-550 (1998) - [c32]Klaus-Jörn Lange, Pierre McKenzie:
On the Complexity of Free Monoid Morphisms. ISAAC 1998: 247-256 - 1997
- [c31]Klaus-Jörn Lange:
Are There Formal Languages Complete for SymSPACE(log n)? Foundations of Computer Science: Potential - Theory - Cognition 1997: 125-134 - [c30]Markus Holzer, Klaus-Jörn Lange:
On the Complexity of Iterated Insertions. New Trends in Formal Languages 1997: 440-453 - [c29]Klaus-Jörn Lange, Pierre McKenzie, Alain Tapp:
Reversible Space Equals Deterministic Space. CCC 1997: 45-50 - [c28]Klaus-Jörn Lange:
On the Distributed Realization of Parallel Algorithms. SOFSEM 1997: 37-52 - [c27]Klaus-Jörn Lange:
An Unambiguous Class Possessing a Complete Set. STACS 1997: 339-350 - 1996
- [j14]Klaus-Jörn Lange:
Complexity and Structure in Formal Language Theory. Fundam. Informaticae 25(3): 327-352 (1996) - [c26]Klaus-Jörn Lange, Klaus Reinhardt:
Set Automata. DMTCS 1996: 321-329 - [c25]Henning Fernau, Klaus-Jörn Lange, Klaus Reinhardt:
Advocating Ownership. FSTTCS 1996: 286-297 - [c24]Eric Allender, Klaus-Jörn Lange:
StUSPACE(log n) <= DSPACE(log²n / log log n). ISAAC 1996: 193-202 - [i2]Eric Allender, Klaus-Jörn Lange:
StUSPACE(log n) is Contained in DSPACE((log2n)/loglog n). Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j13]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. SCT 1994: 106-115 - [c22]Klaus-Jörn Lange, Klaus Reinhardt:
Empty Alternation. MFCS 1994: 494-503 - 1993
- [j12]Klaus-Jörn Lange:
Unambiguity of Circuits. Theor. Comput. Sci. 107(1): 77-94 (1993) - [c21]Klaus-Jörn Lange:
Complexity and Structure in Formal Language Theory. SCT 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]Klaus-Jörn Lange:
Unambiguity of Circuits. SCT 1990: 130-137 - [c10]Klaus-Jörn Lange, Peter Rossmanith:
Characterizing Unambiguous Augmented Pushdown Automata by Circuits. MFCS 1990: 399-406 - [i1]Klaus-Jörn Lange, Peter Rossmanith:
Two results on unambiguous circuits. Forschungsberichte, TU Munich TUM I 9006: 1-29 (1990)
1980 – 1989
- 1989
- [j11]Birgit Jenner, Bernd Kirsig, Klaus-Jörn Lange:
The Logarithmic Alternation Hierarchy Collapses: A∑2L = A∏2L. Inf. Comput. 80(3): 269-287 (1989) - 1988
- [j10]Klaus-Jörn Lange:
Decompositions of Nondeterministic Reductions. Theor. Comput. Sci. 58: 175-181 (1988) - [c9]Klaus-Jörn Lange:
Complexity Theory and Formal Languages. IMYCS 1988: 19-36 - 1987
- [j9]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): 17-30 (1987) - [j8]Klaus-Jörn Lange, Michael Schudy:
A further link between formal languages and complexity theory. Bull. 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. Bull. EATCS 25: 22-23 (1985) - [j5]Klaus-Jörn Lange:
Addendum to "A note on the closure of EOL languages under erasing homomorphismus". Bull. 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]Klaus-Jörn Lange, Emo Welzl:
String grammars with disconnecting. FCT 1985: 249-256 - [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. J. Inf. Process. Cybern. 20(2/3): 81-92 (1984) - [c2]Klaus-Jörn Lange:
Nondeterministic Logspace Reductions. MFCS 1984: 378-388 - 1983
- [c1]Klaus-Jörn Lange:
Context-Free Controlled ETOL Systems. ICALP 1983: 723-733 - 1982
- [b1]Klaus-Jörn Lange:
Kontextfrei kontrollierte ETOL-Systeme. University of Hamburg, Germany, 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. Inf. Control. 47(2): 107-112 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
