Zum Inhalt
LogiDAC

Publikationen

Gaetano Geck, Jens Keppeler, Thomas Schwentick and Christopher Spinrath.
Rewriting with Acyclic Queries: Mind Your Head.
In Dan Olteanu and Nils Vortmeier (eds.). 25th International Conference on Database Theory, ICDT 2022, March 29 to April 1, 2022, Edinburgh, UK (Virtual Conference) 220. 2022, 8:1–8:20.
DOI

Wouter Gelade and Thomas Schwentick.
Automata and finite model theory.
In Jean-Éric Pin (ed.). Handbook of Automata Theory. European Mathematical Society Publishing House, Zürich, Switzerland, 2021, pages 1071–1103.
DOI

Angela Bonifati, Rasmus Pagh and Thomas Schwentick.
2021 ACM PODS Alberto O. Mendelzon Test-of-Time Award.
In Leonid Libkin, Reinhard Pichler and Paolo Guagliardo (eds.). PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Virtual Event, China, June 20-25, 2021. 2021, 82.
DOI

Jonas Schmidt, Thomas Schwentick, Till Tantau, Nils Vortmeier and Thomas Zeume.
Work-sensitive Dynamic Complexity of Formal Languages.
In Stefan Kiefer and Christine Tasson (eds.). Foundations of Software Science and Computation Structures - 24th International Conference, FOSSACS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021, Proceedings 12650. 2021, 490–509.
DOI

Thomas Schwentick, Nils Vortmeier and Thomas Zeume.
Sketches of Dynamic Complexity.
SIGMOD Rec. 49(2):18–29, 2020.
URL, DOI

Samir Datta, Pankaj Kumar, Anish Mukherjee, Anuj Tawari, Nils Vortmeier and Thomas Zeume.
Dynamic Complexity of Reachability: How Many Changes Can We Handle?.
In Artur Czumaj, Anuj Dawar and Emanuela Merelli (eds.). 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference) 168. 2020, 122:1–122:19.
URL, DOI

Nils Vortmeier and Thomas Zeume.
Dynamic Complexity of Parity Exists Queries.
In Maribel Fernández and Anca Muscholl (eds.). 28th EACSL Annual Conference on Computer Science Logic, CSL 2020, January 13-16, 2020, Barcelona, Spain 152. 2020, 37:1–37:16.
URL, DOI

Gaetano Geck, Frank Neven and Thomas Schwentick.
Distribution Constraints: The Chase for Distributed Data.
In Carsten Lutz and Jean Christoph Jung (eds.). 23rd International Conference on Database Theory, ICDT 2020, March 30-April 2, 2020, Copenhagen, Denmark 155. 2020, 13:1–13:19.
URL, DOI

Jonas Schmidt, Thomas Schwentick, Nils Vortmeier, Thomas Zeume and Ioannis Kokkinis.
Dynamic Complexity Meets Parameterised Algorithms.
In Maribel Fernández and Anca Muscholl (eds.). 28th EACSL Annual Conference on Computer Science Logic, CSL 2020, January 13-16, 2020, Barcelona, Spain 152. 2020, 36:1–36:17.
URL, DOI

Frank Neven, Thomas Schwentick, Christopher Spinrath and Brecht Vandevoort.
Parallel-Correctness and Parallel-Boundedness for Datalog Programs.
In Pablo Barceló and Marco Calautti (eds.). 22nd International Conference on Database Theory, ICDT 2019, March 26-28, 2019, Lisbon, Portugal 127. 2019, 14:1–14:19.
URL, DOI

Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier and Thomas Zeume.
A Strategy for Dynamic Programs: Start over and Muddle through.
Logical Methods in Computer Science 15(2), 2019.
URL

Gaetano Geck, Bas Ketsman, Frank Neven and Thomas Schwentick.
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation.
In 19th International Conference on Database Theory, ICDT 2016, Bordeaux, France, March 15-18, 2016. 2016, 9:1–9:17.
URL, DOI

Gaetano Geck, Artur Ljulin, Jonas Haldimann, Johannes May, Jonas Schmidt, Marko Schmellenkamp, Daniel Sonnabend, Felix Tschirbs, Fabian Vehlken and Thomas Zeume.
Teaching Logic with Iltis: an Interactive, Web-Based System.
In Bruce Scharlau, Roger McDermott, Arnold Pears and Mihaela Sabin (eds.). Proceedings of the 2019 ACM Conference on Innovation and Technology in Computer Science Education, Aberdeen, Scotland, UK, July 15-17, 2019. 2019, 307.
URL, DOI

Christian Coester, Thomas Schwentick and Martin Schuster.
Winning Strategies for Streaming Rewriting Games.
In Leszek Antoni Gasieniec, Jesper Jansson and Christos Levcopoulos (eds.). Fundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings 11651. 2019, 49–63.
URL, DOI

Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick and Thomas Zeume.
Reachability Is in DynFO.
J. ACM 65(5):33:1–33:24, 2018.
URL, DOI

Henrik Björklund, Wim Martens and Thomas Schwentick.
Conjunctive query containment over trees using schema information.
Acta Inf. 55(1):17–56, 2018.
URL, DOI

Samir Datta, Anish Mukherjee, Nils Vortmeier and Thomas Zeume.
Reachability and Distances under Multiple Changes.
In Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx and Donald Sannella (eds.). 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic 107. 2018, 120:1–120:14.
URL, DOI

Matthias Niewerth and Thomas Schwentick.
Reasoning About XML Constraints Based on XML-to-Relational Mappings.
Theory Comput. Syst. 62(8):1826–1879, 2018.
URL, DOI

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 and Ke Yi.
Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151).
Dagstuhl Manifestos 7(1):1–29, 2018.
URL, DOI

Dexter Kozen and Thomas Schwentick.
The Ackermann Award 2018.
In Dan R Ghica and Achim Jung (eds.). 27th EACSL Annual Conference on Computer Science Logic, CSL 2018, September 4-7, 2018, Birmingham, UK 119. 2018, 1:1–1:5.
URL, DOI

Gaetano Geck, Artur Ljulin, Sebastian Peter, Jonas Schmidt, Fabian Vehlken and Thomas Zeume.
Introduction to Iltis: an interactive, web-based system for teaching logic.
In Irene Polycarpou, Janet C Read, Panayiotis Andreou and Michal Armoni (eds.). Proceedings of the 23rd Annual ACM Conference on Innovation and Technology in Computer Science Education, ITiCSE 2018, Larnaca, Cyprus, July 02-04, 2018. 2018, 141–146.
URL, DOI

Thomas Schwentick, Nils Vortmeier and Thomas Zeume.
Dynamic Complexity under Definable Changes.
ACM Trans. Database Syst. 43(3):12:1–12:38, 2018.
URL, DOI

Thomas Schwentick, Nils Vortmeier and Thomas Zeume.
Dynamic Complexity under Definable Changes.
In Michael Benedikt and Giorgio Orsi (eds.). 20th International Conference on Database Theory, ICDT 2017, March 21-24, 2017, Venice, Italy 68. 2017, 19:1–19:18.
URL, DOI

Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier and Thomas Zeume.
A Strategy for Dynamic Programs: Start over and Muddle Through.
In Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn and Anca Muscholl (eds.). 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland 80. 2017, 98:1–98:14.
URL, DOI

Wim Martens, Frank Neven, Matthias Niewerth and 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.
URL, DOI

Thomas Zeume and Thomas Schwentick.
Dynamic conjunctive queries.
J. Comput. Syst. Sci. 88:3–26, 2017.
URL arXiv, DOI

Martin Schuster and Thomas Schwentick.
Games for Active XML Revisited.
Theory Comput. Syst. 61(1):84–155, 2017.
URL arXiv, DOI

Tom J Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven and Thomas Schwentick.
Reasoning on data partitioning for single-round multi-join evaluation in massively parallel systems.
Commun. ACM 60(3):93–100, 2017.
URL, DOI

Christof Löding and Christopher Spinrath.
Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words.
In Ralf Klasing and Marc Zeitoun (eds.). Fundamentals of Computation Theory: 21st International Symposium, FCT 2017, Bordeaux, France, September 11–13, 2017, Proceedings. 2017, 341–354.
DOI

Tom J Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven and Thomas Schwentick.
Data partitioning for single-round multi-join evaluation in massively parallel systems.
SIGMOD Record 45(1):33–40, 2016.
URL, DOI

Thomas Schwentick and Thomas Zeume.
Dynamic complexity: recent updates.
SIGLOG News 3(2):30–52, 2016.
URL

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 and Ke Yi.
Research Directions for Principles of Data Management (Abridged).
SIGMOD Record 45(4):5–17, 2016.
URL, DOI

Pablo Muñoz, Nils Vortmeier and Thomas Zeume.
Dynamic Graph Queries.
In 19th International Conference on Database Theory, ICDT 2016, Bordeaux, France, March 15-18, 2016. 2016, 14:1–14:18.
URL, DOI

Christopher Czyba, Christopher Spinrath and Wolfgang Thomas.
Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change.
In Igor Potapov (ed.). Developments in Language Theory: 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings.. 2015, 203–214.
DOI

Thomas Schwentick, Nils Vortmeier and Thomas Zeume.
Static Analysis for Logic-based Dynamic Programs.
In 24th EACSL Annual Conference on Computer Science Logic, CSL 2015, September 7-10, 2015, Berlin, Germany. 2015, 308–324.
URL, DOI

Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick and Thomas Zeume.
Reachability is in DynFO.
In Magnús M Halldórsson, Kazuo Iwama, Naoki Kobayashi and Bettina Speckmann (eds.). Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II 9135. 2015, 159–170.
URL arXiv, DOI

Martin Schuster and Thomas Schwentick.
Games for Active XML Revisited.
In 18th International Conference on Database Theory, ICDT 2015, March 23-27, 2015, Brussels, Belgium. 2015, 60–75.
URL, DOI

Thomas Zeume and Thomas Schwentick.
On the quantifier-free dynamic complexity of Reachability.
Inf. Comput. 240:108–129, 2015.
URL arXiv, DOI

Tom J Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven and Thomas Schwentick.
Parallel-Correctness and Transferability for Conjunctive Queries.
In Proceedings of the 34th ACM Symposium on Principles of Database Systems, PODS 2015, Melbourne, Victoria, Australia, May 31 - June 4, 2015. 2015, 47–58.
URL, DOI

Wim Martens, Frank Neven, Matthias Niewerth and Thomas Schwentick.
BonXai: Combining the simplicity of DTD with the expressiveness of XML Schema.
In Proceedings of the 34th ACM Symposium on Principles of Database Systems, PODS 2015, Melbourne, Victoria, Australia, May 31 - June 4, 2015. 2015, 145–156.
URL, DOI

Georg Gottlob, Stanislav Kikot, Roman Kontchakov, Vladimir V Podolskii, Thomas Schwentick and Michael Zakharyaschev.
The price of query rewriting in ontology-based data access.
Artif. Intell. 213:42–59, 2014.
URL, DOI

Thomas Zeume.
The Dynamic Descriptive Complexity of k-Clique.
In Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I. 2014, 547–558.
URL, DOI

Thomas Zeume and Thomas Schwentick.
Dynamic Conjunctive Queries.
In Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24-28, 2014.. 2014, 38–49.
URL PDF, DOI

Matthias Niewerth and Thomas Schwentick.
Reasoning about XML Constraints based on XML-to-relational mappings.
In Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24-28, 2014.. 2014, 72–83.
URL PDF, DOI

Henrik Björklund, Martin Schuster, Thomas Schwentick and Joscha Kulbatzki.
On optimum left-to-right strategies for active context-free games.
In Joint 2013 EDBT/ICDT Conferences, ICDT '13 Proceedings, Genoa, Italy, March 18-22, 2013. 2013, 105–116.
URL PDF, DOI

Thomas Schwentick.
The Dynamic Complexity of the Reachability Problem on Graphs.
In Reachability Problems - 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013 Proceedings. 2013, 45.
URL, DOI

Benedikt Bollig, Aiswarya Cyriac, Lo{\"ı}c Hélouët, Ahmet Kara and Thomas Schwentick.
Dynamic Communicating Automata and Branching High-Level MSCs.
In Language and Automata Theory and Applications - 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings. 2013, 177–189.
URL PDF, DOI

Henrik Björklund, Wim Martens and Thomas Schwentick.
Validity of Tree Pattern Queries with Respect to Schema Information.
In Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings. 2013, 171–182.
URL PDF, DOI

Thomas Zeume and Thomas Schwentick.
On the Quantifier-Free Dynamic Complexity of Reachability.
In Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings. 2013, 837–848.
URL PDF, DOI

Thomas Schwentick.
Perspectives of Dynamic Complexity.
In Logic, Language, Information, and Computation - 20th International Workshop, WoLLIC 2013, Darmstadt, Germany, August 20-23, 2013. Proceedings. 2013, 33.
URL, DOI

Thomas Schwentick.
Perspectives of Dynamic Complexity.
In Logic, Language, Information, and Computation - 20th International Workshop, WoLLIC 2013, Darmstadt, Germany, August 20-23, 2013. Proceedings. 2013, 33.
URL, DOI

Thomas Zeume and Thomas Schwentick.
On the quantifier-free dynamic complexity of Reachability.
CoRR abs/1306.3056, 2013.
URL

Amaldev Manuel, Thomas Schwentick and Thomas Zeume.
A Short Note on Two-Variable Logic with a Linear Order Successor and a Preorder Successor.
CoRR abs/1306.3418, 2013.
URL

Amaldev Manuel and Thomas Zeume.
Two-Variable Logic on 2-Dimensional Structures.
In Computer Science Logic 2013 (CSL 2013), CSL 2013, September 2-5, 2013, Torino, Italy. 2013, 484–499.
URL, DOI

Christoph Dürr and Thomas Schwentick.
Preface of Special Issue on Theoretical Aspects of Computer Science.
Theory Comput. Syst. 53(2):123–125, 2013.
URL, DOI

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

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

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

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

Thomas Schwentick.
Foundations of XML Based on Logic and Automata: A Snapshot.
In Foundations of Information and Knowledge Systems - 7th International Symposium, FoIKS 2012, Kiel, Germany, March 5-9, 2012. Proceedings. 2012, 23–33.
URL, DOI

Georg Gottlob and Thomas Schwentick.
Rewriting Ontological Queries into Small Nonrecursive Datalog Programs.
In Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, KR 2012, Rome, Italy, June 10-14, 2012. 2012.
URL

Ahmet Kara, Thomas Schwentick and Tony Tan.
Feasible Automata for Two-Variable Logic with Successor on Data Words.
In Language and Automata Theory and Applications - 6th International Conference, LATA 2012, A Coruña, Spain, March 5-9, 2012. Proceedings. 2012, 351–362.
URL, DOI

 

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

Ahmet Kara and Thomas Schwentick.
Expressiveness of Hybrid Temporal Logic on Data Words.
Electr. Notes Theor. Comput. Sci. 278:115–128, 2011.
URL, DOI

Thomas Schwentick and Christoph Dürr.
Frontmatter, Table of Contents, Preface, Conference Organization.
In 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany. 2011.
URL, DOI

Maurizio Lenzerini and 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.
URL

Thomas Schwentick and Christoph Dürr (eds.).
28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany
9. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011.

Georg Gottlob and Thomas Schwentick.
Rewriting Ontological Queries into Small Nonrecursive Datalog Programs.
CoRR abs/1106.3767, 2011.
URL

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

Matthias Niewerth and Thomas Schwentick.
Two-variable logic and key constraints on data words.
In Database Theory - ICDT 2011, 14th International Conference, Uppsala, Sweden, March 21-24, 2011, Proceedings. 2011, 138–149.
URL, DOI

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

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

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

Ahmet Kara, Thomas Schwentick and Thomas Zeume.
Temporal Logics on Words with Multiple Data Values.
In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India. 2010, 481–492.
URL, DOI

Wim Martens, Matthias Niewerth and Thomas Schwentick.
Schema design for XML repositories: complexity and tractability.
In Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2010, June 6-11, 2010, Indianapolis, Indiana, USA. 2010, 239–250.
URL, DOI

Jean-Yves Marion and Thomas Schwentick.
Foreword – 27th International Symposium on Theoretical Aspects of Computer Science.
In 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France. 2010, 1–6.
URL, DOI

Jean-Yves Marion and Thomas Schwentick.
Table of Contents - 27th International Symposium on Theoretical Aspects of Computer Science.
In 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France. 2010, 7–10.
URL, DOI

Jean-Yves Marion and Thomas Schwentick (eds.).
27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France
5. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2010.

Thomas Eiter, Georg Gottlob and Thomas Schwentick.
The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey.
In Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday. 2010, 227–250.
URL, DOI

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

Thomas Schwentick and Thomas Zeume.
Two-Variable Logic with Two Order Relations - (Extended Abstract).
In Computer Science Logic, 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010. Proceedings. 2010, 499–513.
URL, DOI

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

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

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

Thomas Schwentick and Dan Suciu.
Foreword.
Theory Comput. Syst. 44(4):501–502, 2009.
URL, DOI

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

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

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

Wouter Gelade, Marcel Marquardt and Thomas Schwentick.
The Dynamic Complexity of Formal Languages.
In 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings. 2009, 481–492.
URL, DOI

Georg Gottlob, Gianluigi Greco, Zoltán Miklós, Francesco Scarcello and Thomas Schwentick.
Tree Projections: Game Characterization and Computational Aspects.
In Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday. 2009, 217–226.
URL, DOI

Anca Muscholl, Ramaswamy Ramanujam, Michaël Rusinowitch, Thomas Schwentick and Victor Vianu (eds.).
Beyond the Finite: New Challenges in Verification and Semistructured Data, 20.04. - 25.04.2008
08171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2008.
URL

Henrik Björklund, Wim Martens and Thomas Schwentick.
Optimizing Conjunctive Queries over Trees Using Schema Information.
In Edward Ochmanski and Jerzy Tyszkiewicz (eds.). Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings 5162. 2008, 132–143.
URL, DOI

Thomas Schwentick.
A Little Bit Infinite? On Adding Data to Finitely Labelled Structures (Abstract).
In Susanne Albers and Pascal Weil (eds.). STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings 1. 2008, 17–18.
URL, DOI

Wim Martens, Frank Neven and Thomas Schwentick.
Deterministic top-down tree automata: past, present, and future.
In Jörg Flum, Erich Grädel and Thomas Wilke (eds.). Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]. 2. 2008, 505–530.

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

Henrik Björklund, Wim Martens and Thomas Schwentick.
Conjunctive Query Containment over Trees.
In Marcelo Arenas and Michael I Schwartzbach (eds.). Database Programming Languages, 11th International Symposium, DBPL 2007, Vienna, Austria, September 23-24, 2007, Revised Selected Papers 4797. 2007, 66–80.
URL, DOI

Henrik Björklund and Thomas Schwentick.
On Notions of Regularity for Data Languages.
In Erzsébet Csuhaj-Varjú and Zoltán Ésik (eds.). Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings 4639. 2007, 88–99.
URL, DOI

Georg Gottlob, Zoltán Miklós and Thomas Schwentick.
Generalized hypertree decompositions: np-hardness and tractable variants.
In Leonid Libkin (ed.). Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 11-13, 2007, Beijing, China. 2007, 13–22.
URL, DOI

Gjergji Kasneci and Thomas Schwentick.
The complexity of reasoning about pattern-based XML schemas.
In Leonid Libkin (ed.). Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 11-13, 2007, Beijing, China. 2007, 155–164.
URL, DOI

Thomas Schwentick and Volker Weber.
Bounded-Variable Fragments of Hybrid Logics.
In Wolfgang Thomas and Pascal Weil (eds.). STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings 4393. 2007, 561–572.
URL, DOI

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

Thomas Schwentick and Dan Suciu (eds.).
Database Theory - ICDT 2007, 11th International Conference, Barcelona, Spain, January 10-12, 2007, Proceedings
4353. Springer, 2007.
URL, DOI

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

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

Geert Jan Bex, Frank Neven, Thomas Schwentick and Karl Tuyls.
Inference of Concise DTDs from XML Data.
In Umeshwar Dayal, Kyu-Young Whang, David B Lomet, Gustavo Alonso, Guy M Lohman, Martin L Kersten, Sang Kyun Cha and Young-Kuk Kim (eds.). Proceedings of the 32nd International Conference on Very Large Data Bases, Seoul, Korea, September 12-15, 2006. 2006, 115–126.
URL

Mikolaj Boja 'n, Mathias Samuelides, Thomas Schwentick and Luc Segoufin.
Expressive Power of Pebble Automata.
In Michele Bugliesi, Bart Preneel, Vladimiro Sassone and Ingo Wegener (eds.). Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I 4051. 2006, 157–168.
URL, DOI

Mikolaj Boja 'n, Anca Muscholl, Thomas Schwentick, Luc Segoufin and Claire David.
Two-Variable Logic on Words with Data.
In 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12-15 August 2006, Seattle, WA, USA, Proceedings. 2006, 7–16.
URL, DOI

Mikolaj Boja 'n, Claire David, Anca Muscholl, Thomas Schwentick and Luc Segoufin.
Two-variable logic on data trees and XML reasoning.
In Stijn Vansummeren (ed.). Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois, USA. 2006, 10–19.
URL, DOI

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

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

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

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

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

Geert Jan Bex, Wim Martens, Frank Neven and Thomas Schwentick.
Expressiveness of XSDs: from practice to theory, there and back again.
In Allan Ellis and Tatsuya Hagino (eds.). Proceedings of the 14th international conference on World Wide Web, WWW 2005, Chiba, Japan, May 10-14, 2005. 2005, 712–721.
URL, DOI

Frank Neven, Thomas Schwentick and Dan Suciu (eds.).
Foundations of Semistructured Data, 6.-11. February 2005
05061. IBFI, Schloss Dagstuhl, Germany, 2005.
URL

Kumar Neeraj Verma, Helmut Seidl and Thomas Schwentick.
On the Complexity of Equational Horn Clauses.
In Robert Nieuwenhuis (ed.). Automated Deduction - CADE-20, 20th International Conference on Automated Deduction, Tallinn, Estonia, July 22-27, 2005, Proceedings 3632. 2005, 337–352.
URL, DOI

Wim Martens, Frank Neven and Thomas Schwentick.
Which XML Schemas Admit 1-Pass Preorder Typing?.
In Thomas Eiter and Leonid Libkin (eds.). Database Theory - ICDT 2005, 10th International Conference, Edinburgh, UK, January 5-7, 2005, Proceedings 3363. 2005, 68–82.
URL, DOI

Anfahrt & Lageplan

Der Campus der Technischen Universität Dortmund liegt in der Nähe des Autobahnkreuzes Dortmund West, wo die Sauerlandlinie A45 den Ruhrschnellweg B1/A40 kreuzt. Die Abfahrt Dortmund-Eichlinghofen auf der A45 führt zum Campus Süd, die Abfahrt Dortmund-Dorstfeld auf der A40 zum Campus-Nord. An beiden Ausfahrten ist die Universität ausgeschildert.

Direkt auf dem Campus Nord befindet sich die S-Bahn-Station „Dortmund Universität“. Von dort fährt die S-Bahn-Linie S1 im 15- oder 30-Minuten-Takt zum Hauptbahnhof Dortmund und in der Gegenrichtung zum Hauptbahnhof Düsseldorf über Bochum, Essen und Duisburg. Außerdem ist die Universität mit den Buslinien 445, 447 und 462 zu erreichen. Eine Fahrplanauskunft findet sich auf der Homepage des Verkehrsverbundes Rhein-Ruhr, außerdem bieten die DSW21 einen interaktiven Liniennetzplan an.
 

Zu den Wahrzeichen der TU Dortmund gehört die H-Bahn. Linie 1 verkehrt im 10-Minuten-Takt zwischen Dortmund Eichlinghofen und dem Technologiezentrum über Campus Süd und Dortmund Universität S, Linie 2 pendelt im 5-Minuten-Takt zwischen Campus Nord und Campus Süd. Diese Strecke legt sie in zwei Minuten zurück.

Vom Flughafen Dortmund aus gelangt man mit dem AirportExpress innerhalb von gut 20 Minuten zum Dortmunder Hauptbahnhof und von dort mit der S-Bahn zur Universität. Ein größeres Angebot an internationalen Flugverbindungen bietet der etwa 60 Kilometer entfernte Flughafen Düsseldorf, der direkt mit der S-Bahn vom Bahnhof der Universität zu erreichen ist.