| 2006 | ||
|---|---|---|
| 28 | EE | Clemens Lautemann, Pascal Tesson, Denis Thérien: An Algebraic Point of View on the Crane Beach Property. CSL 2006: 426-440 |
| 27 | EE | Michal Koucký, Clemens Lautemann, Sebastian Poloczek, Denis Thérien: Circuit Lower Bounds via Ehrenfeucht-Fraisse Games. IEEE Conference on Computational Complexity 2006: 190-201 |
| 2005 | ||
| 26 | EE | 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): 101-127 (2005) |
| 2001 | ||
| 25 | David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien: The Crane Beach Conjecture. LICS 2001: 187-196 | |
| 24 | EE | Clemens Lautemann, Nicole Schweikardt: An Ehrenfeucht-Fraïssé Approach to Collapse Results for First-Order Queries over Embedded Databases. STACS 2001: 455-466 |
| 23 | Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL. J. Comput. Syst. Sci. 62(4): 629-652 (2001) | |
| 1999 | ||
| 22 | Clemens Lautemann, Bernhard Weinzinger: MonadicNLIN and Quantifier-Free Reductions. CSL 1999: 322-337 | |
| 21 | EE | Clemens Lautemann, Nicole Schweikardt, Thomas Schwentick: A Logical Characterisation of Linear Time on Nondeterministic Turing Machines. STACS 1999: 143-152 |
| 20 | EE | Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL. STACS 1999: 444-454 |
| 1998 | ||
| 19 | EE | Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The descriptive complexity approach to LOGCFL CoRR cs.CC/9809114: (1998) |
| 18 | EE | Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL Electronic Colloquium on Computational Complexity (ECCC) 5(59): (1998) |
| 17 | Clemens Lautemann, Thomas Schwentick, Iain A. Stewart: Positive Versions of Polynomial Time. Inf. Comput. 147(2): 145-170 (1998) | |
| 16 | Arnaud Durand, Clemens Lautemann, Thomas Schwentick: Subclasses of Binary NP. J. Log. Comput. 8(2): 189-207 (1998) | |
| 1996 | ||
| 15 | EE | Clemens Lautemann, Thomas Schwentick, Iain A. Stewart: On Positive P. IEEE Conference on Computational Complexity 1996: 162-170 |
| 1994 | ||
| 14 | Clemens Lautemann, Thomas Schwentick, Denis Thérien: Logics For Context-Free Languages. CSL 1994: 205-216 | |
| 1993 | ||
| 13 | Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner: On the Power of Polynomial Time Bit-Reductions (Extended Abstract). Structure in Complexity Theory Conference 1993: 200-207 | |
| 12 | Annegret Habel, Hans-Jörg Kreowski, Clemens Lautemann: A Comparison of Compatible, Finite, and Inductive Graph Properties. Theor. Comput. Sci. 110(1): 145-168 (1993) | |
| 1992 | ||
| 11 | Clemens Lautemann: Logical Definability of NP-Optimization Problems with Monadic Auxiliary Predicates. CSL 1992: 327-339 | |
| 10 | Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner: On the Power of Polynomial Bit-Reductions Universität Trier, Mathematik/Informatik, Forschungsbericht 92-28: (1992) | |
| 1991 | ||
| 9 | Frank Drewes, Clemens Lautemann: Incremental Termination Proofs and the Length of Derivations. RTA 1991: 49-61 | |
| 1990 | ||
| 8 | Clemens Lautemann: Tree Automata, Tree Decomposition and Hyperedge Replacement. Graph-Grammars and Their Application to Computer Science 1990: 520-537 | |
| 1989 | ||
| 7 | Dieter Hofbauer, Clemens Lautemann: Termination Proofs and the Length of Derivations (Preliminary Version). RTA 1989: 167-177 | |
| 6 | Clemens Lautemann: The Complexity of Graph Languages Generated by Hyperedge Replacement. Acta Inf. 27(5): 399-421 (1989) | |
| 1988 | ||
| 5 | Clemens Lautemann: Decomposition Trees: Structured Graph Representation and Efficient Algorithms. CAAP 1988: 28-39 | |
| 4 | Clemens Lautemann: Efficient Algorithms on Context-Free Graph Grammars. ICALP 1988: 362-378 | |
| 3 | Clemens Lautemann: A note on polynomial interpretation. Bulletin of the EATCS 36: 129-130 (1988) | |
| 1985 | ||
| 2 | Clemens Lautemann, Friedhelm Meyer auf der Heide: Lower Time Bounds for Integer Programming with Two Variables. Inf. Process. Lett. 21(2): 101-105 (1985) | |
| 1983 | ||
| 1 | Clemens Lautemann: BPP and the Polynomial Hierarchy. Inf. Process. Lett. 17(4): 215-217 (1983) | |
| 1 | David A. Mix Barrington | [25] [26] |
| 2 | Frank Drewes | [9] |
| 3 | Arnaud Durand | [16] |
| 4 | Annegret Habel | [12] |
| 5 | Friedhelm Meyer auf der Heide | [2] |
| 6 | Ulrich Hertrampf | [10] [13] |
| 7 | Dieter Hofbauer | [7] |
| 8 | Neil Immerman | [25] [26] |
| 9 | Michal Koucký | [27] |
| 10 | Hans-Jörg Kreowski | [12] |
| 11 | Pierre McKenzie | [18] [19] [20] [23] |
| 12 | Sebastian Poloczek | [27] |
| 13 | Nicole Schweikardt | [21] [24] [25] [26] |
| 14 | Thomas Schwentick | [10] [13] [14] [15] [16] [17] [18] [19] [20] [21] [23] |
| 15 | Iain A. Stewart | [15] [17] |
| 16 | Pascal Tesson | [28] |
| 17 | Denis Thérien | [14] [25] [26] [27] [28] |
| 18 | Heribert Vollmer | [10] [13] [18] [19] [20] [23] |
| 19 | Klaus W. Wagner | [10] [13] |
| 20 | Bernhard Weinzinger | [22] |
Colors in the list of coauthors