Klaus-Joern Lange

Available identifiers

zbMath Open lange.klaus-jornMaRDI QIDQ1163379

List of research outcomes

Publication	Date of Publication	Type
An unambiguous class possessing a complete set	2022-11-09	Paper
Parallel recognition and ranking of context-free languages	2022-08-18	Paper
Parallel complexity of iterated morphisms and the arithmetic of small numbers	2022-08-18	Paper
The emptiness problem for intersections of regular languages	2022-08-18	Paper
Empty alternation	2022-08-18	Paper
Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy	2018-06-26	Paper
https://portal.mardi4nfdi.de/entity/Q2955026	2017-01-24	Paper
A Language-Theoretical Approach to Descriptive Complexity	2016-08-30	Paper
On Distinguishing NC $$^1$$ and NL	2015-11-10	Paper
Visibly Counter Languages and the Structure of $$\mathrm {NC}^{1}$$	2015-09-16	Paper
https://portal.mardi4nfdi.de/entity/Q3191604	2014-10-06	Paper
Dense Completeness	2012-11-02	Paper
The Boolean Formula Value Problem as Formal Language	2012-11-01	Paper
The Lower Reaches of Circuit Uniformity	2012-09-25	Paper
https://portal.mardi4nfdi.de/entity/Q4929410	2010-09-22	Paper
Characterizing \(\text{TC}^{0}\) in terms of infinite groups	2007-08-23	Paper
Developments in Language Theory	2005-12-22	Paper
STACS 2005	2005-12-02	Paper
THE DOT-DEPTH AND THE POLYNOMIAL HIERARCHIES CORRESPOND ON THE DELTA LEVELS	2005-08-03	Paper
On the complexity of some problems on groups input as multiplication tables	2002-07-22	Paper
Reversible space equals deterministic space	2000-06-05	Paper
Data independence of read, write, and control structures in PRAM computations	2000-05-08	Paper
https://portal.mardi4nfdi.de/entity/Q4249530	2000-02-09	Paper
https://portal.mardi4nfdi.de/entity/Q4266541	1999-10-03	Paper
https://portal.mardi4nfdi.de/entity/Q4266543	1999-10-03	Paper
https://portal.mardi4nfdi.de/entity/Q4217604	1999-06-21	Paper
RUSPACE\((\log n)\subseteq \text{DSPACE}(\log^2n/\log \log n)\)	1999-02-18	Paper
https://portal.mardi4nfdi.de/entity/Q4371015	1998-01-07	Paper
https://portal.mardi4nfdi.de/entity/Q4874659	1996-04-28	Paper
The complexity of reconfiguring network models	1996-02-20	Paper
https://portal.mardi4nfdi.de/entity/Q4284250	1994-08-31	Paper
https://portal.mardi4nfdi.de/entity/Q4036765	1993-05-18	Paper
Unambiguity of circuits	1993-05-16	Paper
https://portal.mardi4nfdi.de/entity/Q3357533	1990-01-01	Paper
The logarithmic alternation hierarchy collapses: \(A\Sigma _ 2^{{\mathcal L}}=A\Pi_ 2^{{\mathcal L}}\)	1989-01-01	Paper
Decompositions of nondeterministic reductions	1988-01-01	Paper
String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing	1987-01-01	Paper
Separation with the Ruzzo, Simon, and Tompa relativization implies DSPACE(log n)\(\neq NSPACE(\log \,n)\)	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3766852	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3783607	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3814812	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3026351	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3730019	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4725752	1986-01-01	Paper
Erratum to: ``A three-restricted normal form theorem for ETOL languages	1985-01-01	Paper
Recurrent words and simultaneous growth in T0L systems	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3692891	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3741088	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3345789	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3682474	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3670604	1983-01-01	Paper
A three-restricted normal form theorem for ETOL languages	1982-01-01	Paper
L homomorphisms and reductions of OL systems	1982-01-01	Paper
Equivalence of adult languages and extensions for DTOL systems	1980-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Klaus-Joern Lange