| 2018 | LATA | Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy. | Demen Gler, Andreas Krebs, Klaus-Jrn Lange, Petra Wolf |
| 2016 | DLT | A Language-Theoretical Approach to Descriptive Complexity. | Michal Cadilhac, Andreas Krebs, Klaus-Jrn Lange |
| 2015 | DLT | On Distinguishing NC | Andreas Krebs, Klaus-Jrn Lange, Michael Ludwig |
| 2015 | MFCS | Visibly Counter Languages and the Structure of NC | Michael Hahn, Andreas Krebs, Klaus-Jrn Lange, Michael Ludwig |
| 2015 | STACS | Visibly Counter Languages and Constant Depth Circuits. | Andreas Krebs, Klaus-Jrn Lange, Michael Ludwig |
| 2012 | DLT | Dense Completeness. | Andreas Krebs, Klaus-Jrn Lange |
| 2012 | MFCS | The Lower Reaches of Circuit Uniformity. | Christoph Behle, Andreas Krebs, Klaus-Jrn Lange, Pierre McKenzie |
| 2005 | STACS | Characterizing TC | Andreas Krebs, Klaus-Jrn Lange, Stephanie Reifferscheid |
| 2004 | DLT | The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels. | Bernd Borchert, Klaus-Jrn Lange, Frank Stephan, Pascal Tesson, Denis Thrien |
| 1998 | ISAAC | On the Complexity of Free Monoid Morphisms. | Klaus-Jrn Lange, Pierre McKenzie |
| 1997 | STACS | An Unambiguous Class Possessing a Complete Set. | Klaus-Jrn Lange |
| 1997 | SOFSEM | On the Distributed Realization of Parallel Algorithms. | Klaus-Jrn Lange |
| 1996 | ISAAC | StUSPACE(log n) <= DSPACE(log²n / log log n). | Eric Allender, Klaus-Jrn Lange |
| 1994 | MFCS | Empty Alternation. | Klaus-Jrn Lange, Klaus Reinhardt |
| 1993 | DLT | Deterministic OL Languages are of Very Low Complexity: DOL is in AC | Carsten Damm, Markus Holzer, Klaus-Jrn Lange, Peter Rossmanith |
| 1993 | FCT | On the Complexities of Linear LL(1) and LR(1) Grammars. | Markus Holzer, Klaus-Jrn Lange |
| 1992 | MFCS | Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers. | Carsten Damm, Markus Holzer, Klaus-Jrn Lange |
| 1992 | MFCS | The Emptiness Problem for Intersections of Regular Languages. | Klaus-Jrn Lange, Peter Rossmanith |
| 1992 | MFCS | Parallel Recognition and Ranking of Context-Free Languages. | Klaus-Jrn Lange, Peter Rossmanith, Wojciech Rytter |
| 1991 | FCT | Unambiguity and Fewness for Logarithmic Space. | Gerhard Buntrock, Birgit Jenner, Klaus-Jrn Lange, Peter Rossmanith |
| 1991 | FCT | Computational Calculus and Hardest Languages of Automata with Abstract Storages. | Jrgen Dassow, Klaus-Jrn Lange |
| 1990 | MFCS | Characterizing Unambiguous Augmented Pushdown Automata by Circuits. | Klaus-Jrn Lange, Peter Rossmanith |
| 1987 | FCT | Dyck | Matthias Jantzen, Manfred Kudlek, Klaus-Jrn Lange, Holger Petersen |
| 1987 | ICALP | The Logarithmic Alternation Hierarchiy Collapses: A Sigma^C_2 = A Pi^C_2. | Klaus-Jrn Lange, Birgit Jenner, Bernd Kirsig |
| 1986 | ICALP | Decompositions of Nondeterministic Reductions (Extended Abstract). | Klaus-Jrn Lange |
| 1986 | MFCS | Two Characterizations of the Logarithmic Alternation Hierarchy. | Klaus-Jrn Lange |
| 1985 | FCT | String grammars with disconnecting. | Klaus-Jrn Lange, Emo Welzl |
| 1985 | STACS | Non-Deterministic Two-Tape Automata are More Powerful Then Deterministic Ones. | Wilfried Brauer, Klaus-Jrn Lange |
| 1984 | MFCS | Nondeterministic Logspace Reductions. | Klaus-Jrn Lange |
| 1983 | ICALP | Context-Free Controlled ETOL Systems. | Klaus-Jrn Lange |