Travelled to:1 × Finland
1 × France
1 × Germany
1 × New Zealand
1 × Spain
1 × Taiwan
1 × United Kingdom
Collaborated with:∅ A.Krebs B.Borchert F.Stephan P.Tesson D.Thérien M.Ludwig B.Jenner B.Kirsig C.Damm M.Holzer P.Rossmanith
Talks about:hierarchi (3) correspond (2) polynomi (2) level (2) depth (2) delta (2) dot (2) nondeterminist (1) distinguish (1) determinist (1)
Person: Klaus-Jörn Lange
DBLP: Lange:Klaus=J=ouml=rn
Contributed to:
20152012200420051993
198719861983Wrote 8 papers:
- DLT-2015-KrebsLL #on the
- On Distinguishing NC¹ and NL (AK, KJL, ML), pp. 340–351.
- DLT-2012-KrebsL
- Dense Completeness (AK, KJL), pp. 178–189.
- DLT-2004-BorchertLSTT #polynomial
- The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels (BB, KJL, FS, PT, DT), pp. 89–101.
- DLT-J-2004-BorchertLSTT05 #polynomial
- The dot-depth and the polynomial hierarchies correspond on the delta levels (BB, KJL, FS, PT, DT), pp. 625–644.
- DLT-1993-DammHLR #complexity
- Deterministic OL Languages are of Very Low Complexity: DOL is in AC0 (CD, MH, KJL, PR), pp. 305–313.
- ICALP-1987-LangeJK
- The Logarithmic Alternation Hierarchy Collapses: AΣᴸ₂=AΠᴸ₂ (KJL, BJ, BK), pp. 531–541.
- ICALP-1986-Lange #nondeterminism #reduction
- Decompositions of Nondeterministic Reductions (KJL), pp. 206–214.
- ICALP-1983-Lange
- Context-Free Controlled ETOL Systems (KJL), pp. 723–733.