Clemens Lautemann

32 papers A* 2A 5B 4Journal 14Unranked 6
YearRankTypeTitle / Venue / Authors
2007 J jnl
A simple proof of the polylog counting ability of first-order logic: guest column.
SIGACT News
Arnaud Durand, Clemens Lautemann, Malika More
2006 B conf
An Algebraic Point of View on the Crane Beach Property.
CSL
Clemens Lautemann, Pascal Tesson, Denis Thérien
2006 A conf
Circuit Lower Bounds via Ehrenfeucht-Fraisse Games.
CCC
Michal Koucký, Clemens Lautemann, Sebastian Poloczek, Denis Thérien
2006 — conf
Counting Results in Weak Formalisms.
Circuits, Logic, and Games
Arnaud Durand, Clemens Lautemann, Malika More
2005 J jnl
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture.
J. Comput. Syst. Sci.
David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien
2001 A conf
An Ehrenfeucht-Fraïssé Approach to Collapse Results for First-Order Queries over Embedded Databases.
STACS
Clemens Lautemann, Nicole Schweikardt
2001 A* conf
The Crane Beach Conjecture.
LICS
David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien
2001 J jnl
The Descriptive Complexity Approach to LOGCFL.
J. Comput. Syst. Sci.
Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
1999 A conf
A Logical Characterisation of Linear Time on Nondeterministic Turing Machines.
STACS
Clemens Lautemann, Nicole Schweikardt, Thomas Schwentick
1999 B conf
MonadicNLIN and Quantifier-Free Reductions.
CSL
Clemens Lautemann, Bernhard Weinzinger
1999 A conf
The Descriptive Complexity Approach to LOGCFL.
STACS
Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
1998 J jnl
Positive Versions of Polynomial Time.
Inf. Comput.
Clemens Lautemann, Thomas Schwentick, Iain A. Stewart
1998 J jnl
Subclasses of Binary NP.
J. Log. Comput.
Arnaud Durand, Clemens Lautemann, Thomas Schwentick
1998 J jnl
The Descriptive Complexity Approach to LOGCFL
Electron. Colloquium Comput. Complex.
Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
1998 J jnl
The descriptive complexity approach to LOGCFL
CoRR
Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
1996 A conf
On Positive P.
CCC
Clemens Lautemann, Thomas Schwentick, Iain A. Stewart
1994 B conf
Logics For Context-Free Languages.
CSL
Clemens Lautemann, Thomas Schwentick, Denis Thérien
1993 J jnl
A Comparison of Compatible, Finite, and Inductive Graph Properties.
Theor. Comput. Sci.
Annegret Habel, Hans-Jörg Kreowski, Clemens Lautemann
1993 — conf
On the Power of Polynomial Time Bit-Reductions (Extended Abstract).
SCT
Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner
1992 B conf
Logical Definability of NP-Optimization Problems with Monadic Auxiliary Predicates.
CSL
Clemens Lautemann
1992 J jnl
On the Power of Polynomial Bit-Reductions
Universität Trier, Mathematik/Informatik, Forschungsbericht
Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner
1991 — conf
Incremental Termination Proofs and the Length of Derivations.
RTA
Frank Drewes, Clemens Lautemann
1991 J jnl
Some modifications of auxiliary pushdown automata.
RAIRO Theor. Informatics Appl.
Gerhard Buntrock, Frank Drewes, Clemens Lautemann, Till Mossakowski
1990 J jnl
The Complexity of Graph Languages Generated by Hyperedge Replacement.
Acta Informatica
Clemens Lautemann
1990 — conf
Tree Automata, Tree Decomposition and Hyperedge Replacement.
Graph-Grammars and Their Application to Computer Science
Clemens Lautemann
1989 — conf
Termination Proofs and the Length of Derivations (Preliminary Version).
RTA
Dieter Hofbauer, Clemens Lautemann
1988 J jnl
A note on polynomial interpretation.
Bull. EATCS
Clemens Lautemann
1988 — conf
Decomposition Trees: Structured Graph Representation and Efficient Algorithms.
CAAP
Clemens Lautemann
1988 A* conf
Efficient Algorithms on Context-Free Graph Grammars.
ICALP
Clemens Lautemann
1985 J jnl
Lower Time Bounds for Integer Programming with Two Variables.
Inf. Process. Lett.
Clemens Lautemann, Friedhelm Meyer auf der Heide
1983 J jnl
BPP and the Polynomial Hierarchy.
Inf. Process. Lett.
Clemens Lautemann
1983 — —
Polynomielle probabilistische Komplexitätsklassen.
Clemens Lautemann