default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Schwentick
Person information
- affiliation: TU Dortmund, Department of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j60]Gaetano Geck, Jens Keppeler, Thomas Schwentick, Christopher Spinrath:
Rewriting with Acyclic Queries: Mind Your Head. Log. Methods Comput. Sci. 19(4) (2023)- [c97]Jens Keppeler, Thomas Schwentick, Christopher Spinrath:
Work-Efficient Query Evaluation with PRAMs. ICDT 2023: 16:1-16:20 - [c96]Jonas Schmidt, Thomas Schwentick:
Dynamic Constant Time Parallel Graph Algorithms with Sub-Linear Work. MFCS 2023: 80:1-80:15 - [c95]Jonas Schmidt, Thomas Schwentick, Jennifer Todtenhoefer:
On the Work of Dynamic Constant-Time Parallel Algorithms for Regular Tree Languages and Context-Free Languages. MFCS 2023: 81:1-81:15 - [i44]Jens Keppeler, Thomas Schwentick, Christopher Spinrath:
Work-Efficient Query Evaluation with PRAMs. CoRR abs/2301.08178 (2023) - [i43]Jonas Schmidt, Thomas Schwentick:
Dynamic constant time parallel graph algorithms with sub-linear work. CoRR abs/2307.10107 (2023) - [i42]Jonas Schmidt, Thomas Schwentick, Jennifer Todtenhoefer:
On the work of dynamic constant-time parallel algorithms for regular tree languages and context-free languages. CoRR abs/2307.10131 (2023) - 2022
- [c94]Moses Ganardi, Louis Jachiet, Markus Lohrey, Thomas Schwentick:
Low-Latency Sliding Window Algorithms for Formal Languages. FSTTCS 2022: 38:1-38:23 - [c93]Gaetano Geck, Jens Keppeler, Thomas Schwentick, Christopher Spinrath:
Rewriting with Acyclic Queries: Mind Your Head. ICDT 2022: 8:1-8:20 - [i41]Gaetano Geck, Jens Keppeler, Thomas Schwentick, Christopher Spinrath:
Rewriting with Acyclic Queries: Mind your Head. CoRR abs/2201.05129 (2022) - [i40]Moses Ganardi, Louis Jachiet, Markus Lohrey, Thomas Schwentick:
Low-Latency Sliding Window Algorithms for Formal Languages. CoRR abs/2209.14835 (2022) - 2021
- [j59]Thomas Schwentick:
Ackermann Award 2021. Bull. EATCS 134 (2021) - [c92]Jonas Schmidt, Thomas Schwentick, Till Tantau, Nils Vortmeier, Thomas Zeume:
Work-sensitive Dynamic Complexity of Formal Languages. FoSSaCS 2021: 490-509 - [c91]Angela Bonifati, Rasmus Pagh, Thomas Schwentick:
2021 ACM PODS Alberto O. Mendelzon Test-of-Time Award. PODS 2021: 82 - [p1]Wouter Gelade, Thomas Schwentick:
Automata and finite model theory. Handbook of Automata Theory (II.) 2021: 1071-1103 - [i39]Jonas Schmidt, Thomas Schwentick, Till Tantau, Nils Vortmeier, Thomas Zeume:
Work-sensitive Dynamic Complexity of Formal Languages. CoRR abs/2101.08735 (2021) - 2020
- [j58]Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
Sketches of Dynamic Complexity. SIGMOD Rec. 49(2): 18-29 (2020) - [c90]Jonas Schmidt, Thomas Schwentick, Nils Vortmeier, Thomas Zeume, Ioannis Kokkinis
:
Dynamic Complexity Meets Parameterised Algorithms. CSL 2020: 36:1-36:17 - [c89]Gaetano Geck, Frank Neven, Thomas Schwentick:
Distribution Constraints: The Chase for Distributed Data. ICDT 2020: 13:1-13:19 - [i38]Gaetano Geck, Frank Neven, Thomas Schwentick:
Distribution Constraints: The Chase for Distributed Data. CoRR abs/2003.00965 (2020)
2010 – 2019
- 2019
- [j57]Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
A Strategy for Dynamic Programs: Start over and Muddle through. Log. Methods Comput. Sci. 15(2) (2019) - [j56]Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation. ACM Trans. Comput. Log. 20(3): 18:1-18:24 (2019) - [c88]Christian Coester, Thomas Schwentick, Martin Schuster:
Winning Strategies for Streaming Rewriting Games. FCT 2019: 49-63 - [c87]Frank Neven, Thomas Schwentick, Christopher Spinrath, Brecht Vandevoort:
Parallel-Correctness and Parallel-Boundedness for Datalog Programs. ICDT 2019: 14:1-14:19 - [i37]Jonas Schmidt, Thomas Schwentick, Nils Vortmeier, Thomas Zeume, Ioannis Kokkinis:
Dynamic Complexity Meets Parameterised Algorithms. CoRR abs/1910.06281 (2019) - 2018
- [j55]Henrik Björklund, Wim Martens, Thomas Schwentick:
Conjunctive query containment over trees using schema information. Acta Informatica 55(1): 17-56 (2018) - [j54]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:
Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151). Dagstuhl Manifestos 7(1): 1-29 (2018) - [j53]Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume:
Reachability Is in DynFO. J. ACM 65(5): 33:1-33:24 (2018) - [j52]Matthias Niewerth, Thomas Schwentick:
Reasoning About XML Constraints Based on XML-to-Relational Mappings. Theory Comput. Syst. 62(8): 1826-1879 (2018) - [j51]Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
Dynamic Complexity under Definable Changes. ACM Trans. Database Syst. 43(3): 12:1-12:38 (2018) - [c86]Dexter Kozen, Thomas Schwentick:
The Ackermann Award 2018. CSL 2018: 1:1-1:5 - [i36]Christian Coester, Thomas Schwentick, Martin Schuster:
Streaming Rewriting Games: Winning Strategies and Complexity. CoRR abs/1804.10292 (2018) - 2017
- [j50]Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Reasoning on data partitioning for single-round multi-join evaluation in massively parallel systems. Commun. ACM 60(3): 93-100 (2017) - [j49]Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Parallel-Correctness and Transferability for Conjunctive Queries. J. ACM 64(5): 36:1-36:38 (2017) - [j48]Thomas Zeume, Thomas Schwentick:
Dynamic conjunctive queries. J. Comput. Syst. Sci. 88: 3-26 (2017) - [j47]Martin Schuster, Thomas Schwentick:
Games for Active XML Revisited. Theory Comput. Syst. 61(1): 84-155 (2017) - [j46]Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick:
BonXai: Combining the Simplicity of DTD with the Expressiveness of XML Schema. ACM Trans. Database Syst. 42(3): 15:1-15:42 (2017) - [c85]Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
A Strategy for Dynamic Programs: Start over and Muddle Through. ICALP 2017: 98:1-98:14 - [c84]Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
Dynamic Complexity under Definable Changes. ICDT 2017: 19:1-19:18 - [i35]Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
Dynamic Complexity under Definable Changes. CoRR abs/1701.02494 (2017) - [i34]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:
Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151). CoRR abs/1701.09007 (2017) - [i33]Thomas Zeume, Thomas Schwentick:
Dynamic Conjunctive Queries. CoRR abs/1704.01286 (2017) - [i32]Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
A Strategy for Dynamic Programs: Start over and Muddle through. CoRR abs/1704.07998 (2017) - [i31]Anuj Dawar, Erich Grädel, Phokion G. Kolaitis, Thomas Schwentick:
Finite and Algorithmic Model Theory (Dagstuhl Seminar 17361). Dagstuhl Reports 7(9): 1-25 (2017) - 2016
- [j45]Thomas Schwentick, Thomas Zeume:
Dynamic complexity: recent updates. ACM SIGLOG News 3(2): 30-52 (2016) - [j44]Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Data partitioning for single-round multi-join evaluation in massively parallel systems. SIGMOD Rec. 45(1): 33-40 (2016) - [j43]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:
Research Directions for Principles of Data Management (Abridged). SIGMOD Rec. 45(4): 5-17 (2016) - [c83]Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation. ICDT 2016: 9:1-9:17 - [i30]Marcelo Arenas, Richard Hull, Wim Martens, Tova Milo, Thomas Schwentick:
Foundations of Data Management (Dagstuhl Perspectives Workshop 16151). Dagstuhl Reports 6(4): 39-56 (2016) - 2015
- [j42]Thomas Zeume, Thomas Schwentick:
On the quantifier-free dynamic complexity of Reachability. Inf. Comput. 240: 108-129 (2015) - [c82]Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
Static Analysis for Logic-based Dynamic Programs. CSL 2015: 308-324 - [c81]Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume:
Reachability is in DynFO. ICALP (2) 2015: 159-170 - [c80]Martin Schuster, Thomas Schwentick:
Games for Active XML Revisited. ICDT 2015: 60-75 - [c79]Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Parallel-Correctness and Transferability for Conjunctive Queries. PODS 2015: 47-58 - [c78]Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick:
BonXai: Combining the simplicity of DTD with the expressiveness of XML Schema. PODS 2015: 145-156 - [i29]Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume:
Reachability is in DynFO. CoRR abs/1502.07467 (2015) - [i28]Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
Static Analysis for Logic-Based Dynamic Programs. CoRR abs/1507.04537 (2015) - [i27]Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation. CoRR abs/1512.06246 (2015) - [i26]Mikolaj Bojanczyk, Meena Mahajan, Thomas Schwentick, Heribert Vollmer:
Circuits, Logic and Games (Dagstuhl Seminar 15401). Dagstuhl Reports 5(9): 105-124 (2015) - 2014
- [j41]Georg Gottlob, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Thomas Schwentick, Michael Zakharyaschev:
The price of query rewriting in ontology-based data access. Artif. Intell. 213: 42-59 (2014) - [c77]Thomas Zeume, Thomas Schwentick:
Dynamic Conjunctive Queries. ICDT 2014: 38-49 - [c76]Matthias Niewerth, Thomas Schwentick:
Reasoning about XML Constraints based on XML-to-relational mappings. ICDT 2014: 72-83 - [i25]Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Parallel-Correctness and Transferability for Conjunctive Queries. CoRR abs/1412.4030 (2014) - [i24]Martin Schuster, Thomas Schwentick:
Games for Active XML Revisited. CoRR abs/1412.5910 (2014) - 2013
- [j40]Christoph Dürr, Thomas Schwentick:
Preface of Special Issue on Theoretical Aspects of Computer Science. Theory Comput. Syst. 53(2): 123-125 (2013) - [c75]Henrik Björklund, Martin Schuster, Thomas Schwentick, Joscha Kulbatzki:
On optimum left-to-right strategies for active context-free games. ICDT 2013: 105-116 - [c74]Thomas Schwentick:
XML Schema Management: A Challenge for Automata Theory. LATA 2013: 43 - [c73]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 - [c72]Henrik Björklund, Wim Martens, Thomas Schwentick:
Validity of Tree Pattern Queries with Respect to Schema Information. MFCS 2013: 171-182 - [c71]Thomas Zeume, Thomas Schwentick:
On the Quantifier-Free Dynamic Complexity of Reachability. MFCS 2013: 837-848 - [c70]Thomas Schwentick:
The Dynamic Complexity of the Reachability Problem on Graphs. RP 2013: 45 - [c69]Thomas Schwentick:
Perspectives of Dynamic Complexity. WoLLIC 2013: 33 - [i23]Thomas Zeume, Thomas Schwentick:
On the quantifier-free dynamic complexity of Reachability. CoRR abs/1306.3056 (2013) - [i22]Amaldev Manuel, Thomas Schwentick, Thomas Zeume:
A Short Note on Two-Variable Logic with a Linear Order Successor and a Preorder Successor. CoRR abs/1306.3418 (2013) - 2012
- [j39]Thomas Schwentick, Thomas Zeume:
Two-Variable Logic with Two Order Relations. Log. Methods Comput. Sci. 8(1) (2012) - [j38]Jean-Yves Marion, Thomas Schwentick:
Theoretical Aspects of Computer Science. Theory Comput. Syst. 51(2): 123-124 (2012) - [j37]Wim Martens, Frank Neven, Matthias Niewerth, Thomas Schwentick:
Developing and Analyzing XSDs through BonXai. Proc. VLDB Endow. 5(12): 1994-1997 (2012) - [j36]Wouter Gelade, Marcel Marquardt, Thomas Schwentick:
The dynamic complexity of formal languages. ACM Trans. Comput. Log. 13(3): 19:1-19:36 (2012) - [c68]Thomas Schwentick:
Foundations of XML Based on Logic and Automata: A Snapshot. FoIKS 2012: 23-33 - [c67]Georg Gottlob, Thomas Schwentick:
Rewriting Ontological Queries into Small Nonrecursive Datalog Programs. KR 2012 - [c66]Ahmet Kara, Thomas Schwentick, Tony Tan:
Feasible Automata for Two-Variable Logic with Successor on Data Words. LATA 2012: 351-362 - [i21]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) - 2011
- [j35]Nicole Schweikardt, Thomas Schwentick:
A note on the expressive power of linear orders. Log. Methods Comput. Sci. 7(4) (2011) - [j34]Henrik Björklund, Wim Martens, Thomas Schwentick:
Conjunctive query containment over trees. J. Comput. Syst. Sci. 77(3): 450-472 (2011) - [j33]Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin:
Two-variable logic on data words. ACM Trans. Comput. Log. 12(4): 27:1-27:26 (2011) - [c65]Georg Gottlob, Thomas Schwentick:
Rewriting Ontological Queries into Small Nonrecursive Datalog Programs. Description Logics 2011 - [c64]Matthias Niewerth, Thomas Schwentick:
Two-variable logic and key constraints on data words. ICDT 2011: 138-149 - [c63]Thomas Schwentick, Christoph Dürr:
Frontmatter, Table of Contents, Preface, Conference Organization. STACS 2011 - [c62]Ahmet Kara, Thomas Schwentick:
Expressiveness of Hybrid Temporal Logic on Data Words. M4M/LAMAS 2011: 115-128 - [e8]Maurizio Lenzerini, Thomas Schwentick:
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 [contents] - [e7]Thomas Schwentick, Christoph Dürr:
28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany. LIPIcs 9, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2011, ISBN 978-3-939897-25-5 [contents] - [i20]Georg Gottlob, Thomas Schwentick:
Rewriting Ontological Queries into Small Nonrecursive Datalog Programs. CoRR abs/1106.3767 (2011) - [i19]Ahmet Kara, Thomas Schwentick, Tony Tan:
Feasible Automata for Two-Variable Logic with Successor on Data Words. CoRR abs/1110.1221 (2011) - [i18]Serge Abiteboul, Alin Deutsch, Thomas Schwentick, Luc Segoufin:
Foundations of distributed data management (Dagstuhl Seminar 11421). Dagstuhl Reports 1(10): 37-57 (2011) - 2010
- [j32]Henrik Björklund, Wim Martens, Nicole Schweikardt, Thomas Schwentick:
Logik und Automaten: ein echtes Dreamteam. Inform. Spektrum 33(5): 452-461 (2010) - [j31]Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber:
Complexity of hybrid logics over transitive frames. J. Appl. Log. 8(4): 422-440 (2010) - [j30]Henrik Björklund, Thomas Schwentick:
On notions of regularity for data languages. Theor. Comput. Sci. 411(4-5): 702-715 (2010) - [j29]Geert Jan Bex, Frank Neven, Thomas Schwentick, Stijn Vansummeren:
Inference of concise regular expressions and DTDs. ACM Trans. Database Syst. 35(2): 11:1-11:47 (2010) - [c61]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 - [c60]Thomas Schwentick, Thomas Zeume:
Two-Variable Logic with Two Order Relations - (Extended Abstract). CSL 2010: 499-513 - [c59]Ahmet Kara, Thomas Schwentick, Thomas Zeume:
Temporal Logics on Words with Multiple Data Values. FSTTCS 2010: 481-492 - [c58]Wim Martens, Matthias Niewerth, Thomas Schwentick:
Schema design for XML repositories: complexity and tractability. PODS 2010: 239-250 - [c57]Jean-Yves Marion, Thomas Schwentick:
Foreword -- 27th International Symposium on Theoretical Aspects of Computer Science. STACS 2010: 1-6 - [c56]Jean-Yves Marion, Thomas Schwentick:
Table of Contents - 27th International Symposium on Theoretical Aspects of Computer Science. STACS 2010: 7-10 - [e6]Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
Circuits, Logic, and Games, 07.02. - 12.02.2010. Dagstuhl Seminar Proceedings 10061, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [e5]Jean-Yves Marion, Thomas Schwentick:
27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France. LIPIcs 5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2010, ISBN 978-3-939897-16-3 [contents] - [i17]Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
10061 Abstracts Collection - Circuits, Logic, and Games. Circuits, Logic, and Games 2010 - [i16]Benjamin Rossman, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
10061 Executive Summary - Circuits, Logic, and Games. Circuits, Logic, and Games 2010 - [i15]Ahmet Kara, Thomas Schwentick, Thomas Zeume:
Temporal Logics on Words with Multiple Data Values. CoRR abs/1010.1139 (2010)
2000 – 2009
- 2009
- [j28]Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin:
Two-variable logic on data trees and XML reasoning. J. ACM 56(3): 13:1-13:48 (2009) - [j27]Georg Gottlob, Zoltán Miklós, Thomas Schwentick:
Generalized hypertree decompositions: NP-hardness and tractable variants. J. ACM 56(6): 30:1-30:32 (2009) - [j26]Thomas Schwentick, Henrik Björklund:
Volker Weber. J. Log. Lang. Inf. 18(4): 433 (2009) - [j25]Thomas Schwentick, Dan Suciu:
Foreword. Theory Comput. Syst. 44(4): 501-502 (2009) - [j24]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) - [c55]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 - [c54]Ahmet Kara, Volker Weber, Martin Lange, Thomas Schwentick:
On the Hybrid Extension of CTL and CTL+. MFCS 2009: 427-438 - [c53]Wouter Gelade, Marcel Marquardt, Thomas Schwentick:
The Dynamic Complexity of Formal Languages. STACS 2009: 481-492 - [i14]Ahmet Kara, Martin Lange, Thomas Schwentick, Volker Weber:
On the Hybrid Extension of CTL and CTL+. CoRR abs/0906.2541 (2009) - 2008
- [j23]Thomas Schwentick, Dan Suciu:
Introduction to ICDT 2007 special section. ACM Trans. Database Syst. 33(4): 27:1 (2008) - [c52]Wim Martens, Frank Neven, Thomas Schwentick:
Deterministic top-down tree automata: past, present, and future. Logic and Automata 2008: 505-530 - [c51]Helmut Seidl, Thomas Schwentick, Anca Muscholl:
Counting in trees. Logic and Automata 2008: 575-612 - [c50]Henrik Björklund, Wim Martens, Thomas Schwentick:
Optimizing Conjunctive Queries over Trees Using Schema Information. MFCS 2008: 132-143 - [c49]Thomas Schwentick:
A Little Bit Infinite? On Adding Data to Finitely Labelled Structures (Abstract). STACS 2008: 17-18 - [e4]Anca Muscholl, Ramaswamy Ramanujam, Michaël Rusinowitch, Thomas Schwentick, Victor Vianu:
Beyond the Finite: New Challenges in Verification and Semistructured Data, 20.04. - 25.04.2008. Dagstuhl Seminar Proceedings 08171, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [i13]Anca Muscholl, Ramaswamy Ramanujam, Michaël Rusinowitch, Thomas Schwentick, Victor Vianu:
08171 Abstracts Collection - Beyond the Finite: New Challenges in Verification and Semistructured Data. Beyond the Finite: New Challenges in Verification and Semistructured Data 2008 - [i12]Anca Muscholl, Ramaswamy Ramanujam, Michaël Rusinowitch, Thomas Schwentick, Victor Vianu:
08171 Summary - Beyond the Finite: New Challenges in Verification and Semistructured Data. Beyond the Finite: New Challenges in Verification and Semistructured Data 2008 - [i11]Martin Mundhenk, Thomas Schneider, Thomas Schwentick, Volker Weber:
Complexity of Hybrid Logics over Transitive Frames. CoRR abs/0806.4130 (2008) - [i10]Wouter Gelade, Marcel Marquardt, Thomas Schwentick:
Dynamic Complexity of Formal Languages. CoRR abs/0812.1915 (2008) - 2007
- [j22]Thomas Schwentick:
Automata for XML - A survey. J. Comput. Syst. Sci. 73(3): 289-315 (2007) - [j21]Volker Weber, Thomas Schwentick:
Dynamic Complexity Theory Revisited. Theory Comput. Syst. 40(4): 355-377 (2007) - [j20]Wim Martens, Frank Neven, Thomas Schwentick:
Simple off the shelf abstractions for XML schema. SIGMOD Rec. 36(3): 15-22 (2007) - [c48]Henrik Björklund, Wim Martens, Thomas Schwentick:
Conjunctive Query Containment over Trees. DBPL 2007: 66-80 - [c47]Henrik Björklund, Thomas Schwentick:
On Notions of Regularity for Data Languages. FCT 2007: 88-99 - [c46]Georg Gottlob, Zoltán Miklós, Thomas Schwentick:
Generalized hypertree decompositions: np-hardness and tractable variants. PODS 2007: 13-22 - [c45]Gjergji Kasneci, Thomas Schwentick:
The complexity of reasoning about pattern-based XML schemas. PODS 2007: 155-164 - [c44]Thomas Schwentick, Volker Weber:
Bounded-Variable Fragments of Hybrid Logics. STACS 2007: 561-572 - [e3]Thomas Schwentick, Denis Thérien, Heribert Vollmer:
Circuits, Logic, and Games, 08.11. - 10.11.2006. Dagstuhl Seminar Proceedings 06451, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - [e2]Thomas Schwentick, Dan Suciu:
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 [contents] - 2006
- [j19]Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
The many faces of a translation. J. Comput. Syst. Sci. 72(1): 163-179 (2006) - [j18]Frank Neven, Thomas Schwentick:
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Log. Methods Comput. Sci. 2(3) (2006) - [j17]Anca Muscholl, Thomas Schwentick, Luc Segoufin:
Active Context-Free Games. Theory Comput. Syst. 39(1): 237-276 (2006) - [j16]Wim Martens, Frank Neven, Thomas Schwentick, Geert Jan Bex:
Expressiveness and complexity of XML Schema. ACM Trans. Database Syst. 31(3): 770-813 (2006) - [c43]Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin:
Expressive Power of Pebble Automata. ICALP (1) 2006: 157-168 - [c42]Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David:
Two-Variable Logic on Words with Data. LICS 2006: 7-16 - [c41]Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin:
Two-variable logic on data trees and XML reasoning. PODS 2006: 10-19 - [c40]Geert Jan Bex, Frank Neven, Thomas Schwentick, Karl Tuyls:
Inference of Concise DTDs from XML Data. VLDB 2006: 115-126 - [i9]Thomas Schwentick, Denis Thérien, Heribert Vollmer:
06451 Executive Summary -- Circuits, Logic, and Games . Circuits, Logic, and Games 2006 - [i8]Thomas Schwentick, Denis Thérien, Heribert Vollmer:
06451 Abstracts Collection -- Circuits, Logic, and Games . Circuits, Logic, and Games 2006 - [i7]Frank Neven, Thomas Schwentick:
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. CoRR abs/cs/0606065 (2006) - 2005
- [c39]Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentick:
On the Complexity of Equational Horn Clauses. CADE 2005: 337-352 - [c38]Wim Martens, Frank Neven, Thomas Schwentick:
Which XML Schemas Admit 1-Pass Preorder Typing? ICDT 2005: 68-82 - [c37]Volker Weber, Thomas Schwentick:
Dynamic Complexity Theory Revisited. STACS 2005: 256-268 - [c36]Geert Jan Bex, Wim Martens, Frank Neven, Thomas Schwentick:
Expressiveness of XSDs: from practice to theory, there and back again. WWW 2005: 712-721 - [e1]Frank Neven, Thomas Schwentick, Dan Suciu:
Foundations of Semistructured Data, 6.-11. February 2005. Dagstuhl Seminar Proceedings 05061, IBFI, Schloss Dagstuhl, Germany 2005 [contents] - [i6]Frank Neven, Thomas Schwentick, Dan Suciu:
05061 Abstracts Collection - Foundations of Semistructured Data. Foundations of Semistructured Data 2005 - [i5]Frank Neven, Thomas Schwentick, Dan Suciu:
05061 Summary - Foundations of Semi-structured Data. Foundations of Semistructured Data 2005 - 2004
- [j15]Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick:
Existential second-order logic over graphs: Charting the tractability frontier. J. ACM 51(2): 312-362 (2004) - [j14]Joachim Biskup, Jan Paredaens, Thomas Schwentick, Jan Van den Bussche:
Solving Equations in the Relational Algebra. SIAM J. Comput. 33(5): 1052-1066 (2004) - [j13]Thomas Schwentick:
XPath query containment. SIGMOD Rec. 33(1): 101-109 (2004) - [j12]Frank Neven, Thomas Schwentick, Victor Vianu:
Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log. 5(3): 403-435 (2004) - [c35]Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl:
Counting in Trees for Free. ICALP 2004: 1136-1149 - [c34]Wim Martens, Frank Neven, Thomas Schwentick:
Complexity of Decision Problems for Simple Regular Expressions. MFCS 2004: 889-900 - [c33]Thomas Schwentick:
Trees, Automata and XML. PODS 2004: 222 - [c32]Anca Muscholl, Thomas Schwentick, Luc Segoufin:
Active Context-Free Games. STACS 2004: 452-464 - 2003
- [j11]Frank Neven, Thomas Schwentick:
On the power of tree-walking automata. Inf. Comput. 183(1): 86-103 (2003) - [j10]Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin:
Definable relations and first-order query languages over strings. J. ACM 50(5): 694-751 (2003) - [c31]Nils Klarlund, Thomas Schwentick, Dan Suciu:
XML: Model, Schemas, Types, Logics, and Queries. Logics for Emerging Applications of Databases 2003: 1-41 - [c30]Frank Neven, Thomas Schwentick:
XPath Containment in the Presence of Disjunction, DTDs, and Variables. ICDT 2003: 312-326 - [c29]Helmut Seidl, Thomas Schwentick, Anca Muscholl:
Numerical document queries. PODS 2003: 155-166 - 2002
- [j9]Etienne Grandjean, Thomas Schwentick:
Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time. SIAM J. Comput. 32(1): 196-230 (2002) - [j8]Frank Neven, Thomas Schwentick:
Query automata over finite trees. Theor. Comput. Sci. 275(1-2): 633-674 (2002) - 2001
- [j7]Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer:
The Descriptive Complexity Approach to LOGCFL. J. Comput. Syst. Sci. 62(4): 629-652 (2001) - [c28]Thomas Eiter, Georg Gottlob, Thomas Schwentick:
Second-Order Logic over Strings: Regular and Non-regular Fragments. Developments in Language Theory 2001: 37-56 - [c27]Thomas Schwentick, Denis Thérien, Heribert Vollmer:
Partially-Ordered Two-Way Automata: A New Characterization of DA. Developments in Language Theory 2001: 239-250 - [c26]Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin:
A Model-Theoretic Approach to Regular String Relations. LICS 2001: 431-440 - [c25]Frank Neven, Thomas Schwentick, Victor Vianu:
Towards Regular Languages over Infinite Alphabets. MFCS 2001: 560-572 - [c24]Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin:
String Operations in Query Languages. PODS 2001 - [c23]Frank Neven, Thomas Schwentick:
Automata-and Logic-Based Pattern Languages for Tree-Structured Data. Semantics in Databases 2001: 160-178 - [c22]Martin Grohe, Thomas Schwentick, Luc Segoufin:
When is the evaluation of conjunctive queries tractable? STOC 2001: 657-666 - [i4]Joachim Biskup, Jan Paredaens, Thomas Schwentick, Jan Van den Bussche:
Solving equations in the relational algebra. CoRR cs.LO/0106034 (2001) - 2000
- [j6]Martin Grohe, Thomas Schwentick:
Locality of order-invariant first-order formulas. ACM Trans. Comput. Log. 1(1): 112-130 (2000) - [c21]Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick:
Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. FOCS 2000: 664-674 - [c20]Thomas Schwentick:
Logically defined queries on trees. Grundlagen von Datenbanken 2000: 96-100 - [c19]Frank Neven, Thomas Schwentick:
On the Power of Tree-Walking Automata. ICALP 2000: 547-560 - [c18]Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer:
The Many Faces of a Translation. ICALP 2000: 890-901 - [c17]Thomas Schwentick:
On Diving in Trees. MFCS 2000: 660-669 - [c16]Frank Neven, Thomas Schwentick:
Expressive and Efficient Pattern Languages for Tree-Structured Data. PODS 2000: 145-156
1990 – 1999
- 1999
- [j5]Thomas Schwentick, Klaus Barthelmann:
Local Normal Forms for First-Order Logic with Applications to Games and Automata. Discret. Math. Theor. Comput. Sci. 3(3): 109-124 (1999) - [c15]Frank Neven, Thomas Schwentick:
Automata for Unary Queries on Trees. Grundlagen von Datenbanken 1999: 102-106 - [c14]Frank Neven, Thomas Schwentick:
Query Automata. PODS 1999: 205-214 - [c13]Clemens Lautemann, Nicole Schweikardt, Thomas Schwentick:
A Logical Characterisation of Linear Time on Nondeterministic Turing Machines. STACS 1999: 143-152 - [c12]Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer:
The Descriptive Complexity Approach to LOGCFL. STACS 1999: 444-454 - 1998
- [j4]Clemens Lautemann, Thomas Schwentick, Iain A. Stewart:
Positive Versions of Polynomial Time. Inf. Comput. 147(2): 145-170 (1998) - [j3]Arnaud Durand, Clemens Lautemann, Thomas Schwentick:
Subclasses of Binary NP. J. Log. Comput. 8(2): 189-207 (1998) - [c11]Thomas Schwentick:
Descriptive Complexity, Lower Bounds and Linear Time. CSL 1998: 9-28 - [c10]Martin Grohe, Thomas Schwentick:
Locality of Order-Invariant First-Order Formulas. MFCS 1998: 437-445 - [c9]Thomas Schwentick, Klaus Barthelmann:
Local Normal Forms for First-Order Logic with Applications to Games and Automata. STACS 1998: 444-454 - [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) - 1997
- [c8]Thomas Schwentick:
Padding and the Expressive Power of Existential Second-Order Logics. CSL 1997: 461-477 - [c7]Thomas Schwentick:
Algebraic and Logical Characterizations of Deterministic Linear Time Classes. STACS 1997: 463-474 - 1996
- [j2]Thomas Schwentick:
On Winning Ehrenfeucht Games and Monadic NP. Ann. Pure Appl. Log. 79(1): 61-92 (1996) - [c6]Clemens Lautemann, Thomas Schwentick, Iain A. Stewart:
On Positive P. CCC 1996: 162-170 - [c5]Thomas Schwentick:
On Bijections vs. Unary Functions. STACS 1996: 415-426 - 1995
- [b1]Thomas Schwentick:
On winning Ehrenfeucht games and monadic NP. University of Mainz, Germany, 1995, pp. 1-72 - [j1]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) - [c4]Thomas Schwentick:
Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree. ICALP 1995: 405-416 - 1994
- [c3]Clemens Lautemann, Thomas Schwentick, Denis Thérien:
Logics For Context-Free Languages. CSL 1994: 205-216 - [c2]Thomas Schwentick:
Graph Connectivity and Monadic NP. FOCS 1994: 614-622 - 1993
- [c1]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
- [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)
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-10-07 21:26 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:
