Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Lautemann, Clemens"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
David A. Mix Barrington
,
Neil Immerman
,
Clemens Lautemann
,
Nicole Schweikardt
,
Denis Thérien
Journal of Computer and System Sciences
70
(2), 2005, pp. 101-127
The descriptive complexity approach to LOGCFL
Clemens Lautemann
,
Pierre McKenzie
,
Thomas Schwentick
,
Heribert Vollmer
Journal of Computer and System Sciences
62
(4), 2001, pp. 629-652
An Ehrenfeucht-Fraïssé approach to collapse results for first-order queries over embedded databases
Clemens Lautemann
,
Nicole Schweikardt
Lecture Notes in Computer Science
2010
, 2001, pp. 455-466
The descriptive complexity approach to LOGCFL
Clemens Lautemann
,
Pierre McKenzie
,
Thomas Schwentick
,
Heribert Vollmer
Lecture Notes in Computer Science
1563
, 1999, pp. 444-454
A logical characterisation of linear time on nondeterministic Turing machines
Clemens Lautemann
,
Nicole Schweikardt
,
Thomas Schwentick
Lecture Notes in Computer Science
1563
, 1999, pp. 143-152
On positive
P
Clemens Lautemann
,
Thomas Schwentick
,
Iain A. Stewart
Proceedings of the 11th Annual IEEE Conference on Computational Complexity (Philadelphia, Pennsylvania, May 24-27, 1996)
, 1996, pp. 162-170
A comparison of compatible, finite, and inductive graph properties
Annegret Habel
,
Hans-Jörg Kreowski
,
Clemens Lautemann
Theoretical Computer Science
110
, 1993, pp. 145-168
On the power of polynomial time bit-reductions
Ulrich Hertrampf
,
Clemens Lautemann
,
Thomas Schwentick
,
Heribert Vollmer
,
Klaus W. Wagner
Proceedings of the 8th Annual Conference on Structure in Complexity Theory, CSCT'93 (San Diego, California, May 1993)
, 1993, pp. 200-207
The complexity of graph languages generated by hyperedge replacement
Clemens Lautemann
Acta Informatica
27
, 1990, pp. 399-421