Travelled to:1 × Finland
1 × Germany
1 × Hungary
1 × Spain
2 × Italy
2 × USA
Collaborated with:∅ D.Thérien B.Weinzinger F.Drewes D.Hofbauer P.Tesson D.A.M.Barrington N.Immerman N.Schweikardt
Talks about:termin (2) length (2) proof (2) monad (2) deriv (2) crane (2) beach (2) tree (2) free (2) decomposit (1)
Person: Clemens Lautemann
DBLP: Lautemann:Clemens
Contributed to:
2006
200119991992
1991
19901989
1988Wrote 8 papers:
- CSL-2006-LautemannTT #algebra
- An Algebraic Point of View on the Crane Beach Property (CL, PT, DT), pp. 426–440.
- LICS-2001-BarringtonILST
- The Crane Beach Conjecture (DAMB, NI, CL, NS, DT), pp. 187–196.
- CSL-1999-LautemannW #quantifier #reduction
- MonadicNLIN and Quantifier-Free Reductions (CL, BW), pp. 322–337.
- CSL-1992-Lautemann #logic #monad #problem
- Logical Definability of NP-Optimization Problems with Monadic Auxiliary Predicates (CL), pp. 327–339.
- RTA-1991-DrewesL #incremental #proving #termination
- Incremental Termination Proofs and the Length of Derivations (FD, CL), pp. 49–61.
- GG-1990-Lautemann #automaton #composition
- Tree Automata, Tree Decomposition and Hyperedge Replacement (CL), pp. 520–537.
- RTA-1989-HofbauerL #proving #termination
- Termination Proofs and the Length of Derivations (DH, CL), pp. 167–177.
- ICALP-1988-Lautemann #algorithm #graph grammar #performance
- Efficient Algorithms on Context-Free Graph Grammars (CL), pp. 362–378.