Thomas Schwentick

211 papers A* 26A 31B 20C 6Journal 96Unranked 26
YearRankTypeTitle / Venue / Authors
2023 B conf
Dynamic Constant Time Parallel Graph Algorithms with Sub-Linear Work.
MFCS
Jonas Schmidt, Thomas Schwentick
2023 J jnl
Dynamic constant time parallel graph algorithms with sub-linear work.
CoRR
Jonas Schmidt, Thomas Schwentick
2023 B conf
On the Work of Dynamic Constant-Time Parallel Algorithms for Regular Tree Languages and Context-Free Languages.
MFCS
Jonas Schmidt, Thomas Schwentick, Jennifer Todtenhoefer
2023 J jnl
On the work of dynamic constant-time parallel algorithms for regular tree languages and context-free languages.
CoRR
Jonas Schmidt, Thomas Schwentick, Jennifer Todtenhoefer
2023 J jnl
Rewriting with Acyclic Queries: Mind Your Head.
Log. Methods Comput. Sci.
Gaetano Geck, Jens Keppeler, Thomas Schwentick, Christopher Spinrath
2023 A conf
Work-Efficient Query Evaluation with PRAMs.
ICDT
Jens Keppeler, Thomas Schwentick, Christopher Spinrath
2023 J jnl
Work-Efficient Query Evaluation with PRAMs.
CoRR
Jens Keppeler, Thomas Schwentick, Christopher Spinrath
2022 — conf
Low-Latency Sliding Window Algorithms for Formal Languages.
FSTTCS
Moses Ganardi, Louis Jachiet, Markus Lohrey, Thomas Schwentick
2022 J jnl
Low-Latency Sliding Window Algorithms for Formal Languages.
CoRR
Moses Ganardi, Louis Jachiet, Markus Lohrey, Thomas Schwentick
2022 A conf
Rewriting with Acyclic Queries: Mind Your Head.
ICDT
Gaetano Geck, Jens Keppeler, Thomas Schwentick, Christopher Spinrath
2022 J jnl
Rewriting with Acyclic Queries: Mind your Head.
CoRR
Gaetano Geck, Jens Keppeler, Thomas Schwentick, Christopher Spinrath
2021 A* conf
2021 ACM PODS Alberto O. Mendelzon Test-of-Time Award.
PODS
Angela Bonifati, Rasmus Pagh, Thomas Schwentick
2021 J jnl
Ackermann Award 2021.
Bull. EATCS
Thomas Schwentick
2021 — ch.
Automata and finite model theory.
Handbook of Automata Theory (II.)
Wouter Gelade, Thomas Schwentick
2021 B conf
Work-sensitive Dynamic Complexity of Formal Languages.
FoSSaCS
Jonas Schmidt, Thomas Schwentick, Till Tantau, Nils Vortmeier, Thomas Zeume
2021 J jnl
Work-sensitive Dynamic Complexity of Formal Languages.
CoRR
Jonas Schmidt, Thomas Schwentick, Till Tantau, Nils Vortmeier, Thomas Zeume
2020 A conf
Distribution Constraints: The Chase for Distributed Data.
ICDT
Gaetano Geck, Frank Neven, Thomas Schwentick
2020 J jnl
Distribution Constraints: The Chase for Distributed Data.
CoRR
Gaetano Geck, Frank Neven, Thomas Schwentick
2020 B conf
Dynamic Complexity Meets Parameterised Algorithms.
CSL
Jonas Schmidt, Thomas Schwentick, Nils Vortmeier, Thomas Zeume, Ioannis Kokkinis
2020 J jnl
Sketches of Dynamic Complexity.
SIGMOD Rec.
Thomas Schwentick, Nils Vortmeier, Thomas Zeume
2019 J jnl
A Strategy for Dynamic Programs: Start over and Muddle through.
Log. Methods Comput. Sci.
Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume
2019 J jnl
Dynamic Complexity Meets Parameterised Algorithms.
CoRR
Jonas Schmidt, Thomas Schwentick, Nils Vortmeier, Thomas Zeume, Ioannis Kokkinis
2019 J jnl
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation.
ACM Trans. Comput. Log.
Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick
2019 A conf
Parallel-Correctness and Parallel-Boundedness for Datalog Programs.
ICDT
Frank Neven, Thomas Schwentick, Christopher Spinrath, Brecht Vandevoort
2019 B conf
Winning Strategies for Streaming Rewriting Games.
FCT
Christian Coester, Thomas Schwentick, Martin Schuster
2018 J jnl
Conjunctive query containment over trees using schema information.
Acta Informatica
Henrik Björklund, Wim Martens, Thomas Schwentick
2018 J jnl
Dynamic Complexity under Definable Changes.
ACM Trans. Database Syst.
Thomas Schwentick, Nils Vortmeier, Thomas Zeume
2018 J jnl
Reachability Is in DynFO.
J. ACM
Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume
2018 J jnl
Reasoning About XML Constraints Based on XML-to-Relational Mappings.
Theory Comput. Syst.
Matthias Niewerth, Thomas Schwentick
2018 J jnl
Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151).
Dagstuhl Manifestos
Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu, Diego Calvanese, Claire David, Richard Hull, Eyke Hüllermeier, Benny Kimelfeld, Leonid Libkin, Wim Martens, Tova Milo, Filip Murlak, Frank Neven, Magdalena Ortiz, Thomas Schwentick, Julia Stoyanovich, Jianwen Su, Dan Suciu, Victor Vianu, Ke Yi
2018 J jnl
Streaming Rewriting Games: Winning Strategies and Complexity.
CoRR
Christian Coester, Thomas Schwentick, Martin Schuster
2018 B conf
The Ackermann Award 2018.
CSL
Dexter Kozen, Thomas Schwentick
2017 A* conf
A Strategy for Dynamic Programs: Start over and Muddle Through.
ICALP
Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume
2017 J jnl
A Strategy for Dynamic Programs: Start over and Muddle through.
CoRR
Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume
2017 J jnl
BonXai: Combining the Simplicity of DTD with the Expressiveness of XML Schema.
ACM Trans. Database Syst.
Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick
2017 A conf
Dynamic Complexity under Definable Changes.
ICDT
Thomas Schwentick, Nils Vortmeier, Thomas Zeume
2017 J jnl
Dynamic Complexity under Definable Changes.
CoRR
Thomas Schwentick, Nils Vortmeier, Thomas Zeume
2017 J jnl
Dynamic Conjunctive Queries.
CoRR
Thomas Zeume, Thomas Schwentick
2017 J jnl
Dynamic conjunctive queries.
J. Comput. Syst. Sci.
Thomas Zeume, Thomas Schwentick
2017 J jnl
Finite and Algorithmic Model Theory (Dagstuhl Seminar 17361).
Dagstuhl Reports
Anuj Dawar, Erich Grädel, Phokion G. Kolaitis, Thomas Schwentick
2017 J jnl
Games for Active XML Revisited.
Theory Comput. Syst.
Martin Schuster, Thomas Schwentick
2017 J jnl
Parallel-Correctness and Transferability for Conjunctive Queries.
J. ACM
Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick
2017 J jnl
Reasoning on data partitioning for single-round multi-join evaluation in massively parallel systems.
Commun. ACM
Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick
2017 J jnl
Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151).
CoRR
Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu, Diego Calvanese, Claire David, Richard Hull, Eyke Hüllermeier, Benny Kimelfeld, Leonid Libkin, Wim Martens, Tova Milo, Filip Murlak, Frank Neven, Magdalena Ortiz, Thomas Schwentick, Julia Stoyanovich, Jianwen Su, Dan Suciu, Victor Vianu, Ke Yi
2016 J jnl
Data partitioning for single-round multi-join evaluation in massively parallel systems.
SIGMOD Rec.
Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick
2016 J jnl
Dynamic complexity: recent updates.
ACM SIGLOG News
Thomas Schwentick, Thomas Zeume
2016 J jnl
Foundations of Data Management (Dagstuhl Perspectives Workshop 16151).
Dagstuhl Reports
Marcelo Arenas, Richard Hull, Wim Martens, Tova Milo, Thomas Schwentick
2016 A conf
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation.
ICDT
Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick
2016 J jnl
Research Directions for Principles of Data Management (Abridged).
SIGMOD Rec.
Serge Abiteboul, Marcelo Arenas, Pablo Barceló, Meghyn Bienvenu, Diego Calvanese, Claire David, Richard Hull, Eyke Hüllermeier, Benny Kimelfeld, Leonid Libkin, Wim Martens, Tova Milo, Filip Murlak, Frank Neven, Magdalena Ortiz, Thomas Schwentick, Julia Stoyanovich, Jianwen Su, Dan Suciu, Victor Vianu, Ke Yi
2015 A* conf
BonXai: Combining the simplicity of DTD with the expressiveness of XML Schema.
PODS
Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick
2015 J jnl
Circuits, Logic and Games (Dagstuhl Seminar 15401).
Dagstuhl Reports
Mikolaj Bojanczyk, Meena Mahajan, Thomas Schwentick, Heribert Vollmer
2015 A conf
Games for Active XML Revisited.
ICDT
Martin Schuster, Thomas Schwentick
2015 J jnl
On the quantifier-free dynamic complexity of Reachability.
Inf. Comput.
Thomas Zeume, Thomas Schwentick
2015 J jnl
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation.
CoRR
Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick
2015 A* conf
Parallel-Correctness and Transferability for Conjunctive Queries.
PODS
Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick
2015 — conf
Reachability is in DynFO.
ICALP (2)
Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume
2015 J jnl
Reachability is in DynFO.
CoRR
Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume
2015 J jnl
Static Analysis for Logic-Based Dynamic Programs.
CoRR
Thomas Schwentick, Nils Vortmeier, Thomas Zeume
2015 B conf
Static Analysis for Logic-based Dynamic Programs.
CSL
Thomas Schwentick, Nils Vortmeier, Thomas Zeume
2014 A conf
Dynamic Conjunctive Queries.
ICDT
Thomas Zeume, Thomas Schwentick
2014 J jnl
Games for Active XML Revisited.
CoRR
Martin Schuster, Thomas Schwentick
2014 J jnl
Parallel-Correctness and Transferability for Conjunctive Queries.
CoRR
Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick
2014 A conf
Reasoning about XML Constraints based on XML-to-relational mappings.
ICDT
Matthias Niewerth, Thomas Schwentick
2014 J jnl
The price of query rewriting in ontology-based data access.
Artif. Intell.
Georg Gottlob, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Thomas Schwentick, Michael Zakharyaschev
2013 J jnl
A Short Note on Two-Variable Logic with a Linear Order Successor and a Preorder Successor.
CoRR
Amaldev Manuel, Thomas Schwentick, Thomas Zeume
2013 C conf
Dynamic Communicating Automata and Branching High-Level MSCs.
LATA
Benedikt Bollig, Aiswarya Cyriac, Loïc Hélouët, Ahmet Kara, Thomas Schwentick
2013 A conf
On optimum left-to-right strategies for active context-free games.
ICDT
Henrik Björklund, Martin Schuster, Thomas Schwentick, Joscha Kulbatzki
2013 B conf
On the Quantifier-Free Dynamic Complexity of Reachability.
MFCS
Thomas Zeume, Thomas Schwentick
2013 J jnl
On the quantifier-free dynamic complexity of Reachability.
CoRR
Thomas Zeume, Thomas Schwentick
2013 C conf
Perspectives of Dynamic Complexity.
WoLLIC
Thomas Schwentick
2013 J jnl
Preface of Special Issue on Theoretical Aspects of Computer Science.
Theory Comput. Syst.
Christoph Dürr, Thomas Schwentick
2013 — conf
The Dynamic Complexity of the Reachability Problem on Graphs.
RP
Thomas Schwentick
2013 B conf
Validity of Tree Pattern Queries with Respect to Schema Information.
MFCS
Henrik Björklund, Wim Martens, Thomas Schwentick
2013 C conf
XML Schema Management: A Challenge for Automata Theory.
LATA
Thomas Schwentick
2012 J jnl
Developing and Analyzing XSDs through BonXai.
Proc. VLDB Endow.
Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick
2012 C conf
Feasible Automata for Two-Variable Logic with Successor on Data Words.
LATA
Ahmet Kara, Thomas Schwentick, Tony Tan
2012 — conf
Foundations of XML Based on Logic and Automata: A Snapshot.
FoIKS
Thomas Schwentick
2012 J jnl
On optimum left-to-right strategies for active context-free games
CoRR
Henrik Björklund, Martin Schuster, Thomas Schwentick, Joscha Kulbatzki
2012 A* conf
Rewriting Ontological Queries into Small Nonrecursive Datalog Programs.
KR
Georg Gottlob, Thomas Schwentick
2012 J jnl
The dynamic complexity of formal languages.
ACM Trans. Comput. Log.
Wouter Gelade, Marcel Marquardt, Thomas Schwentick
2012 J jnl
Theoretical Aspects of Computer Science.
Theory Comput. Syst.
Jean-Yves Marion, Thomas Schwentick
2012 J jnl
Two-Variable Logic with Two Order Relations
Log. Methods Comput. Sci.
Thomas Schwentick, Thomas Zeume
2011 A ed.
28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, Dortmund, Germany, March 10-12, 2011
STACS
Thomas Schwentick, Christoph Dürr
2011 J jnl
A note on the expressive power of linear orders
Log. Methods Comput. Sci.
Nicole Schweikardt, Thomas Schwentick
2011 J jnl
Conjunctive query containment over trees.
J. Comput. Syst. Sci.
Henrik Björklund, Wim Martens, Thomas Schwentick
2011 — conf
Expressiveness of Hybrid Temporal Logic on Data Words.
M4M/LAMAS
Ahmet Kara, Thomas Schwentick
2011 J jnl
Feasible Automata for Two-Variable Logic with Successor on Data Words
CoRR
Ahmet Kara, Thomas Schwentick, Tony Tan
2011 J jnl
Foundations of distributed data management (Dagstuhl Seminar 11421).
Dagstuhl Reports
Serge Abiteboul, Alin Deutsch, Thomas Schwentick, Luc Segoufin
2011 A conf
Frontmatter, Table of Contents, Preface, Conference Organization.
STACS
Thomas Schwentick, Christoph Dürr
2011 A* ed.
Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2011, June 12-16, 2011, Athens, Greece
PODS
Maurizio Lenzerini, Thomas Schwentick
2011 J jnl
Rewriting Ontological Queries into Small Nonrecursive Datalog Programs
CoRR
Georg Gottlob, Thomas Schwentick
2011 — conf
Rewriting Ontological Queries into Small Nonrecursive Datalog Programs.
Description Logics
Georg Gottlob, Thomas Schwentick
2011 A conf
Two-variable logic and key constraints on data words.
ICDT
Matthias Niewerth, Thomas Schwentick
2011 J jnl
Two-variable logic on data words.
ACM Trans. Comput. Log.
Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin
2010 — conf
10061 Abstracts Collection - Circuits, Logic, and Games.
Circuits, Logic, and Games
Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer
2010 — conf
10061 Executive Summary - Circuits, Logic, and Games.
Circuits, Logic, and Games
Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer
2010 A ed.
27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, Nancy, France, March 4-6, 2010
STACS
Jean-Yves Marion, Thomas Schwentick
2010 — ed.
Circuits, Logic, and Games, 07.02. - 12.02.2010
Circuits, Logic, and Games
Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer
2010 J jnl
Complexity of hybrid logics over transitive frames.
J. Appl. Log.
Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber
2010 A conf
Foreword -- 27th International Symposium on Theoretical Aspects of Computer Science.
STACS
Jean-Yves Marion, Thomas Schwentick
2010 J jnl
Inference of concise regular expressions and DTDs.
ACM Trans. Database Syst.
Geert Jan Bex, Frank Neven, Thomas Schwentick, Stijn Vansummeren
2010 J jnl
Logik und Automaten: ein echtes Dreamteam.
Inform. Spektrum
Henrik Björklund, Wim Martens, Nicole Schweikardt, Thomas Schwentick
2010 J jnl
On notions of regularity for data languages.
Theor. Comput. Sci.
Henrik Björklund, Thomas Schwentick
2010 A* conf
Schema design for XML repositories: complexity and tractability.
PODS
Wim Martens, Matthias Niewerth, Thomas Schwentick
2010 A conf
Table of Contents - 27th International Symposium on Theoretical Aspects of Computer Science.
STACS
Jean-Yves Marion, Thomas Schwentick
2010 J jnl
Temporal Logics on Words with Multiple Data Values
CoRR
Ahmet Kara, Thomas Schwentick, Thomas Zeume
2010 — conf
Temporal Logics on Words with Multiple Data Values.
FSTTCS
Ahmet Kara, Thomas Schwentick, Thomas Zeume
2010 — conf
The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey.
Fields of Logic and Computation
Thomas Eiter, Georg Gottlob, Thomas Schwentick
2010 B conf
Two-Variable Logic with Two Order Relations - (Extended Abstract).
CSL
Thomas Schwentick, Thomas Zeume
2009 J jnl
Complexity of Decision Problems for XML Schemas and Chain Regular Expressions.
SIAM J. Comput.
Wim Martens, Frank Neven, Thomas Schwentick
2009 J jnl
Foreword.
Theory Comput. Syst.
Thomas Schwentick, Dan Suciu
2009 J jnl
Generalized hypertree decompositions: NP-hardness and tractable variants.
J. ACM
Georg Gottlob, Zoltán Miklós, Thomas Schwentick
2009 B conf
On the Hybrid Extension of CTL and CTL
MFCS
Ahmet Kara, Volker Weber, Martin Lange, Thomas Schwentick
2009 J jnl
On the Hybrid Extension of CTL and CTL+
CoRR
Ahmet Kara, Martin Lange, Thomas Schwentick, Volker Weber
2009 A conf
The Dynamic Complexity of Formal Languages.
STACS
Wouter Gelade, Marcel Marquardt, Thomas Schwentick
2009 — conf
Tree Projections: Game Characterization and Computational Aspects.
Graph Theory, Computational Intelligence and Thought
Georg Gottlob, Gianluigi Greco, Zoltán Miklós, Francesco Scarcello, Thomas Schwentick
2009 J jnl
Two-variable logic on data trees and XML reasoning.
J. ACM
Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin
2009 J jnl
Volker Weber.
J. Log. Lang. Inf.
Thomas Schwentick, Henrik Björklund
2008 — conf
08171 Abstracts Collection - Beyond the Finite: New Challenges in Verification and Semistructured Data.
Beyond the Finite: New Challenges in Verification and Semistructured Data
Anca Muscholl, Ramaswamy Ramanujam, Michaël Rusinowitch, Thomas Schwentick, Victor Vianu
2008 — conf
08171 Summary - Beyond the Finite: New Challenges in Verification and Semistructured Data.
Beyond the Finite: New Challenges in Verification and Semistructured Data
Anca Muscholl, Ramaswamy Ramanujam, Michaël Rusinowitch, Thomas Schwentick, Victor Vianu
2008 A conf
A Little Bit Infinite? On Adding Data to Finitely Labelled Structures (Abstract).
STACS
Thomas Schwentick
2008 — ed.
Beyond the Finite: New Challenges in Verification and Semistructured Data, 20.04. - 25.04.2008
Beyond the Finite: New Challenges in Verification and Semistructured Data
Anca Muscholl, Ramaswamy Ramanujam, Michaël Rusinowitch, Thomas Schwentick, Victor Vianu
2008 J jnl
Complexity of Hybrid Logics over Transitive Frames
CoRR
Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber
2008 — conf
Counting in trees.
Logic and Automata
Helmut Seidl, Thomas Schwentick, Anca Muscholl
2008 — conf
Deterministic top-down tree automata: past, present, and future.
Logic and Automata
Wim Martens, Frank Neven, Thomas Schwentick
2008 J jnl
Dynamic Complexity of Formal Languages
CoRR
Wouter Gelade, Marcel Marquardt, Thomas Schwentick
2008 J jnl
Introduction to ICDT 2007 special section.
ACM Trans. Database Syst.
Thomas Schwentick, Dan Suciu
2008 B conf
Optimizing Conjunctive Queries over Trees Using Schema Information.
MFCS
Henrik Björklund, Wim Martens, Thomas Schwentick
2007 J jnl
Automata for XML - A survey.
J. Comput. Syst. Sci.
Thomas Schwentick
2007 A conf
Bounded-Variable Fragments of Hybrid Logics.
STACS
Thomas Schwentick, Volker Weber
2007 — ed.
Circuits, Logic, and Games, 08.11. - 10.11.2006
Circuits, Logic, and Games
Thomas Schwentick, Denis Thérien, Heribert Vollmer
2007 — conf
Conjunctive Query Containment over Trees.
DBPL
Henrik Björklund, Wim Martens, Thomas Schwentick
2007 A ed.
Database Theory - ICDT 2007, 11th International Conference, Barcelona, Spain, January 10-12, 2007, Proceedings
ICDT
Thomas Schwentick, Dan Suciu
2007 J jnl
Dynamic Complexity Theory Revisited.
Theory Comput. Syst.
Volker Weber, Thomas Schwentick
2007 A* conf
Generalized hypertree decompositions: np-hardness and tractable variants.
PODS
Georg Gottlob, Zoltán Miklós, Thomas Schwentick
2007 B conf
On Notions of Regularity for Data Languages.
FCT
Henrik Björklund, Thomas Schwentick
2007 J jnl
Simple off the shelf abstractions for XML schema.
SIGMOD Rec.
Wim Martens, Frank Neven, Thomas Schwentick
2007 A* conf
The complexity of reasoning about pattern-based XML schemas.
PODS
Gjergji Kasneci, Thomas Schwentick
2006 — conf
06451 Abstracts Collection -- Circuits, Logic, and Games .
Circuits, Logic, and Games
Thomas Schwentick, Denis Thérien, Heribert Vollmer
2006 — conf
06451 Executive Summary -- Circuits, Logic, and Games .
Circuits, Logic, and Games
Thomas Schwentick, Denis Thérien, Heribert Vollmer
2006 J jnl
Active Context-Free Games.
Theory Comput. Syst.
Anca Muscholl, Thomas Schwentick, Luc Segoufin
2006 — conf
Expressive Power of Pebble Automata.
ICALP (1)
Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin
2006 J jnl
Expressiveness and complexity of XML Schema.
ACM Trans. Database Syst.
Wim Martens, Frank Neven, Thomas Schwentick, Geert Jan Bex
2006 A* conf
Inference of Concise DTDs from XML Data.
VLDB
Geert Jan Bex, Frank Neven, Thomas Schwentick, Karl Tuyls
2006 J jnl
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
CoRR
Frank Neven, Thomas Schwentick
2006 J jnl
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables.
Log. Methods Comput. Sci.
Frank Neven, Thomas Schwentick
2006 J jnl
The many faces of a translation.
J. Comput. Syst. Sci.
Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer
2006 A* conf
Two-Variable Logic on Words with Data.
LICS
Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David
2006 A* conf
Two-variable logic on data trees and XML reasoning.
PODS
Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin
2005 — conf
05061 Abstracts Collection - Foundations of Semistructured Data.
Foundations of Semistructured Data
Frank Neven, Thomas Schwentick, Dan Suciu
2005 — conf
05061 Summary - Foundations of Semi-structured Data.
Foundations of Semistructured Data
Frank Neven, Thomas Schwentick, Dan Suciu
2005 A conf
Dynamic Complexity Theory Revisited.
STACS
Volker Weber, Thomas Schwentick
2005 A* conf
Expressiveness of XSDs: from practice to theory, there and back again.
WWW
Geert Jan Bex, Wim Martens, Frank Neven, Thomas Schwentick
2005 — ed.
Foundations of Semistructured Data, 6.-11. February 2005
Foundations of Semistructured Data
Frank Neven, Thomas Schwentick, Dan Suciu
2005 A conf
On the Complexity of Equational Horn Clauses.
CADE
Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentick
2005 A conf
Which XML Schemas Admit 1-Pass Preorder Typing?
ICDT
Wim Martens, Frank Neven, Thomas Schwentick
2004 A conf
Active Context-Free Games.
STACS
Anca Muscholl, Thomas Schwentick, Luc Segoufin
2004 B conf
Complexity of Decision Problems for Simple Regular Expressions.
MFCS
Wim Martens, Frank Neven, Thomas Schwentick
2004 A* conf
Counting in Trees for Free.
ICALP
Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl
2004 J jnl
Existential second-order logic over graphs: Charting the tractability frontier.
J. ACM
Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick
2004 J jnl
Finite state machines for strings over infinite alphabets.
ACM Trans. Comput. Log.
Frank Neven, Thomas Schwentick, Victor Vianu
2004 J jnl
Solving Equations in the Relational Algebra.
SIAM J. Comput.
Joachim Biskup, Jan Paredaens, Thomas Schwentick, Jan Van den Bussche
2004 A* conf
Trees, Automata and XML.
PODS
Thomas Schwentick
2004 J jnl
XPath query containment.
SIGMOD Rec.
Thomas Schwentick
2003 J jnl
Definable relations and first-order query languages over strings.
J. ACM
Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin
2003 A* conf
Numerical document queries.
PODS
Helmut Seidl, Thomas Schwentick, Anca Muscholl
2003 J jnl
On the power of tree-walking automata.
Inf. Comput.
Frank Neven, Thomas Schwentick
2003 — conf
XML: Model, Schemas, Types, Logics, and Queries.
Logics for Emerging Applications of Databases
Nils Klarlund, Thomas Schwentick, Dan Suciu
2003 A conf
XPath Containment in the Presence of Disjunction, DTDs, and Variables.
ICDT
Frank Neven, Thomas Schwentick
2002 J jnl
Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time.
SIAM J. Comput.
Etienne Grandjean, Thomas Schwentick
2002 J jnl
Query automata over finite trees.
Theor. Comput. Sci.
Frank Neven, Thomas Schwentick
2001 A* conf
A Model-Theoretic Approach to Regular String Relations.
LICS
Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin
2001 — conf
Automata-and Logic-Based Pattern Languages for Tree-Structured Data.
Semantics in Databases
Frank Neven, Thomas Schwentick
2001 C conf
Partially-Ordered Two-Way Automata: A New Characterization of DA.
Developments in Language Theory
Thomas Schwentick, Denis Thérien, Heribert Vollmer
2001 C conf
Second-Order Logic over Strings: Regular and Non-regular Fragments.
Developments in Language Theory
Thomas Eiter, Georg Gottlob, Thomas Schwentick
2001 J jnl
Solving equations in the relational algebra
CoRR
Joachim Biskup, Jan Paredaens, Thomas Schwentick, Jan Van den Bussche
2001 A* conf
String Operations in Query Languages.
PODS
Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin
2001 J jnl
The Descriptive Complexity Approach to LOGCFL.
J. Comput. Syst. Sci.
Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
2001 B conf
Towards Regular Languages over Infinite Alphabets.
MFCS
Frank Neven, Thomas Schwentick, Victor Vianu
2001 A* conf
When is the evaluation of conjunctive queries tractable?
STOC
Martin Grohe, Thomas Schwentick, Luc Segoufin
2000 A* conf
Existential Second-Order Logic over Graphs: Charting the Tractability Frontier.
FOCS
Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick
2000 A* conf
Expressive and Efficient Pattern Languages for Tree-Structured Data.
PODS
Frank Neven, Thomas Schwentick
2000 J jnl
Locality of order-invariant first-order formulas.
ACM Trans. Comput. Log.
Martin Grohe, Thomas Schwentick
2000 — conf
Logically defined queries on trees.
Grundlagen von Datenbanken
Thomas Schwentick
2000 B conf
On Diving in Trees.
MFCS
Thomas Schwentick
2000 A* conf
On the Power of Tree-Walking Automata.
ICALP
Frank Neven, Thomas Schwentick
2000 A* conf
The Many Faces of a Translation.
ICALP
Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer
1999 A conf
A Logical Characterisation of Linear Time on Nondeterministic Turing Machines.
STACS
Clemens Lautemann, Nicole Schweikardt, Thomas Schwentick
1999 — conf
Automata for Unary Queries on Trees.
Grundlagen von Datenbanken
Frank Neven, Thomas Schwentick
1999 J jnl
Local Normal Forms for First-Order Logic with Applications to Games and Automata.
Discret. Math. Theor. Comput. Sci.
Thomas Schwentick, Klaus Barthelmann
1999 A* conf
Query Automata.
PODS
Frank Neven, Thomas Schwentick
1999 A conf
The Descriptive Complexity Approach to LOGCFL.
STACS
Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
1998 B conf
Descriptive Complexity, Lower Bounds and Linear Time.
CSL
Thomas Schwentick
1998 A conf
Local Normal Forms for First-Order Logic with Applications to Games and Automata.
STACS
Thomas Schwentick, Klaus Barthelmann
1998 B conf
Locality of Order-Invariant First-Order Formulas.
MFCS
Martin Grohe, Thomas Schwentick
1998 J jnl
Positive Versions of Polynomial Time.
Inf. Comput.
Clemens Lautemann, Thomas Schwentick, Iain A. Stewart
1998 J jnl
Subclasses of Binary NP.
J. Log. Comput.
Arnaud Durand, Clemens Lautemann, Thomas Schwentick
1998 J jnl
The Descriptive Complexity Approach to LOGCFL
Electron. Colloquium Comput. Complex.
Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
1998 J jnl
The descriptive complexity approach to LOGCFL
CoRR
Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer
1997 A conf
Algebraic and Logical Characterizations of Deterministic Linear Time Classes.
STACS
Thomas Schwentick
1997 B conf
Padding and the Expressive Power of Existential Second-Order Logics.
CSL
Thomas Schwentick
1996 A conf
On Bijections vs. Unary Functions.
STACS
Thomas Schwentick
1996 A conf
On Positive P.
CCC
Clemens Lautemann, Thomas Schwentick, Iain A. Stewart
1996 J jnl
On Winning Ehrenfeucht Games and Monadic NP.
Ann. Pure Appl. Log.
Thomas Schwentick
1995 A* conf
Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree.
ICALP
Thomas Schwentick
1995 — —
On winning Ehrenfeucht games and monadic NP.
Thomas Schwentick
1995 J jnl
The Power of the Middle Bit of a #P Function.
J. Comput. Syst. Sci.
Frederic Green, Johannes Köbler, Kenneth W. Regan, Thomas Schwentick, Jacobo Torán
1994 A* conf
Graph Connectivity and Monadic NP
FOCS
Thomas Schwentick
1994 B conf
Logics For Context-Free Languages.
CSL
Clemens Lautemann, Thomas Schwentick, Denis Thérien
1993 — conf
On the Power of Polynomial Time Bit-Reductions (Extended Abstract).
SCT
Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner
1992 J jnl
On the Power of Polynomial Bit-Reductions
Universität Trier, Mathematik/Informatik, Forschungsbericht
Ulrich Hertrampf, Clemens Lautemann, Thomas Schwentick, Heribert Vollmer, Klaus W. Wagner