| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Thomas Schwentick Anca Muscholl , Thomas Schwentick, Luc Segoufin : Active Context-Free Games. STACS 2004 : 452-464 Georg Gottlob , Phokion G. Kolaitis , Thomas Schwentick: Existential second-order logic over graphs: Charting the tractability frontier. J. ACM 51 (2): 312-362 (2004) Frank Neven , Thomas Schwentick: XPath Containment in the Presence of Disjunction, DTDs, and Variables. ICDT 2003 : 315-329 Nils Klarlund , Thomas Schwentick, Dan Suciu : XML: Model, Schemas, Types, Logics, and Queries. Logics for Emerging Applications of Databases 2003 : 1-41 Helmut Seidl , Thomas Schwentick, Anca Muscholl : Numerical document queries. PODS 2003 : 155-166 Frank Neven , Thomas Schwentick: On the power of tree-walking automata. Inf. Comput. 183 (1): 86-103 (2003) Michael Benedikt , Leonid Libkin , Thomas Schwentick, Luc Segoufin : Definable relations and first-order query languages over strings. J. ACM 50 (5): 694-751 (2003) Etienne Grandjean , Thomas Schwentick: Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time. SIAM J. Comput. 32 (1): 196-230 (2002) Frank Neven , Thomas Schwentick: Query automata over finite trees. Theor. Comput. Sci. 275 (1-2): 633-674 (2002) Thomas Schwentick, Denis Thérien , Heribert Vollmer : Partially-Ordered Two-Way Automata: A New Characterization of DA. Developments in Language Theory 2001 : 239-250 Thomas Eiter , Georg Gottlob , Thomas Schwentick: Second-Order Logic over Strings: Regular and Non-regular Fragments. Developments in Language Theory 2001 : 37-56 Michael Benedikt , Leonid Libkin , Thomas Schwentick, Luc Segoufin : A Model-Theoretic Approach to Regular String Relations. LICS 2001 : 431- Frank Neven , Thomas Schwentick, Victor Vianu : Towards Regular Languages over Infinite Alphabets. MFCS 2001 : 560-572 Michael Benedikt , Leonid Libkin , Thomas Schwentick, Luc Segoufin : String Operations in Query Languages. PODS 2001 Martin Grohe , Thomas Schwentick, Luc Segoufin : When is the evaluation of conjunctive queries tractable? STOC 2001 : 657-666 Frank Neven , Thomas Schwentick: Automata-and Logic-Based Pattern Languages for Tree-Structured Data. Semantics in Databases 2001 : 160-178 Clemens Lautemann , Pierre McKenzie , Thomas Schwentick, Heribert Vollmer : The Descriptive Complexity Approach to LOGCFL. J. Comput. Syst. Sci. 62 (4): 629-652 (2001) Georg Gottlob , Phokion G. Kolaitis , Thomas Schwentick: Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. FOCS 2000 : 664-674 Thomas Schwentick: Logically defined queries on trees. Grundlagen von Datenbanken 2000 : 96-100 Frank Neven , Thomas Schwentick: On the Power of Tree-Walking Automata. ICALP 2000 : 547-560 Pierre McKenzie , Thomas Schwentick, Denis Thérien , Heribert Vollmer : The Many Faces of a Translation. ICALP 2000 : 890-901 Thomas Schwentick: On Diving in Trees. MFCS 2000 : 660-669 Frank Neven , Thomas Schwentick: Expressive and Efficient Pattern Languages for Tree-Structured Data. PODS 2000 : 145-156 Martin Grohe , Thomas Schwentick: Locality of order-invariant first-order formulas. ACM Trans. Comput. Log. 1 (1): 112-130 (2000) Frank Neven , Thomas Schwentick: Automata for Unary Queries on Trees. Grundlagen von Datenbanken 1999 : 102-106 Frank Neven , Thomas Schwentick: Query Automata. PODS 1999 : 205-214 Clemens Lautemann , Nicole Schweikardt , Thomas Schwentick: A Logical Characterisation of Linear Time on Nondeterministic Turing Machines. STACS 1999 : 143-152 Clemens Lautemann , Pierre McKenzie , Thomas Schwentick, Heribert Vollmer : The Descriptive Complexity Approach to LOGCFL. STACS 1999 : 444-454 Thomas Schwentick, Klaus Barthelmann : Local Normal Forms for First-Order Logic with Applications to Games and Automata. Discrete Mathematics & Theoretical Computer Science 3 (3): 109-124 (1999) Thomas Schwentick: Descriptive Complexity, Lower Bounds and Linear Time. CSL 1998 : 9-28 Martin Grohe , Thomas Schwentick: Locality of Order-Invariant First-Order Formulas. MFCS 1998 : 437-445 Thomas Schwentick, Klaus Barthelmann : Local Normal Forms for First-Order Logic with Applications to Games and Automata. STACS 1998 : 444-454 Clemens Lautemann , Pierre McKenzie , Thomas Schwentick, Heribert Vollmer : The Descriptive Complexity Approach to LOGCFL Electronic Colloquium on Computational Complexity (ECCC) 5 (59): (1998) Clemens Lautemann , Thomas Schwentick, Iain A. Stewart : Positive Versions of Polynomial Time. Inf. Comput. 147 (2): 145-170 (1998) Arnaud Durand , Clemens Lautemann , Thomas Schwentick: Subclasses of Binary NP. J. Log. Comput. 8 (2): 189-207 (1998) Thomas Schwentick: Padding and the Expressive Power of Existential Second-Order Logics. CSL 1997 : 461-477 Thomas Schwentick: Algebraic and Logical Characterizations of Deterministic Linear Time Classes. STACS 1997 : 463-474 Clemens Lautemann , Thomas Schwentick, Iain A. Stewart : On Positive P. IEEE Conference on Computational Complexity 1996 : 162-170 Thomas Schwentick: On Bijections vs. Unary Functions. STACS 1996 : 415-426 Thomas Schwentick: On Winning Ehrenfeucht Games and Monadic NP. Ann. Pure Appl. Logic 79 (1): 61-92 (1996) Thomas Schwentick: Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree. ICALP 1995 : 405-416 Frederic Green , Johannes Köbler , Kenneth W. Regan , Thomas Schwentick, Jacobo Torán : The Power of the Middle Bit of a #P Function. J. Comput. Syst. Sci. 50 (3): 456-467 (1995) Clemens Lautemann , Thomas Schwentick, Denis Thérien : Logics For Context-Free Languages. CSL 1994 : 205-216 Thomas Schwentick: Graph Connectivity and Monadic NP FOCS 1994 : 614-622 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 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) 1 [ 15 ] [ 18 ] 2 [ 33 ] [ 35 ] [ 40 ] 3 [ 12 ] 4 [ 36 ] 5 [ 29 ] [ 36 ] [ 45 ] 6 [ 39 ] 7 [ 5 ] 8 [ 16 ] [ 23 ] [ 32 ] 9 [ 1 ] [ 2 ] 10 [ 43 ] 11 [ 5 ] 12 [ 29 ] [ 45 ] 13 [ 1 ] [ 2 ] [ 4 ] [ 9 ] [ 12 ] [ 13 ] [ 14 ] [ 19 ] [ 20 ] [ 30 ] 14 [ 33 ] [ 35 ] [ 40 ] 15 [ 14 ] [ 19 ] [ 26 ] [ 30 ] 16 [ 42 ] [ 46 ] 17 [ 21 ] [ 22 ] [ 24 ] [ 27 ] [ 31 ] [ 34 ] [ 38 ] [ 41 ] [ 44 ] 18 [ 5 ] 19 [ 20 ] 20 [ 32 ] [ 33 ] [ 35 ] [ 40 ] [ 46 ] 21 [ 42 ] 22 [ 9 ] [ 13 ] 23 [ 43 ] 24 [ 4 ] [ 26 ] [ 37 ] 25 [ 5 ] 26 [ 34 ] 27 [ 1 ] [ 2 ] [ 14 ] [ 19 ] [ 26 ] [ 30 ] [ 37 ] 28 [ 1 ] [ 2 ]  ©2004 Association for Computing Machinery |
