default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClemens Lautemann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j11]Arnaud Durand, Clemens Lautemann, Malika More:
A simple proof of the polylog counting ability of first-order logic: guest column. SIGACT News 38(4): 40-45 (2007)- 2006
- [c16]Michal Koucký
, Clemens Lautemann, Sebastian Poloczek, Denis Thérien:
Circuit Lower Bounds via Ehrenfeucht-Fraisse Games. CCC 2006: 190-201 - [c15]Clemens Lautemann, Pascal Tesson, Denis Thérien:
An Algebraic Point of View on the Crane Beach Property. CSL 2006: 426-440 - [i4]Arnaud Durand, Clemens Lautemann, Malika More:
Counting Results in Weak Formalisms. Circuits, Logic, and Games 2006 - 2005
- [j10]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
- [j9]Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer:
The Descriptive Complexity Approach to LOGCFL. J. Comput. Syst. Sci. 62(4): 629-652 (2001) - [c14]David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien:
The Crane Beach Conjecture. LICS 2001: 187-196 - [c13]Clemens Lautemann, Nicole Schweikardt:
An Ehrenfeucht-Fraïssé Approach to Collapse Results for First-Order Queries over Embedded Databases. STACS 2001: 455-466
1990 – 1999
- 1999
- [c12]Clemens Lautemann, Bernhard Weinzinger:
MonadicNLIN and Quantifier-Free Reductions. CSL 1999: 322-337 - [c11]Clemens Lautemann, Nicole Schweikardt, Thomas Schwentick:
A Logical Characterisation of Linear Time on Nondeterministic Turing Machines. STACS 1999: 143-152 - [c10]Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer:
The Descriptive Complexity Approach to LOGCFL. STACS 1999: 444-454 - 1998
- [j8]Clemens Lautemann, Thomas Schwentick, Iain A. Stewart:
Positive Versions of Polynomial Time. Inf. Comput. 147(2): 145-170 (1998) - [j7]Arnaud Durand, Clemens Lautemann, Thomas Schwentick:
Subclasses of Binary NP. J. Log. Comput. 8(2): 189-207 (1998) - [i3]Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer:
The descriptive complexity approach to LOGCFL. CoRR cs.CC/9809114 (1998) - [i2]Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer:
The Descriptive Complexity Approach to LOGCFL. Electron. Colloquium Comput. Complex. TR98 (1998) - 1996
- [c9]Clemens Lautemann, Thomas Schwentick, Iain A. Stewart:
On Positive P. CCC 1996: 162-170 - 1994
- [c8]Clemens Lautemann, Thomas Schwentick, Denis Thérien:
Logics For Context-Free Languages. CSL 1994: 205-216 - 1993
- [j6]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) - [c7]Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner:
On the Power of Polynomial Time Bit-Reductions (Extended Abstract). SCT 1993: 200-207 - 1992
- [c6]Clemens Lautemann:
Logical Definability of NP-Optimization Problems with Monadic Auxiliary Predicates. CSL 1992: 327-339 - [i1]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
- [j5]Gerhard Buntrock, Frank Drewes, Clemens Lautemann, Till Mossakowski:
Some modifications of auxiliary pushdown automata. RAIRO Theor. Informatics Appl. 25: 545-556 (1991) - [c5]Frank Drewes, Clemens Lautemann:
Incremental Termination Proofs and the Length of Derivations. RTA 1991: 49-61 - 1990
- [j4]Clemens Lautemann:
The Complexity of Graph Languages Generated by Hyperedge Replacement. Acta Informatica 27(5): 399-421 (1990) - [c4]Clemens Lautemann:
Tree Automata, Tree Decomposition and Hyperedge Replacement. Graph-Grammars and Their Application to Computer Science 1990: 520-537
1980 – 1989
- 1989
- [c3]Dieter Hofbauer, Clemens Lautemann:
Termination Proofs and the Length of Derivations (Preliminary Version). RTA 1989: 167-177 - 1988
- [j3]Clemens Lautemann:
A note on polynomial interpretation. Bull. EATCS 36: 129-130 (1988) - [c2]Clemens Lautemann:
Decomposition Trees: Structured Graph Representation and Efficient Algorithms. CAAP 1988: 28-39 - [c1]Clemens Lautemann:
Efficient Algorithms on Context-Free Graph Grammars. ICALP 1988: 362-378 - 1985
- [j2]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
- [b1]Clemens Lautemann:
Polynomielle probabilistische Komplexitätsklassen. Technical University of Berlin, Germany, 1983, pp. 1-72 - [j1]Clemens Lautemann:
BPP and the Polynomial Hierarchy. Inf. Process. Lett. 17(4): 215-217 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
