| 
| |  | |  |
Query Automata
Note: Links lead to the DBLP on the Web.
Thomas Schwentick
19
Frank Neven
, Thomas Schwentick: Expressive and Efficient Pattern Languages for Tree-Structured Data.
PODS 2000
: 0-
18
Frank Neven
, Thomas Schwentick: Automata for Unary Queries on Trees.
Grundlagen von Datenbanken 1999
: 102-106
17
Frank Neven
, Thomas Schwentick: Query Automata.
PODS 1999
: 205-214
16
Clemens Lautemann
,
Nicole Schweikardt
, Thomas Schwentick: A Logical Characterisation of Linear Time on Nondeterministic Turing Machines.
STACS 1999
: 140-149
15
Clemens Lautemann
,
Pierre McKenzie
, Thomas Schwentick,
Heribert Vollmer
: The Descriptive Complexity Approach to LOGCFL.
STACS 1999
: 427-436
14
Thomas Schwentick: Descriptive Complexity, Lower Bounds and Linear Time.
CSL 1998
: 9-28
13
Martin Grohe
, Thomas Schwentick: Locality of Order-Invariant First-Order Formulas.
MFCS 1998
: 437-445
12
Thomas Schwentick,
Klaus Barthelmann
: Local Normal Forms for First-Order Logic with Applications to Games and Automata.
STACS 1998
: 444-454
11
Clemens Lautemann
,
Pierre McKenzie
, Thomas Schwentick,
Heribert Vollmer
: The Descriptive Complexity Approach to LOGCFL.
Electronic Colloquium on Computational Complexity (ECCC) 5
(059): (1998)
10
Clemens Lautemann
, Thomas Schwentick,
Iain A. Stewart
: Positive Versions of Polynomial Time.
Information and Computation 147
(2): 145-170 (1998)
9
Arnaud Durand
,
Clemens Lautemann
, Thomas Schwentick: Subclasses of Binary NP.
Journal of Logic and Computation 8
(2): 189-207 (1998)
8
Thomas Schwentick: Padding and the Expressive Power of Existential Second-Order Logics.
CSL 1997
: 461-477
7
Thomas Schwentick: Algebraic and Logical Characterizations of Deterministic Linear Time Classes.
STACS 1997
: 463-474
6
Clemens Lautemann
, Thomas Schwentick,
Iain A. Stewart
: On Positive P.
IEEE Conference on Computational Complexity 1996
: 162-170
5
Thomas Schwentick: On Bijections vs. Unary Functions.
STACS 1996
: 415-426
4
Thomas Schwentick: Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree.
ICALP 1995
: 405-416
3
Clemens Lautemann
, Thomas Schwentick,
Denis Thérien
: Logics For Context-Free Languages.
CSL 1994
: 205-216
2
Thomas Schwentick: Graph Connectivity and Monadic NP.
FOCS 1994
: 614-622
1
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
Copyright(C) 2000 ACM | | | | | | |
