| Publication | Date of Publication | Type |
|---|
| The regular languages of first-order logic with one alternation | 2024-12-06 | Paper |
| Dynamic complexity of regular languages: big changes, small work | 2024-09-25 | Paper |
scientific article; zbMATH DE number 7650849 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
| scientific article; zbMATH DE number 7650850 (Why is no real title available?) | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7566055 (Why is no real title available?)
(available as arXiv preprint) | 2022-08-02 | Paper |
| scientific article; zbMATH DE number 7566055 (Why is no real title available?) | 2022-08-02 | Paper |
scientific article; zbMATH DE number 7471669 (Why is no real title available?)
(available as arXiv preprint) | 2022-02-09 | Paper |
| scientific article; zbMATH DE number 7471669 (Why is no real title available?) | 2022-02-09 | Paper |
Dynamic complexity under definable changes
ACM Transactions on Database Systems | 2021-11-25 | Paper |
Work-sensitive dynamic complexity of formal languages
(available as arXiv preprint) | 2021-10-18 | Paper |
Reachability and distances under multiple changes
(available as arXiv preprint) | 2021-07-28 | Paper |
Register Automata with Extrema Constraints, and an Application to Two-Variable Logic
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
A more general theory of static approximations for conjunctive queries
(available as arXiv preprint) | 2020-08-06 | Paper |
A more general theory of static approximations for conjunctive queries
Theory of Computing Systems | 2020-07-02 | Paper |
| A strategy for dynamic programs: start over and muddle through | 2020-05-27 | Paper |
A strategy for dynamic programs: start over and muddle through
(available as arXiv preprint) | 2019-05-17 | Paper |
Reachability is in DynFO
Journal of the ACM | 2019-02-25 | Paper |
Dynamic Complexity under Definable Changes
(available as arXiv preprint) | 2018-07-18 | Paper |
Order-invariance of two-variable logic is decidable
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
The dynamic descriptive complexity of \(k\)-clique
Information and Computation | 2017-09-28 | Paper |
Static analysis for logic-based dynamic programs
(available as arXiv preprint) | 2017-08-31 | Paper |
Dynamic graph queries
(available as arXiv preprint) | 2017-07-14 | Paper |
Dynamic conjunctive queries
Journal of Computer and System Sciences | 2017-06-30 | Paper |
Small dynamic complexity classes. An investigation into dynamic descriptive complexity
Lecture Notes in Computer Science | 2017-02-20 | Paper |
| Two-variable logic on 2-dimensional structures | 2017-02-02 | Paper |
Reachability is in DynFO
Automata, Languages, and Programming | 2015-11-04 | Paper |
On the quantifier-free dynamic complexity of reachability
Information and Computation | 2015-01-30 | Paper |
The dynamic descriptive complexity of \(k\)-clique
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
On the Quantifier-Free Dynamic Complexity of Reachability
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
| Temporal logics on words with multiple data values | 2012-08-29 | Paper |
Temporal logics on words with multiple data values
(available as arXiv preprint) | 2012-08-29 | Paper |
Two-variable logic with two order relations
Logical Methods in Computer Science | 2012-04-03 | Paper |
Two-variable logic with two order relations (extended abstract)
Computer Science Logic | 2010-09-03 | Paper |
Bounds on Non-surjective Cellular Automata
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
