Thomas Schwentick

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat Rewriting with Acyclic Queries: Mind Your Head 2023 Gaetano Geck
Jens Keppeler
Thomas Schwentick
Christopher Spinrath
+ Work-Efficient Query Evaluation with PRAMs 2023 Jens Keppeler
Thomas Schwentick
Christopher Spinrath
+ Dynamic constant time parallel graph algorithms with sub-linear work 2023 Jonas Schmidt
Thomas Schwentick
+ On the work of dynamic constant-time parallel algorithms for regular tree languages and context-free languages 2023 Jonas Schmidt
Thomas Schwentick
Jennifer Todtenhoefer
+ Rewriting with Acyclic Queries: Mind Your Head 2022 Gaetano Geck
Jens Keppeler
Thomas Schwentick
Christopher Spinrath
+ Low-Latency Sliding Window Algorithms for Formal Languages 2022 Moses Ganardi
Louis Jachiet
Markus Lohrey
Thomas Schwentick
+ Work-sensitive Dynamic Complexity of Formal Languages 2021 Jonas Schmidt
Thomas Schwentick
Till Tantau
Nils Vortmeier
Thomas Zeume
+ Distribution Constraints: The Chase for Distributed Data 2020 Gaetano Geck
Frank Neven
Thomas Schwentick
+ Dynamic Complexity Meets Parameterised Algorithms 2020 Jonas Schmidt
Thomas Schwentick
Nils Vortmeier
Thomas Zeume
Ioannis Kokkinis
+ Distribution Constraints: The Chase for Distributed Data 2020 Gaetano Geck
Frank Neven
Thomas Schwentick
+ PDF Chat Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation 2019 Gaetano Geck
Bas Ketsman
Frank Neven
Thomas Schwentick
+ Dynamic Complexity Meets Parameterised Algorithms 2019 Jonas Schmidt
Thomas Schwentick
Nils Vortmeier
Thomas Zeume
Ioannis Kokkinis
+ PDF Chat Dynamic Complexity under Definable Changes 2018 Thomas Schwentick
Nils Vortmeier
Thomas Zeume
+ Streaming Rewriting Games: Winning Strategies and Complexity 2018 Christian Coester
Thomas Schwentick
Martín Schuster
+ PDF Chat Parallel-Correctness and Transferability for Conjunctive Queries 2017 Tom J. Ameloot
Gaetano Geck
Bas Ketsman
Frank Neven
Thomas Schwentick
+ Dynamic conjunctive queries 2017 Thomas Zeume
Thomas Schwentick
+ Dynamic Conjunctive Queries 2017 Thomas Zeume
Thomas Schwentick
+ Dynamic Complexity under Definable Changes 2017 Thomas Schwentick
Nils Vortmeier
Thomas Zeume
+ A Strategy for Dynamic Programs: Start over and Muddle through 2017 Samir Datta
Anish Mukherjee
Thomas Schwentick
Nils Vortmeier
Thomas Zeume
+ Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151) 2017 Serge Abiteboul
Marcelo Arenas
Pablo Barceló
Meghyn Bienvenu
Diego Calvanese
Claire David
Richard Hull
Eyke Hüllermeier
Benny Kimelfeld
Leonid Libkin
+ Dynamic Conjunctive Queries 2017 Thomas Zeume
Thomas Schwentick
+ Dynamic Complexity under Definable Changes 2017 Thomas Schwentick
Nils Vortmeier
Thomas Zeume
+ PDF Chat Games for Active XML Revisited 2016 Martín Schuster
Thomas Schwentick
+ Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation 2015 Gaetano Geck
Bas Ketsman
Frank Neven
Thomas Schwentick
+ Static Analysis for Logic-Based Dynamic Programs 2015 Thomas Schwentick
Nils Vortmeier
Thomas Zeume
+ PDF Chat Parallel-Correctness and Transferability for Conjunctive Queries 2015 Tom J. Ameloot
Gaetano Geck
Bas Ketsman
Frank Neven
Thomas Schwentick
+ Reachability is in DynFO 2015 Samir Datta
Raghav Kulkarni
Anish Mukherjee
Thomas Schwentick
Thomas Zeume
+ Static Analysis for Logic-Based Dynamic Programs 2015 Thomas Schwentick
Nils Vortmeier
Thomas Zeume
+ Reachability is in DynFO 2015 Samir Datta
Raghav Kulkarni
Anish Mukherjee
Thomas Schwentick
Thomas Zeume
+ Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation 2015 Gaetano Geck
Bas Ketsman
Frank Neven
Thomas Schwentick
+ Games for Active XML Revisited 2014 Martín Schuster
Thomas Schwentick
+ Parallel-Correctness and Transferability for Conjunctive Queries 2014 Tom J. Ameloot
Gaetano Geck
Bas Ketsman
Frank Neven
Thomas Schwentick
+ On the quantifier-free dynamic complexity of Reachability 2014 Thomas Zeume
Thomas Schwentick
+ Parallel-Correctness and Transferability for Conjunctive Queries 2014 Tom J. Ameloot
Gaetano Geck
Bas Ketsman
Frank Neven
Thomas Schwentick
+ Games for Active XML Revisited 2014 Martin Schuster
Thomas Schwentick
+ PDF Chat On optimum left-to-right strategies for active context-free games 2013 Johanna Björklund
Martín Schuster
Thomas Schwentick
Joscha Kulbatzki
+ A Short Note on Two-Variable Logic with a Linear Order Successor and a Preorder Successor 2013 Amaldev Manuel
Thomas Schwentick
Thomas Zeume
+ PDF Chat On the Quantifier-Free Dynamic Complexity of Reachability 2013 Thomas Zeume
Thomas Schwentick
+ Perspectives of Dynamic Complexity 2013 Thomas Schwentick
+ On optimum left-to-right strategies for active context-free games 2012 Henrik Björklund
Martín Schuster
Thomas Schwentick
Joscha Kulbatzki
+ PDF Chat The dynamic complexity of formal languages 2012 Wouter Gelade
Marcel Marquardt
Thomas Schwentick
+ PDF Chat Two-Variable Logic with Two Order Relations 2012 Thomas Schwentick
Thomas Zeume
+ PDF Chat Feasible Automata for Two-Variable Logic with Successor on Data Words 2012 Ahmet Kara
Thomas Schwentick
Tony Tan
+ On optimum left-to-right strategies for active context-free games 2012 Henrik Björklund
Martin Schuster
Thomas Schwentick
Joscha Kulbatzki
+ PDF Chat A note on the expressive power of linear orders 2011 Thomas Schwentick
Nicole Schweikardt
+ Rewriting Ontological Queries into Small Nonrecursive Datalog Programs 2011 Georg Gottlob
Thomas Schwentick
+ Feasible Automata for Two-Variable Logic with Successor on Data Words 2011 Ahmet Kara
Thomas Schwentick
Tony Tan
+ Rewriting Ontological Queries into Small Nonrecursive Datalog Programs 2011 Georg Gottlob
Thomas Schwentick
+ PDF Chat Two-Variable Logic with Two Order Relations 2010 Thomas Schwentick
Thomas Zeume
+ Temporal Logics on Words with Multiple Data Values 2010 Ahmet Kara
Thomas Schwentick
Thomas Zeume
+ PDF Chat On the Hybrid Extension of CTL and CTL + 2009 Ahmet Kara
Volker Weber
Martin Lange
Thomas Schwentick
+ Dynamic Complexity of Formal Languages 2008 Wouter Gelade
Marcel Marquardt
Thomas Schwentick
+ Complexity of Hybrid Logics over Transitive Frames 2008 Martin Mundhenk
Thomas Schneider
Thomas Schwentick
Volker Weber
+ J. Flum and M. Grohe. Parameterized complexity theory. Texts in Theoretical Computer Science. Springer, Berlin, 2006, xiii + 493 pp. 2007 Thomas Schwentick
+ PDF Chat On the complexity of XPath containment in the presence of disjunction, DTDs, and variables 2006 Frank Neven
Thomas Schwentick
+ PDF Chat Solving Equations in the Relational Algebra 2004 Joachim Biskup
Jan Paredaens
Thomas Schwentick
Jan Van den Bussche
+ Solving equations in the relational algebra 2001 Joachim Biskup
Jan Paredaens
Thomas Schwentick
Jan Van den Bussche
+ The descriptive complexity approach to LOGCFL 1998 Clemens Lautemann
Pierre McKenzie
Thomas Schwentick
Heribert Vollmer
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ PDF Chat The dynamic complexity of formal languages 2012 Wouter Gelade
Marcel Marquardt
Thomas Schwentick
10
+ PDF Chat Win-move is coordination-free (sometimes) 2012 Daniel Zinn
Todd J. Green
Bertram Ludäscher
4
+ PDF Chat Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture 2015 Monika Henzinger
Sebastian Krinninger
Danupon Nanongkai
Thatchaphol Saranurak
3
+ PDF Chat Communication steps for parallel query processing 2013 Paul Beame
Paraschos Koutris
Dan Suciu
3
+ PDF Chat On optimum left-to-right strategies for active context-free games 2013 Johanna Björklund
Martín Schuster
Thomas Schwentick
Joscha Kulbatzki
3
+ PDF Chat Skew in parallel query processing 2014 Paul Beame
Paraschos Koutris
Dan Suciu
3
+ Communication Steps for Parallel Query Processing 2013 Paul Beame
Paraschos Koutris
Dan Suciu
3
+ Ramsey theory (2nd ed.) 1990 Ronald Graham
Bruce Rothschild
2
+ PDF Chat An Automaton over Data Words That Captures EMSO Logic 2011 Benedikt Bollig
2
+ PDF Chat Safety alternating automata on data words 2011 Ranko Lazić
2
+ PDF Chat Aggregation and ordering in factorised databases 2013 Nurzhan Bakibayev
Tomáš Kočiský
Dan Olteanu
Jakub Závodný
2
+ PDF Chat Parallel-Correctness and Transferability for Conjunctive Queries 2015 Tom J. Ameloot
Gaetano Geck
Bas Ketsman
Frank Neven
Thomas Schwentick
2
+ On the quantifier-free dynamic complexity of Reachability 2014 Thomas Zeume
Thomas Schwentick
2
+ PDF Chat Multiply-Recursive Upper Bounds with Higman’s Lemma 2011 Sylvain Schmitz
Ph. Schnoebelen
2
+ PDF Chat The dichotomy of conjunctive queries on probabilistic structures 2007 Nilesh Dalvi
Dan Suciu
2
+ PDF Chat Answering Conjunctive Queries under Updates 2017 Christoph Berkholz
Jens Keppeler
Nicole Schweikardt
2
+ Reachability is in DynFO 2015 Samir Datta
Raghav Kulkarni
Anish Mukherjee
Thomas Schwentick
Thomas Zeume
2
+ PDF Chat DBToaster: higher-order delta processing for dynamic, frequently fresh views 2014 Christoph Koch
Yanif Ahmad
Oliver Kennedy
Miloš Nikolić
Andres Nötzli
Daniel Lupei
Amir Shaikhha
2
+ PDF Chat Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries 2020 Ahmet Kara
Miloš Nikolić
Dan Olteanu
Haozhe Zhang
2
+ Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems 2020 Hubie Chen
Georg Gottlob
Matthias Lanzinger
Reinhard Pichler
2
+ PLANAR BRANCHED COVERINGS OF GRAPHS 1991 Shigeru Kitakubo
1
+ On Graphs Whose Full Automorphism Group is an Alternative Group or a Finite Classical Group 1983 Martin W. Liebeck
1
+ The Classical Decision Problem 1997 Egon Börger
Erich Grädel
Yuri Gurevich
1
+ Finite Permutation Groups. 1966 Franklin Haimo
Helmut Wielandt
1
+ PDF Chat The Monadic Theory of Order 1975 Saharon Shelah
1
+ PDF Chat gMark: Schema-Driven Generation of Graphs and Queries 2016 Guillaume Bagan
Angela Bonifati
Radu Ciucanu
George Fletcher
Aurélien Lemay
Nicky Advokaat
1
+ Logical Number Theory I 1991 C. Smoryński
1
+ PDF Chat The Dynamic Descriptive Complexity of k-Clique 2014 Thomas Zeume
1
+ On finite monoids having only trivial subgroups 1965 M. P. Schützenberger
1
+ Elementary Properties of the Finite Ranks 1998 Anuj Dawar
Kees Doets
Steven Lindell
Scott Weinstein
1
+ PDF Chat Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions 2011 Andreas Krebs
Nutan Limaye
Srikanth Srinivasan
1
+ PDF Chat The DL-Lite Family and Relations 2009 Alessandro Artale
Diego Calvanese
Roman Kontchakov
Michael Zakharyaschev
1
+ Streaming algorithms for language recognition problems 2013 Ajesh Babu
Nutan Limaye
Jaikumar Radhakrishnan
Girish Varma
1
+ Space complexity of perfect matching in bounded genus bipartite graphs 2011 Samir Datta
Raghav Kulkarni
Raghunath Tewari
N. V. Vinodchandran
1
+ PDF Chat A Decidable Extension of Data Automata 2011 Zhilin Wu
1
+ PDF Chat Size Bounds and Query Plans for Relational Joins 2013 Albert Atserias
Martin Grohe
Dániel Marx
1
+ PDF Chat On the Hybrid Extension of CTL and CTL + 2009 Ahmet Kara
Volker Weber
Martin Lange
Thomas Schwentick
1
+ Worst-Case Optimal Algorithms for Parallel Query Processing 2016 Paul Beame
Paraschos Koutris
Dan Suciu
1
+ PDF Chat Decidability Issues for Petri Nets -- a survey 2024 Javier Esparza
Mogens Nielsen
1
+ PDF Chat Where First-Order and Monadic Second-Order Logic Coincide 2016 Michael Elberfeld
Martin Grohe
Till Tantau
1
+ PDF Chat On the Quantifier-Free Dynamic Complexity of Reachability 2013 Thomas Zeume
Thomas Schwentick
1
+ PDF Chat Dynamic Complexity under Definable Changes 2018 Thomas Schwentick
Nils Vortmeier
Thomas Zeume
1
+ Querying languages over sliding windows. 2017 Moses Ganardi
Danny Hucke
Markus Lohrey
1
+ complexity, logic, and recursion theory 2019 Andrea Sorbi
1
+ A Strategy for Dynamic Programs: Start over and Muddle through 2017 Samir Datta
Anish Mukherjee
Thomas Schwentick
Nils Vortmeier
Thomas Zeume
1
+ PDF Chat The dynamic descriptive complexity of k -clique 2017 Thomas Zeume
1
+ PDF Chat Two-Variable Logic with Two Order Relations 2012 Thomas Schwentick
Thomas Zeume
1
+ PDF Chat Parallel-Correctness and Transferability for Conjunctive Queries 2017 Tom J. Ameloot
Gaetano Geck
Bas Ketsman
Frank Neven
Thomas Schwentick
1
+ Ramsey Theory 1990 Ronald Graham
1
+ Reachability and Distances under Multiple Changes 2018 Samir Datta
Anish Mukherjee
Nils Vortmeier
Thomas Zeume
1