Clemens Lautemann

Publication Activity (10 Years)

Years Active: 1983-2007
Publications (10 Years): 0

Technical University of Berlin, Germany (PHD)

Education History

Technical University of Berlin, Germany

PHD

Publications

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

Clemens Lautemann.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Clemens Lautemann