Thomas Zeume

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 58

Top Venues

Technical University Dortmund, Germany (PHD)

Education History

Technical University Dortmund, Germany

PHD

Publications

Tristan Kneisel, Elias Radtke, Marko Schmellenkamp, Fabian Vehlken, Thomas Zeume
Tool-Assisted Learning of Computational Reductions. CoRR (2024)
Samir Datta, Asif Khan, Anish Mukherjee, Felix Tschirbs, Nils Vortmeier, Thomas Zeume
Query maintenance under batch changes with small-depth circuits. CoRR (2024)
Marko Schmellenkamp, Thomas Zeume, Sven Argo, Sandra Kiefer, Cedric Siems, Fynn Stebel
Detecting and explaining (in)equivalence of context-free grammars. CoRR (2024)
Samir Datta, Asif Khan, Anish Mukherjee, Felix Tschirbs, Nils Vortmeier, Thomas Zeume
Query Maintenance Under Batch Changes with Small-Depth Circuits. MFCS (2024)
Julien Grange, Fabian Vehlken, Nils Vortmeier, Thomas Zeume
Specification and Automatic Verification of Computational Reductions. CoRR (2024)
Julien Grange, Fabian Vehlken, Nils Vortmeier, Thomas Zeume
Specification and Automatic Verification of Computational Reductions. MFCS (2024)
Felix Tschirbs, Nils Vortmeier, Thomas Zeume
Dynamic Complexity of Regular Languages: Big Changes, Small Work. CSL (2023)
Marko Schmellenkamp, Alexandra Latys, Thomas Zeume
Discovering and Quantifying Misconceptions in Formal Methods Using Intelligent Tutoring Systems. SIGCSE (1) (2023)
Corentin Barloy, Michaël Cadilhac, Charles Paperman, Thomas Zeume
The Regular Languages of First-Order Logic with One Alternation. LICS (2022)
Szymon Torunczyk, Thomas Zeume
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic. Log. Methods Comput. Sci. 18 (1) (2022)
Corentin Barloy, Michaël Cadilhac, Charles Paperman, Thomas Zeume
The Regular Languages of First-Order Logic with One Alternation. CoRR (2022)
Szymon Torunczyk, Thomas Zeume
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic. CoRR (2021)
Gaetano Geck, Christine Quenkert, Marko Schmellenkamp, Jonas Schmidt, Felix Tschirbs, Fabian Vehlken, Thomas Zeume
Iltis: Teaching Logic in the Web. CoRR (2021)
Jonas Schmidt, Thomas Schwentick, Till Tantau, Nils Vortmeier, Thomas Zeume
Work-sensitive Dynamic Complexity of Formal Languages. CoRR (2021)
Nils Vortmeier, Thomas Zeume
Dynamic Complexity of Parity Exists Queries. Log. Methods Comput. Sci. 17 (4) (2021)
Jonas Schmidt, Thomas Schwentick, Till Tantau, Nils Vortmeier, Thomas Zeume
Work-sensitive Dynamic Complexity of Formal Languages. FoSSaCS (2021)
Thomas Schwentick, Nils Vortmeier, Thomas Zeume
Sketches of Dynamic Complexity. SIGMOD Rec. 49 (2) (2020)
Nils Vortmeier, Thomas Zeume
Dynamic Complexity of Parity Exists Queries. CSL (2020)
Samir Datta, Pankaj Kumar, Anish Mukherjee, Anuj Tawari, Nils Vortmeier, Thomas Zeume
Dynamic complexity of Reachability: How many changes can we handle? CoRR (2020)
Jonas Schmidt, Thomas Schwentick, Nils Vortmeier, Thomas Zeume, Ioannis Kokkinis
Dynamic Complexity Meets Parameterised Algorithms. CSL (2020)
Samir Datta, Pankaj Kumar, Anish Mukherjee, Anuj Tawari, Nils Vortmeier, Thomas Zeume
Dynamic Complexity of Reachability: How Many Changes Can We Handle? ICALP (2020)
Jean Christoph Jung, Carsten Lutz, Thomas Zeume
On the Decidability of Expressive Description Logics with Transitive Closure and Regular Role Expressions. KR (2020)
Pablo Barceló, Miguel Romero, Thomas Zeume
A More General Theory of Static Approximations for Conjunctive Queries. Theory Comput. Syst. 64 (5) (2020)
Szymon Torunczyk, Thomas Zeume
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic. LICS (2020)
Jonas Schmidt, Thomas Schwentick, Nils Vortmeier, Thomas Zeume, Ioannis Kokkinis
Dynamic Complexity Meets Parameterised Algorithms. CoRR (2019)
Pablo Barceló, Miguel Romero, Thomas Zeume
A More General Theory of Static Approximations for Conjunctive Queries. CoRR (2019)
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)
Gaetano Geck, Artur Ljulin, Jonas Haldimann, Johannes May, Jonas Schmidt, Marko Schmellenkamp, Daniel Sonnabend, Felix Tschirbs, Fabian Vehlken, Thomas Zeume
Teaching Logic with Iltis: an Interactive, Web-Based System. ITiCSE (2019)
Nils Vortmeier, Thomas Zeume
Dynamic Complexity of Parity Exists Queries. CoRR (2019)
Jean Christoph Jung, Carsten Lutz, Thomas Zeume
Decidability and Complexity of ALCOIF with Transitive Closure (and More). Description Logics (2019)
Samir Datta, Anish Mukherjee, Nils Vortmeier, Thomas Zeume
Reachability and Distances under Multiple Changes. ICALP (2018)
Cynthia Bagier Taylor, Jaime Spacco, David P. Bunde, Zack Butler, Heather Bort, Christopher Lynnly Hovey, Francesco Maiorana, Thomas Zeume
Propagating the adoption of CS educational innovations. ITiCSE (Companion) (2018)
Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume
Reachability Is in DynFO. J. ACM 65 (5) (2018)
Cynthia Bagier Taylor, Jaime Spacco, David P. Bunde, Thomas Zeume, Zack Butler, Martina Barnas, Heather Bort, Francesco Maiorana, Christopher Lynnly Hovey
Promoting the adoption of educational innovations. ITiCSE (2018)
Pablo Barceló, Miguel Romero, Thomas Zeume
A More General Theory of Static Approximations for Conjunctive Queries. ICDT (2018)
Gaetano Geck, Artur Ljulin, Sebastian Peter, Jonas Schmidt, Fabian Vehlken, Thomas Zeume
Introduction to Iltis: an interactive, web-based system for teaching logic. ITiCSE (2018)
Samir Datta, Anish Mukherjee, Nils Vortmeier, Thomas Zeume
Reachability and Distances under Multiple Changes. CoRR (2018)
Thomas Schwentick, Nils Vortmeier, Thomas Zeume
Dynamic Complexity under Definable Changes. ACM Trans. Database Syst. 43 (3) (2018)
Thomas Zeume
An Update on Dynamic Complexity Theory. ICDT (2018)
Gaetano Geck, Artur Ljulin, Sebastian Peter, Jonas Schmidt, Fabian Vehlken, Thomas Zeume
Introduction to Iltis: An Interactive, Web-Based System for Teaching Logic. CoRR (2018)
Thomas Schwentick, Nils Vortmeier, Thomas Zeume
Dynamic Complexity under Definable Changes. CoRR (2017)
Thomas Zeume, Thomas Schwentick
Dynamic Conjunctive Queries. CoRR (2017)
Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume
A Strategy for Dynamic Programs: Start over and Muddle Through. ICALP (2017)
Thomas Zeume, Thomas Schwentick
Dynamic conjunctive queries. J. Comput. Syst. Sci. 88 (2017)
Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume
A Strategy for Dynamic Programs: Start over and Muddle through. CoRR (2017)
Thomas Zeume
The dynamic descriptive complexity of k-clique. Inf. Comput. 256 (2017)
Thomas Schwentick, Nils Vortmeier, Thomas Zeume
Dynamic Complexity under Definable Changes. ICDT (2017)
Thomas Zeume, Frederik Harwath
Order-Invariance of Two-Variable Logic is Decidable. CoRR (2016)
Thomas Schwentick, Thomas Zeume
Dynamic complexity: recent updates. ACM SIGLOG News 3 (2) (2016)
Thomas Zeume
The Dynamic Descriptive Complexity of k-Clique. CoRR (2016)
Thomas Zeume, Frederik Harwath
Order-Invariance of Two-Variable Logic is Decidable. LICS (2016)
Pablo Muñoz, Nils Vortmeier, Thomas Zeume
Dynamic Graph Queries. ICDT (2016)
Thomas Schwentick, Nils Vortmeier, Thomas Zeume
Static Analysis for Logic-Based Dynamic Programs. CoRR (2015)
Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume
Reachability is in DynFO. CoRR (2015)
Thomas Zeume, Thomas Schwentick
On the quantifier-free dynamic complexity of Reachability. Inf. Comput. 240 (2015)
Pablo Muñoz, Nils Vortmeier, Thomas Zeume
Dynamic Graph Queries. CoRR (2015)
Thomas Schwentick, Nils Vortmeier, Thomas Zeume
Static Analysis for Logic-based Dynamic Programs. CSL (2015)
Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume
Reachability is in DynFO. ICALP (2) (2015)
Thomas Zeume, Thomas Schwentick
Dynamic Conjunctive Queries. ICDT (2014)
Thomas Zeume
The Dynamic Descriptive Complexity of k-Clique. MFCS (1) (2014)
Thomas Zeume, Thomas Schwentick
On the quantifier-free dynamic complexity of Reachability. CoRR (2013)
Amaldev Manuel, Thomas Zeume
Two-Variable Logic on 2-Dimensional Structures. CSL (2013)
Thomas Zeume, Thomas Schwentick
On the Quantifier-Free Dynamic Complexity of Reachability. MFCS (2013)
Amaldev Manuel, Thomas Schwentick, Thomas Zeume
A Short Note on Two-Variable Logic with a Linear Order Successor and a Preorder Successor. CoRR (2013)
Thomas Schwentick, Thomas Zeume
Two-Variable Logic with Two Order Relations Log. Methods Comput. Sci. 8 (1) (2012)
Ahmet Kara, Thomas Schwentick, Thomas Zeume
Temporal Logics on Words with Multiple Data Values. FSTTCS (2010)
Ahmet Kara, Thomas Schwentick, Thomas Zeume
Temporal Logics on Words with Multiple Data Values CoRR (2010)
Thomas Schwentick, Thomas Zeume
Two-Variable Logic with Two Order Relations - (Extended Abstract). CSL (2010)
Jarkko Kari, Pascal Vanier, Thomas Zeume
Bounds on Non-surjective Cellular Automata. MFCS (2009)

Thomas Zeume.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Thomas Zeume