| Publication | Date of Publication | Type |
|---|
| On the existential theories of Büchi arithmetic and linear \(p\)-adic fields | 2024-12-19 | Paper |
| Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests | 2024-12-19 | Paper |
| Geometric decision procedures and the VC dimension of linear arithmetic theories | 2024-12-06 | Paper |
| On polynomial-time decidability of \(k\)-negations fragments of FO theories (extended abstract) | 2024-12-03 | Paper |
| Integer programming with GCD constraints | 2024-11-28 | Paper |
| Reachability in fixed VASS: expressiveness and lower bounds | 2024-10-30 | Paper |
| Higher-order quantified Boolean satisfiability | 2024-08-06 | Paper |
| Quantifier elimination for counting extensions of Presburger arithmetic | 2024-01-23 | Paper |
| Integer Programming with GCD Constraints | 2023-08-25 | Paper |
| On Deciding Linear Arithmetic Constraints Over p-adic Integers for All Primes | 2023-08-08 | Paper |
| The Reachability Problem for Two-Dimensional Vector Addition Systems with States | 2022-12-08 | Paper |
| On the expressiveness of Büchi arithmetic | 2021-10-18 | Paper |
| Directed reachability for infinite-state systems | 2021-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5155662 | 2021-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009428 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144614 | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144636 | 2021-01-19 | Paper |
| On the Expressiveness of B\"uchi Arithmetic | 2020-10-24 | Paper |
| Approaching arithmetic theories with finite-state automata | 2020-07-27 | Paper |
| On the Complexity of Quantified Integer Programming | 2020-05-27 | Paper |
| Counting problems for parikh images | 2020-05-26 | Paper |
| Approaching the coverability problem continuously | 2019-09-17 | Paper |
| On the Size of Finite Rational Matrix Semigroups | 2019-09-09 | Paper |
| Context-free commutative grammars with integer counters and resets | 2018-06-05 | Paper |
| Subclasses of presburger arithmetic and the weak EXP hierarchy | 2018-04-23 | Paper |
| Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601893 | 2018-01-24 | Paper |
| A polynomial-time algorithm for reachability in branching VASS in dimension one | 2017-12-19 | Paper |
| The taming of the semi-linear set | 2017-12-19 | Paper |
| The Logical View on Continuous Petri Nets | 2017-10-16 | Paper |
| Relating Reachability Problems in Timed and Counter Automata | 2017-03-16 | Paper |
| The complexity of the \(K\)th largest subset problem and related problems | 2015-12-01 | Paper |
| The Odds of Staying on Budget | 2015-11-04 | Paper |
| Integer Vector Addition Systems with States | 2015-10-28 | Paper |
| The Power of Priority Channel Systems | 2015-01-15 | Paper |
| Foundations for Decision Problems in Separation Logic with General Inductive Predicates | 2014-04-16 | Paper |
| Reachability in Register Machines with Polynomial Updates | 2013-09-20 | Paper |
| The Power of Priority Channel Systems | 2013-08-12 | Paper |
| On the Relationship between Reachability Problems in Timed and Counter Automata | 2013-01-07 | Paper |
| Branching-Time Model Checking of Parametric One-Counter Automata | 2012-06-22 | Paper |
| Tractable Reasoning in a Fragment of Separation Logic | 2011-09-02 | Paper |
| On Process-Algebraic Extensions of Metric Temporal Logic | 2010-10-26 | Paper |
| Model Checking Succinct and Parametric One-Counter Automata | 2010-09-07 | Paper |
| Ideal Downward Refinement in the $\mathcal{EL}$ Description Logic | 2010-08-24 | Paper |
| Reachability in Succinct and Parametric One-Counter Automata | 2009-10-22 | Paper |
| An efficient quantifier elimination procedure for Presburger arithmetic | N/A | Paper |
