Univ.-Prof. Dr. Clemens Lautemann
Institut für Informatik, Johannes Gutenberg-Universität Mainz
- 06131/39-23334; 3923378 (Sekr)
- 06131/39-23534
Lautemann, Clemens; Schwentick, Thomas; Thérien, Denis
Logics For Context-Free LanguagesLecture notes in computer science. Bd. 933. Berlin: Springer 1995 S. 205 - 216
Habel, A.; Kreowski, H.-J.; Lautemann, C.
A comparison of compatible, finite, and inductive graph propertiesTheoretical computer science. the journal of the EATCS. Bd. 110. H. 1. Amsterdam [u.a.]: Elsevier 1993 S. 145 - 168
Lautemann, Clemens
Logical definability of NP-optimisation problems with monadic auxiliary predicatesMainz: Inst. für Informatik 1992 13 S. (Informatik-Bericht ; 1/92)
Hertrampf, Ulrich; Lautemann, Clemens
On the power of polynomial bit-reductionsTrier: Univ., Mathematik, Informatik 1992 11 S. (Forschungsbericht ; 92-28)
Drewes, Frank; Lautemann, Clemens
Incremental termination proofs and the lenght of derivationsBremen: Fachbereich Mathematik und Informatik, Univ. 1990 32 S. (Informatik ; 7/90)
Lautemann, Clemens
Tree automata, tree decomposition and hyperedge replacementMainz: Johannes-Gutenberg-Univ., FB 17, Informatik 1990 38 S. (Informatik-Bericht ; 2/90)
Buntrock, Gerhard; Lautemann, Clemens
Some modifications of auxiliary pushdown automataBremen: [Fachbereich Mathematik, Informatik, Univ.] 1989 12 S. (Informatik ; 1/89)
Lautemann, C.; Schwentick, Th.; Stewart, Iain A.
On Positive PComputational Complexity '96.