Thomas Schwentick

TU Dortmund University — Germany

Computer Science · Physical Sciences

37h-index4.6kcitations210works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

semigroups and automata theory(79), Advanced Database Systems and Queries(67), Logic, programming, and type systems(50), Logic, Reasoning, and Knowledge(35), Formal Methods in Verification(34)

Publications210 total

Rewriting with Acyclic Queries: Mind Your Head
Logical Methods in Computer Science·2023· 1 citedOpen Access
Work-Efficient Query Evaluation with PRAMs
arXiv (Cornell University)·2023Open Access
On the Work of Dynamic Constant-Time Parallel Algorithms for Regular Tree Languages and Context-Free Languages
arXiv (Cornell University)·2023Open Access
Dynamic Constant Time Parallel Graph Algorithms with Sub-Linear Work
arXiv (Cornell University)·2023Open Access
Rewriting with Acyclic Queries: Mind Your Head
arXiv (Cornell University)·2022· 1 citedOpen Access
Low-Latency Sliding Window Algorithms for Formal Languages
arXiv (Cornell University)·2022Open Access
Low-Latency Sliding Window Algorithms for Formal Languages
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2022Open Access
Automata and finite model theory
EMS Press eBooks·2021
Automata and finite model theory
2021
2021 ACM PODS Alberto O. Mendelzon Test-of-Time Award
2021Open Access
Dynamic Complexity of Regular Languages: Big Changes, Small Work
arXiv (Cornell University)·2021Open Access
Work-sensitive Dynamic Complexity of Formal Languages
Lecture notes in computer science·2021Open Access
Sketches of Dynamic Complexity
ACM SIGMOD Record·2020· 6 cited
Distribution Constraints: The Chase for Distributed Data
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2020Open Access
Dynamic Complexity Meets Parameterised Algorithms
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2020· 4 citedOpen Access
Dynamic Complexity Meets Parameterised Algorithms
arXiv (Cornell University)·2019· 1 citedOpen Access
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation
ACM Transactions on Computational Logic·2019· 8 citedOpen Access
A Strategy for Dynamic Programs: Start over and Muddle through
Logical Methods in Computer Science·2019· 2 citedOpen Access
A Strategy for Dynamic Programs: Start over and Muddle through
SHILAP Revista de lepidopterología·2019· 6 citedOpen Access
Winning Strategies for Streaming Rewriting Games
Lecture notes in computer science·2019
page 1 of 11Next →

Frequent Co-authors

Frank Neven(15), Wim Martens(8), Anca Muscholl(7), Luc Segoufin(7), Mikołaj Bojańczyk(4), Geert Jan Bex(4), Georg Gottlob(4), Helmut Seidl(4), Henrik Björklund(3), Victor Vianu(2), Claire David(2), Martin Grohe(2), Clemens Lautemann(2), Heribert Vollmer(2), Denis Thérien(2), Thomas Zeume(2), Karl Tuyls(1), Zoltán Miklós(1), Stijn Vansummeren(1), Ulrich Hertrampf(1)