Clemens Lautemann

Available identifiers

zbMath Open lautemann.clemensWikidataQ102181261 ScholiaQ102181261MaRDI QIDQ208762

List of research outcomes

Publication	Date of Publication	Type
Termination proofs and the length of derivations	2022-12-09	Paper
Incremental termination proofs and the length of derivations	2022-12-09	Paper
An Algebraic Point of View on the Crane Beach Property	2009-03-12	Paper
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture	2005-05-12	Paper
https://portal.mardi4nfdi.de/entity/Q4474840	2004-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q2762524	2002-01-09	Paper
The descriptive complexity approach to LOGCFL	2001-10-14	Paper
https://portal.mardi4nfdi.de/entity/Q4945235	2000-03-23	Paper
https://portal.mardi4nfdi.de/entity/Q4251062	1999-11-15	Paper
Tree-definable linear orders	1999-09-07	Paper
https://portal.mardi4nfdi.de/entity/Q4251045	1999-06-17	Paper
Positive versions of polynomial time	1999-03-22	Paper
Subclasses of binary NP	1998-07-28	Paper
https://portal.mardi4nfdi.de/entity/Q4283244	1994-04-04	Paper
https://portal.mardi4nfdi.de/entity/Q4037325	1993-05-18	Paper
A comparison of compatible, finite, and inductive graph properties	1992-06-25	Paper
Some modifications of auxiliary pushdown automata	1991-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3486868	1991-01-01	Paper
The complexity of graph languages generated by hyperedge replacement	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3789084	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3795250	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3833603	1988-01-01	Paper
Lower time bounds for integer programming with two variables	1985-01-01	Paper
BPP and the polynomial hierarchy	1983-01-01	Paper
Linear transformations on matrices: rank preservers and determinant preservers (Note)	1981-01-01	Paper

Research outcomes over time

This page was built for person: Clemens Lautemann