Thomas Schwentick

Henrik Björklund, Martin Schuster, Thomas Schwentick, Joscha Kulbatzki: On optimum left-to-right strategies for active context-free games. ICDT 2013: 105-116

Thomas Schwentick: XML Schema Management: A Challenge for Automata Theory. LATA 2013: 43

Benedikt Bollig, Aiswarya Cyriac, Loïc Hélouët, Ahmet Kara, Thomas Schwentick: Dynamic Communicating Automata and Branching High-Level MSCs. LATA 2013: 177-189

Thomas Schwentick, Thomas Zeume: Two-Variable Logic with Two Order Relations. Logical Methods in Computer Science 8(1) (2012)

Jean-Yves Marion, Thomas Schwentick: Theoretical Aspects of Computer Science. Theory Comput. Syst. 51(2): 123-124 (2012)

Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick: Developing and Analyzing XSDs through BonXai. PVLDB 5(12): 1994-1997 (2012)

Wouter Gelade, Marcel Marquardt, Thomas Schwentick: The dynamic complexity of formal languages. ACM Trans. Comput. Log. 13(3): 19 (2012)

Thomas Schwentick: Foundations of XML Based on Logic and Automata: A Snapshot. FoIKS 2012: 23-33

Georg Gottlob, Thomas Schwentick: Rewriting Ontological Queries into Small Nonrecursive Datalog Programs. KR 2012

Ahmet Kara, Thomas Schwentick, Tony Tan: Feasible Automata for Two-Variable Logic with Successor on Data Words. LATA 2012: 351-362

Henrik Björklund, Martin Schuster, Thomas Schwentick, Joscha Kulbatzki: On optimum left-to-right strategies for active context-free games. CoRR abs/1212.3501 (2012)

Nicole Schweikardt, Thomas Schwentick: A note on the expressive power of linear orders. Logical Methods in Computer Science 7(4) (2011)

Ahmet Kara, Thomas Schwentick: Expressiveness of Hybrid Temporal Logic on Data Words. Electr. Notes Theor. Comput. Sci. 278: 115-128 (2011)

Henrik Björklund, Wim Martens, Thomas Schwentick: Conjunctive query containment over trees. J. Comput. Syst. Sci. 77(3): 450-472 (2011)

Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin: Two-variable logic on data words. ACM Trans. Comput. Log. 12(4): 27 (2011)

Georg Gottlob, Thomas Schwentick: Rewriting Ontological Queries into Small Nonrecursive Datalog Programs. Description Logics 2011

Matthias Niewerth, Thomas Schwentick: Two-variable logic and key constraints on data words. ICDT 2011: 138-149

Thomas Schwentick, Christoph Dürr: Frontmatter, Table of Contents, Preface, Conference Organization. STACS 2011

Maurizio Lenzerini, Thomas Schwentick (Eds.): Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2011, June 12-16, 2011, Athens, Greece. ACM 2011, isbn 978-1-4503-0660-7

Thomas Schwentick, Christoph Dürr (Eds.): 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany. LIPIcs 9, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2011, isbn 978-3-939897-25-5

Georg Gottlob, Thomas Schwentick: Rewriting Ontological Queries into Small Nonrecursive Datalog Programs. CoRR abs/1106.3767 (2011)

Ahmet Kara, Thomas Schwentick, Tony Tan: Feasible Automata for Two-Variable Logic with Successor on Data Words. CoRR abs/1110.1221 (2011)

Serge Abiteboul, Alin Deutsch, Thomas Schwentick, Luc Segoufin: Foundations of distributed data management (Dagstuhl Seminar 11421). Dagstuhl Reports 1(10): 37-57 (2011)

Henrik Björklund, Wim Martens, Nicole Schweikardt, Thomas Schwentick: Logik und Automaten: ein echtes Dreamteam. Informatik Spektrum 33(5): 452-461 (2010)

Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber: Complexity of hybrid logics over transitive frames. J. Applied Logic 8(4): 422-440 (2010)

Henrik Björklund, Thomas Schwentick: On notions of regularity for data languages. Theor. Comput. Sci. 411(4-5): 702-715 (2010)

Geert Jan Bex, Frank Neven, Thomas Schwentick, Stijn Vansummeren: Inference of concise regular expressions and DTDs. ACM Trans. Database Syst. 35(2) (2010)

Thomas Eiter, Georg Gottlob, Thomas Schwentick: The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey. Fields of Logic and Computation 2010: 227-250

Thomas Schwentick, Thomas Zeume: Two-Variable Logic with Two Order Relations - (Extended Abstract). CSL 2010: 499-513

Ahmet Kara, Thomas Schwentick, Thomas Zeume: Temporal Logics on Words with Multiple Data Values. FSTTCS 2010: 481-492

Wim Martens, Matthias Niewerth, Thomas Schwentick: Schema design for XML repositories: complexity and tractability. PODS 2010: 239-250

Jean-Yves Marion, Thomas Schwentick: Foreword -- 27th International Symposium on Theoretical Aspects of Computer Science. STACS 2010: 1-6

Jean-Yves Marion, Thomas Schwentick: Table of Contents - 27th International Symposium on Theoretical Aspects of Computer Science. STACS 2010: 7-10

Jean-Yves Marion, Thomas Schwentick (Eds.): 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France. LIPIcs 5, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2010, isbn 978-3-939897-16-3

Ahmet Kara, Thomas Schwentick, Thomas Zeume: Temporal Logics on Words with Multiple Data Values. CoRR abs/1010.1139 (2010)

Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin: Two-variable logic on data trees and XML reasoning. J. ACM 56(3) (2009)

Georg Gottlob, Zoltán Miklós, Thomas Schwentick: Generalized hypertree decompositions: NP-hardness and tractable variants. J. ACM 56(6) (2009)

Thomas Schwentick, Henrik Björklund: Volker Weber. Journal of Logic, Language and Information 18(4): 433 (2009)

Thomas Schwentick, Dan Suciu: Foreword. Theory Comput. Syst. 44(4): 501-502 (2009)

Wim Martens, Frank Neven, Thomas Schwentick: Complexity of Decision Problems for XML Schemas and Chain Regular Expressions. SIAM J. Comput. 39(4): 1486-1530 (2009)

Georg Gottlob, Gianluigi Greco, Zoltán Miklós, Francesco Scarcello, Thomas Schwentick: Tree Projections: Game Characterization and Computational Aspects. Graph Theory, Computational Intelligence and Thought 2009: 217-226

Ahmet Kara, Volker Weber, Martin Lange, Thomas Schwentick: On the Hybrid Extension of CTL and CTL⁺. MFCS 2009: 427-438

Wouter Gelade, Marcel Marquardt, Thomas Schwentick: The Dynamic Complexity of Formal Languages. STACS 2009: 481-492

Ahmet Kara, Martin Lange, Thomas Schwentick, Volker Weber: On the Hybrid Extension of CTL and CTL+. CoRR abs/0906.2541 (2009)

Thomas Schwentick, Dan Suciu: Introduction to ICDT 2007 special section. ACM Trans. Database Syst. 33(4) (2008)

Wim Martens, Frank Neven, Thomas Schwentick: Deterministic top-down tree automata: past, present, and future. Logic and Automata 2008: 505-530

Helmut Seidl, Thomas Schwentick, Anca Muscholl: Counting in trees. Logic and Automata 2008: 575-612

Henrik Björklund, Wim Martens, Thomas Schwentick: Optimizing Conjunctive Queries over Trees Using Schema Information. MFCS 2008: 132-143

Thomas Schwentick: A Little Bit Infinite? On Adding Data to Finitely Labelled Structures (Abstract). STACS 2008: 17-18

Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber: Complexity of Hybrid Logics over Transitive Frames. CoRR abs/0806.4130 (2008)

Wouter Gelade, Marcel Marquardt, Thomas Schwentick: Dynamic Complexity of Formal Languages. CoRR abs/0812.1915 (2008)

Thomas Schwentick: Automata for XML - A survey. J. Comput. Syst. Sci. 73(3): 289-315 (2007)

Volker Weber, Thomas Schwentick: Dynamic Complexity Theory Revisited. Theory Comput. Syst. 40(4): 355-377 (2007)

Wim Martens, Frank Neven, Thomas Schwentick: Simple off the shelf abstractions for XML schema. SIGMOD Record 36(3): 15-22 (2007)

Henrik Björklund, Wim Martens, Thomas Schwentick: Conjunctive Query Containment over Trees. DBPL 2007: 66-80

Henrik Björklund, Thomas Schwentick: On Notions of Regularity for Data Languages. FCT 2007: 88-99

Georg Gottlob, Zoltán Miklós, Thomas Schwentick: Generalized hypertree decompositions: np-hardness and tractable variants. PODS 2007: 13-22

Gjergji Kasneci, Thomas Schwentick: The complexity of reasoning about pattern-based XML schemas. PODS 2007: 155-164

Thomas Schwentick, Volker Weber: Bounded-Variable Fragments of Hybrid Logics. STACS 2007: 561-572

Thomas Schwentick, Denis Thérien, Heribert Vollmer (Eds.): Circuits, Logic, and Games, 08.11. - 10.11.2006. Dagstuhl Seminar Proceedings 06451, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007

Thomas Schwentick, Dan Suciu (Eds.): Database Theory - ICDT 2007, 11th International Conference, Barcelona, Spain, January 10-12, 2007, Proceedings. Lecture Notes in Computer Science 4353, Springer 2007, isbn 3-540-69269-X

Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer: The many faces of a translation. J. Comput. Syst. Sci. 72(1): 163-179 (2006)

Frank Neven, Thomas Schwentick: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in Computer Science 2(3) (2006)

Anca Muscholl, Thomas Schwentick, Luc Segoufin: Active Context-Free Games. Theory Comput. Syst. 39(1): 237-276 (2006)

Wim Martens, Frank Neven, Thomas Schwentick, Geert Jan Bex: Expressiveness and complexity of XML Schema. ACM Trans. Database Syst. 31(3): 770-813 (2006)

Thomas Schwentick, Denis Thérien, Heribert Vollmer: 06451 Executive Summary -- Circuits, Logic, and Games . Circuits, Logic, and Games 2006

Thomas Schwentick, Denis Thérien, Heribert Vollmer: 06451 Abstracts Collection -- Circuits, Logic, and Games . Circuits, Logic, and Games 2006

Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin: Expressive Power of Pebble Automata. ICALP (1) 2006: 157-168

Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David: Two-Variable Logic on Words with Data. LICS 2006: 7-16

Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin: Two-variable logic on data trees and XML reasoning. PODS 2006: 10-19

Geert Jan Bex, Frank Neven, Thomas Schwentick, Karl Tuyls: Inference of Concise DTDs from XML Data. VLDB 2006: 115-126

Frank Neven, Thomas Schwentick: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. CoRR abs/cs/0606065 (2006)

Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentick: On the Complexity of Equational Horn Clauses. CADE 2005: 337-352

Frank Neven, Thomas Schwentick, Dan Suciu: 05061 Abstracts Collection - Foundations of Semistructured Data. Foundations of Semistructured Data 2005

Frank Neven, Thomas Schwentick, Dan Suciu: 05061 Summary - Foundations of Semi-structured Data. Foundations of Semistructured Data 2005

Wim Martens, Frank Neven, Thomas Schwentick: Which XML Schemas Admit 1-Pass Preorder Typing? ICDT 2005: 68-82

Volker Weber, Thomas Schwentick: Dynamic Complexity Theory Revisited. STACS 2005: 256-268

Geert Jan Bex, Wim Martens, Frank Neven, Thomas Schwentick: Expressiveness of XSDs: from practice to theory, there and back again. WWW 2005: 712-721

Frank Neven, Thomas Schwentick, Dan Suciu (Eds.): Foundations of Semistructured Data, 6.-11. February 2005. Dagstuhl Seminar Proceedings 05061, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2005

Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick: Existential second-order logic over graphs: Charting the tractability frontier. J. ACM 51(2): 312-362 (2004)

Joachim Biskup, Jan Paredaens, Thomas Schwentick, Jan Van den Bussche: Solving Equations in the Relational Algebra. SIAM J. Comput. 33(5): 1052-1066 (2004)

Thomas Schwentick: XPath query containment. SIGMOD Record 33(1): 101-109 (2004)

Frank Neven, Thomas Schwentick, Victor Vianu: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log. 5(3): 403-435 (2004)

Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl: Counting in Trees for Free. ICALP 2004: 1136-1149

Wim Martens, Frank Neven, Thomas Schwentick: Complexity of Decision Problems for Simple Regular Expressions. MFCS 2004: 889-900

Thomas Schwentick: Trees, Automata and XML. PODS 2004: 222

Anca Muscholl, Thomas Schwentick, Luc Segoufin: Active Context-Free Games. STACS 2004: 452-464

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)

Nils Klarlund, Thomas Schwentick, Dan Suciu: XML: Model, Schemas, Types, Logics, and Queries. Logics for Emerging Applications of Databases 2003: 1-41

Frank Neven, Thomas Schwentick: XPath Containment in the Presence of Disjunction, DTDs, and Variables. ICDT 2003: 312-326

Helmut Seidl, Thomas Schwentick, Anca Muscholl: Numerical document queries. PODS 2003: 155-166

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)

Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL. J. Comput. Syst. Sci. 62(4): 629-652 (2001)

Thomas Eiter, Georg Gottlob, Thomas Schwentick: Second-Order Logic over Strings: Regular and Non-regular Fragments. Developments in Language Theory 2001: 37-56

Thomas Schwentick, Denis Thérien, Heribert Vollmer: Partially-Ordered Two-Way Automata: A New Characterization of DA. Developments in Language Theory 2001: 239-250

Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin: A Model-Theoretic Approach to Regular String Relations. LICS 2001: 431-440

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

Frank Neven, Thomas Schwentick: Automata-and Logic-Based Pattern Languages for Tree-Structured Data. Semantics in Databases 2001: 160-178

Martin Grohe, Thomas Schwentick, Luc Segoufin: When is the evaluation of conjunctive queries tractable? STOC 2001: 657-666

Joachim Biskup, Jan Paredaens, Thomas Schwentick, Jan Van den Bussche: Solving equations in the relational algebra. CoRR cs.LO/0106034 (2001)

Martin Grohe, Thomas Schwentick: Locality of order-invariant first-order formulas. ACM Trans. Comput. Log. 1(1): 112-130 (2000)

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

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)

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

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: 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. CoRR cs.CC/9809114 (1998)

Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer: The Descriptive Complexity Approach to LOGCFL. Electronic Colloquium on Computational Complexity (ECCC) 5(59) (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

Thomas Schwentick: On Winning Ehrenfeucht Games and Monadic NP. Ann. Pure Appl. Logic 79(1): 61-92 (1996)

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

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)

Thomas Schwentick: Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree. ICALP 1995: 405-416

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)