default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Zeume
Person information
- affiliation: Ruhr University Bochum, Germany
- affiliation (former): TU Dortmund, Department of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c33]Marko Schmellenkamp, Dennis Stanglmair, Tilman Michaeli, Thomas Zeume:
Exploring Error Types in Formal Languages Among Students of Upper Secondary Education. Koli Calling 2024: 20:1-20:8- [c32]Samir Datta, Asif Khan
, Anish Mukherjee, Felix Tschirbs, Nils Vortmeier, Thomas Zeume:
Query Maintenance Under Batch Changes with Small-Depth Circuits. MFCS 2024: 46:1-46:16 - [c31]Julien Grange, Fabian Vehlken, Nils Vortmeier, Thomas Zeume:
Specification and Automatic Verification of Computational Reductions. MFCS 2024: 56:1-56:14 - [i27]Julien Grange, Fabian Vehlken, Nils Vortmeier, Thomas Zeume:
Specification and Automatic Verification of Computational Reductions. CoRR abs/2407.04037 (2024) - [i26]Tristan Kneisel, Elias Radtke, Marko Schmellenkamp, Fabian Vehlken, Thomas Zeume:
Tool-Assisted Learning of Computational Reductions. CoRR abs/2407.18215 (2024) - [i25]Marko Schmellenkamp, Thomas Zeume, Sven Argo, Sandra Kiefer, Cedric Siems, Fynn Stebel:
Detecting and explaining (in)equivalence of context-free grammars. CoRR abs/2407.18220 (2024) - [i24]Samir Datta, Asif Khan, Anish Mukherjee, Felix Tschirbs, Nils Vortmeier, Thomas Zeume:
Query maintenance under batch changes with small-depth circuits. CoRR abs/2407.20031 (2024) - [i23]Marko Schmellenkamp, Dennis Stanglmair, Tilman Michaeli, Thomas Zeume:
Exploring Error Types in Formal Languages Among Students of Upper Secondary Education. CoRR abs/2409.15043 (2024) - [i22]Daniel Neider, Leif Sabellek, Johannes Schmidt, Fabian Vehlken, Thomas Zeume:
Learning Tree Pattern Transformations. CoRR abs/2410.07708 (2024) - 2023
- [c30]Felix Tschirbs, Nils Vortmeier, Thomas Zeume:
Dynamic Complexity of Regular Languages: Big Changes, Small Work. CSL 2023: 35:1-35:19 - [c29]Marko Schmellenkamp, Alexandra Latys, Thomas Zeume:
Discovering and Quantifying Misconceptions in Formal Methods Using Intelligent Tutoring Systems. SIGCSE (1) 2023: 465-471 - 2022
- [j12]Szymon Torunczyk, Thomas Zeume:
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic. Log. Methods Comput. Sci. 18(1) (2022) - [c28]Corentin Barloy, Michaël Cadilhac, Charles Paperman, Thomas Zeume:
The Regular Languages of First-Order Logic with One Alternation. LICS 2022: 58:1-58:11 - [i21]Corentin Barloy, Michaël Cadilhac, Charles Paperman, Thomas Zeume:
The Regular Languages of First-Order Logic with One Alternation. CoRR abs/2203.06075 (2022) - 2021
- [j11]Nils Vortmeier, Thomas Zeume:
Dynamic Complexity of Parity Exists Queries. Log. Methods Comput. Sci. 17(4) (2021) - [c27]Jonas Schmidt, Thomas Schwentick, Till Tantau, Nils Vortmeier, Thomas Zeume:
Work-sensitive Dynamic Complexity of Formal Languages. FoSSaCS 2021: 490-509 - [i20]Szymon Torunczyk, Thomas Zeume:
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic. CoRR abs/2101.03866 (2021) - [i19]Jonas Schmidt, Thomas Schwentick, Till Tantau, Nils Vortmeier, Thomas Zeume:
Work-sensitive Dynamic Complexity of Formal Languages. CoRR abs/2101.08735 (2021) - [i18]Gaetano Geck, Christine Quenkert, Marko Schmellenkamp, Jonas Schmidt, Felix Tschirbs, Fabian Vehlken, Thomas Zeume:
Iltis: Teaching Logic in the Web. CoRR abs/2105.05763 (2021) - 2020
- [j10]Pablo Barceló, Miguel Romero, Thomas Zeume:
A More General Theory of Static Approximations for Conjunctive Queries. Theory Comput. Syst. 64(5): 916-964 (2020) - [j9]Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
Sketches of Dynamic Complexity. SIGMOD Rec. 49(2): 18-29 (2020) - [c26]Jonas Schmidt, Thomas Schwentick, Nils Vortmeier, Thomas Zeume, Ioannis Kokkinis:
Dynamic Complexity Meets Parameterised Algorithms. CSL 2020: 36:1-36:17 - [c25]Nils Vortmeier, Thomas Zeume:
Dynamic Complexity of Parity Exists Queries. CSL 2020: 37:1-37:16 - [c24]Samir Datta, Pankaj Kumar, Anish Mukherjee, Anuj Tawari, Nils Vortmeier, Thomas Zeume:
Dynamic Complexity of Reachability: How Many Changes Can We Handle? ICALP 2020: 122:1-122:19 - [c23]Jean Christoph Jung, Carsten Lutz, Thomas Zeume:
On the Decidability of Expressive Description Logics with Transitive Closure and Regular Role Expressions. KR 2020: 529-538 - [c22]Szymon Torunczyk, Thomas Zeume:
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic. LICS 2020: 873-885 - [i17]Samir Datta, Pankaj Kumar, Anish Mukherjee, Anuj Tawari, Nils Vortmeier, Thomas Zeume:
Dynamic complexity of Reachability: How many changes can we handle? CoRR abs/2004.12739 (2020)
2010 – 2019
- 2019
- [j8]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) - [c21]Jean Christoph Jung, Carsten Lutz, Thomas Zeume:
Decidability and Complexity of ALCOIF with Transitive Closure (and More). Description Logics 2019 - [c20]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: 307 - [i16]Pablo Barceló, Miguel Romero, Thomas Zeume:
A More General Theory of Static Approximations for Conjunctive Queries. CoRR abs/1904.00934 (2019) - [i15]Nils Vortmeier, Thomas Zeume:
Dynamic Complexity of Parity Exists Queries. CoRR abs/1910.06004 (2019) - [i14]Jonas Schmidt, Thomas Schwentick, Nils Vortmeier, Thomas Zeume, Ioannis Kokkinis:
Dynamic Complexity Meets Parameterised Algorithms. CoRR abs/1910.06281 (2019) - 2018
- [j7]Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume:
Reachability Is in DynFO. J. ACM 65(5): 33:1-33:24 (2018) - [j6]Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
Dynamic Complexity under Definable Changes. ACM Trans. Database Syst. 43(3): 12:1-12:38 (2018) - [c19]Samir Datta, Anish Mukherjee, Nils Vortmeier, Thomas Zeume:
Reachability and Distances under Multiple Changes. ICALP 2018: 120:1-120:14 - [c18]Thomas Zeume:
An Update on Dynamic Complexity Theory. ICDT 2018: 3:1-3:1 - [c17]Pablo Barceló, Miguel Romero, Thomas Zeume:
A More General Theory of Static Approximations for Conjunctive Queries. ICDT 2018: 7:1-7:22 - [c16]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: 141-146 - [c15]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: 217-235 - [c14]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: 368 - [i13]Gaetano Geck, Artur Ljulin, Sebastian Peter, Jonas Schmidt, Fabian Vehlken, Thomas Zeume:
Introduction to Iltis: An Interactive, Web-Based System for Teaching Logic. CoRR abs/1804.03579 (2018) - [i12]Samir Datta, Anish Mukherjee, Nils Vortmeier, Thomas Zeume:
Reachability and Distances under Multiple Changes. CoRR abs/1804.08555 (2018) - 2017
- [b2]Thomas Zeume:
Small Dynamic Complexity Classes: An Investigation into Dynamic Descriptive Complexity. Lecture Notes in Computer Science 10110, Springer 2017, ISBN 978-3-662-54313-9 - [j5]Thomas Zeume:
The dynamic descriptive complexity of k-clique. Inf. Comput. 256: 9-22 (2017) - [j4]Thomas Zeume, Thomas Schwentick:
Dynamic conjunctive queries. J. Comput. Syst. Sci. 88: 3-26 (2017) - [c13]Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
A Strategy for Dynamic Programs: Start over and Muddle Through. ICALP 2017: 98:1-98:14 - [c12]Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
Dynamic Complexity under Definable Changes. ICDT 2017: 19:1-19:18 - [i11]Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
Dynamic Complexity under Definable Changes. CoRR abs/1701.02494 (2017) - [i10]Thomas Zeume, Thomas Schwentick:
Dynamic Conjunctive Queries. CoRR abs/1704.01286 (2017) - [i9]Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
A Strategy for Dynamic Programs: Start over and Muddle through. CoRR abs/1704.07998 (2017) - 2016
- [j3]Thomas Schwentick, Thomas Zeume:
Dynamic complexity: recent updates. ACM SIGLOG News 3(2): 30-52 (2016) - [c11]Pablo Muñoz, Nils Vortmeier, Thomas Zeume:
Dynamic Graph Queries. ICDT 2016: 14:1-14:18 - [c10]Thomas Zeume, Frederik Harwath:
Order-Invariance of Two-Variable Logic is Decidable. LICS 2016: 807-816 - [e1]Wim Martens, Thomas Zeume:
19th International Conference on Database Theory, ICDT 2016, Bordeaux, France, March 15-18, 2016. LIPIcs 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-002-6 [contents] - [i8]Thomas Zeume, Frederik Harwath:
Order-Invariance of Two-Variable Logic is Decidable. CoRR abs/1604.05843 (2016) - [i7]Thomas Zeume:
The Dynamic Descriptive Complexity of k-Clique. CoRR abs/1610.09089 (2016) - 2015
- [b1]Thomas Zeume:
Small dynamic complexity classes. Technical University Dortmund, Germany, 2015 - [j2]Thomas Zeume, Thomas Schwentick:
On the quantifier-free dynamic complexity of Reachability. Inf. Comput. 240: 108-129 (2015) - [c9]Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
Static Analysis for Logic-based Dynamic Programs. CSL 2015: 308-324 - [c8]Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume:
Reachability is in DynFO. ICALP (2) 2015: 159-170 - [i6]Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume:
Reachability is in DynFO. CoRR abs/1502.07467 (2015) - [i5]Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
Static Analysis for Logic-Based Dynamic Programs. CoRR abs/1507.04537 (2015) - [i4]Pablo Muñoz, Nils Vortmeier, Thomas Zeume:
Dynamic Graph Queries. CoRR abs/1512.05511 (2015) - 2014
- [c7]Thomas Zeume, Thomas Schwentick:
Dynamic Conjunctive Queries. ICDT 2014: 38-49 - [c6]Thomas Zeume:
The Dynamic Descriptive Complexity of k-Clique. MFCS (1) 2014: 547-558 - 2013
- [c5]Amaldev Manuel, Thomas Zeume:
Two-Variable Logic on 2-Dimensional Structures. CSL 2013: 484-499 - [c4]Thomas Zeume, Thomas Schwentick:
On the Quantifier-Free Dynamic Complexity of Reachability. MFCS 2013: 837-848 - [i3]Thomas Zeume, Thomas Schwentick:
On the quantifier-free dynamic complexity of Reachability. CoRR abs/1306.3056 (2013) - [i2]Amaldev Manuel, Thomas Schwentick, Thomas Zeume:
A Short Note on Two-Variable Logic with a Linear Order Successor and a Preorder Successor. CoRR abs/1306.3418 (2013) - 2012
- [j1]Thomas Schwentick, Thomas Zeume:
Two-Variable Logic with Two Order Relations. Log. Methods Comput. Sci. 8(1) (2012) - 2010
- [c3]Thomas Schwentick, Thomas Zeume:
Two-Variable Logic with Two Order Relations - (Extended Abstract). CSL 2010: 499-513 - [c2]Ahmet Kara, Thomas Schwentick, Thomas Zeume:
Temporal Logics on Words with Multiple Data Values. FSTTCS 2010: 481-492 - [i1]Ahmet Kara, Thomas Schwentick, Thomas Zeume:
Temporal Logics on Words with Multiple Data Values. CoRR abs/1010.1139 (2010)
2000 – 2009
- 2009
- [c1]Jarkko Kari, Pascal Vanier, Thomas Zeume:
Bounds on Non-surjective Cellular Automata. MFCS 2009: 439-450
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-19 21:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
