Thomas Zeume

Orcid: 0000-0002-5186-7507

Affiliations:
  • Ruhr University Bochum, Germany
  • TU Dortmund, Department of Computer Science (former)


According to our database1, Thomas Zeume authored at least 37 papers between 2009 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Discovering and Quantifying Misconceptions in Formal Methods Using Intelligent Tutoring Systems.
Proceedings of the 54th ACM Technical Symposium on Computer Science Education, Volume 1, 2023

Dynamic Complexity of Regular Languages: Big Changes, Small Work.
Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

2022
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic.
Log. Methods Comput. Sci., 2022

The Regular Languages of First-Order Logic with One Alternation.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

2021
Dynamic Complexity of Parity Exists Queries.
Log. Methods Comput. Sci., 2021

Iltis: Teaching Logic in the Web.
CoRR, 2021

Work-sensitive Dynamic Complexity of Formal Languages.
Proceedings of the Foundations of Software Science and Computation Structures, 2021

2020
Sketches of Dynamic Complexity.
SIGMOD Rec., 2020

A More General Theory of Static Approximations for Conjunctive Queries.
Theory Comput. Syst., 2020

On the Decidability of Expressive Description Logics with Transitive Closure and Regular Role Expressions.
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Dynamic Complexity of Reachability: How Many Changes Can We Handle?
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Dynamic Complexity Meets Parameterised Algorithms.
Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

2019
A Strategy for Dynamic Programs: Start over and Muddle through.
Log. Methods Comput. Sci., 2019

Teaching Logic with Iltis: an Interactive, Web-Based System.
Proceedings of the 2019 ACM Conference on Innovation and Technology in Computer Science Education, 2019

Decidability and Complexity of ALCOIF with Transitive Closure (and More).
Proceedings of the 32nd International Workshop on Description Logics, 2019

2018
Dynamic Complexity under Definable Changes.
ACM Trans. Database Syst., 2018

Reachability Is in DynFO.
J. ACM, 2018

Promoting the adoption of educational innovations.
Proceedings of the 23rd Annual ACM Conference on Innovation and Technology in Computer Science Education, 2018

Propagating the adoption of CS educational innovations.
Proceedings of the Proceedings Companion of the 23rd Annual ACM Conference on Innovation and Technology in Computer Science Education, 2018

Introduction to Iltis: an interactive, web-based system for teaching logic.
Proceedings of the 23rd Annual ACM Conference on Innovation and Technology in Computer Science Education, 2018

An Update on Dynamic Complexity Theory.
Proceedings of the 21st International Conference on Database Theory, 2018

Reachability and Distances under Multiple Changes.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Small Dynamic Complexity Classes: An Investigation into Dynamic Descriptive Complexity
Lecture Notes in Computer Science 10110, Springer, ISBN: 978-3-662-54313-9, 2017

Dynamic conjunctive queries.
J. Comput. Syst. Sci., 2017

The dynamic descriptive complexity of k-clique.
Inf. Comput., 2017

2016
Dynamic complexity: recent updates.
ACM SIGLOG News, 2016

Order-Invariance of Two-Variable Logic is Decidable.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Dynamic Graph Queries.
Proceedings of the 19th International Conference on Database Theory, 2016

2015
Small dynamic complexity classes.
PhD thesis, 2015

On the quantifier-free dynamic complexity of Reachability.
Inf. Comput., 2015

Static Analysis for Logic-based Dynamic Programs.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2013
A Short Note on Two-Variable Logic with a Linear Order Successor and a Preorder Successor.
CoRR, 2013

Two-Variable Logic on 2-Dimensional Structures.
Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012
Two-Variable Logic with Two Order Relations
Log. Methods Comput. Sci., 2012

2010
Temporal Logics on Words with Multiple Data Values.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Two-Variable Logic with Two Order Relations - (Extended Abstract).
Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2009
Bounds on Non-surjective Cellular Automata.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009


  Loading...