Klaus-Jörn Lange
Affiliations:- University of Tübingen, Germany
- TU Munich, Germany (former)
- University of Hamburg, Germany (former, PhD 1983)
According to our database1,
Klaus-Jörn Lange
authored at least 67 papers
between 1980 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
1980
1985
1990
1995
2000
2005
2010
2015
0
1
2
3
4
5
6
1
1
1
2
1
1
1
2
1
2
1
1
1
1
1
3
3
1
1
1
1
1
2
3
1
2
1
4
3
2
3
3
3
1
1
2
2
2
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on d-nb.info
On csauthors.net:
Bibliography
2018
Deciding Regular Intersection Emptiness of Complete Problems for PSPACE and the Polynomial Hierarchy.
Proceedings of the Language and Automata Theory and Applications, 2018
2016
Proceedings of the Developments in Language Theory - 20th International Conference, 2016
2015
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015
Proceedings of the Developments in Language Theory - 19th International Conference, 2015
2014
Electron. Colloquium Comput. Complex., 2014
2012
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012
Proceedings of the Developments in Language Theory - 16th International Conference, 2012
Proceedings of the Languages Alive, 2012
2011
2010
J. Univers. Comput. Sci., 2010
Electron. Colloquium Comput. Complex., 2010
2007
Theory Comput. Syst., 2007
2006
Proceedings of the 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 2006
2005
Int. J. Found. Comput. Sci., 2005
2004
Proceedings of the Developments in Language Theory, 2004
Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004
2001
J. Comput. Syst. Sci., 2001
2000
J. Comput. Syst. Sci., 2000
1998
RUSPACE(log <i>n</i>) $\subseteq$ DSPACE (log<sup>2</sup> <i>n</i> / log log <i>n</i>).
Theory Comput. Syst., 1998
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998
1997
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997
Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997
Proceedings of the Foundations of Computer Science: Potential - Theory, 1997
Proceedings of the New Trends in Formal Languages, 1997
1996
Electron. Colloquium Comput. Complex., 1996
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996
Set Automata.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996
1995
1994
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994
Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994
1993
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993
Deterministic OL Languages are of Very Low Complexity: DOL is in AC<sup>0</sup>.
Proceedings of the Developments in Language Theory, 1993
1992
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992
1991
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991
Proceedings of the Distributed Memory Computing, 2nd European Conference, 1991
1990
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990
1989
The Logarithmic Alternation Hierarchy Collapses: A∑<sub>2</sub><sup>L</sup> = A∏<sub>2</sub><sup>L</sup>.
Inf. Comput., March, 1989
1988
1987
Separation with the Ruzzo, Simon, and Tompa Relativization Implies DSPACE(log n) != NSPACE(log n).
Inf. Process. Lett., 1987
A further link between formal languages and complexity theory.
Bull. EATCS, 1987
String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing.
Discret. Appl. Math., 1987
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987
Proceedings of the Fundamentals of Computation Theory, 1987
1986
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986
1985
A note on the closure of EDL-languages under erasing homomorphisms.
Bull. EATCS, 1985
Addendum to "A note on the closure of EOL languages under erasing homomorphismus".
Bull. EATCS, 1985
Proceedings of the STACS 85, 1985
Proceedings of the Fundamentals of Computation Theory, 1985
1984
DTOL Systems and Catenativity.
J. Inf. Process. Cybern., 1984
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984
1983
1982
1980
Inf. Control., November, 1980