| Publication | Date of Publication | Type |
|---|
| On the computation of the Zariski closure of finitely generated groups of matrices | 2025-01-17 | Paper |
| Reachability in vector addition systems is primitive-recursive in fixed dimension | 2024-12-19 | Paper |
| Bisimulation equivalence of first-order grammars is ACKERMANN-complete | 2024-12-19 | Paper |
| The Parametric Complexity of Lossy Counter Machines | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090950 | 2022-07-21 | Paper |
| On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices | 2021-06-03 | Paper |
| The ideal view on Rackoff's coverability technique | 2021-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144652 | 2021-01-19 | Paper |
| On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders | 2020-07-08 | Paper |
| Coverability Is undecidable in one-dimensional pushdown vector addition systems with resets | 2019-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5224559 | 2019-07-24 | Paper |
| The Complexity of Diagnosability and Opacity Verification for Petri Nets | 2018-10-02 | Paper |
| The complexity of diagnosability and opacity verification for Petri nets | 2018-08-20 | Paper |
| Demystifying Reachability in Vector Addition Systems | 2018-04-23 | Paper |
| The Complexity of Coverability in ν-Petri Nets | 2018-04-23 | Paper |
| Nonelementary Complexities for Branching VASS, MELL, and Extensions | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601852 | 2018-01-24 | Paper |
| Deciding Piecewise Testable Separability for Regular Tree Languages | 2017-12-19 | Paper |
| The ideal view on Rackoff's coverability technique | 2017-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5278420 | 2017-07-19 | Paper |
| Model-Checking Parse Trees | 2017-07-03 | Paper |
| The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets | 2017-05-16 | Paper |
| Complexity hierarchies beyond elementary | 2016-10-24 | Paper |
| IMPLICATIONAL RELEVANCE LOGIC IS 2-EXPTIME-COMPLETE | 2016-08-19 | Paper |
| Coverability Trees for Petri Nets with Unordered Data | 2016-06-10 | Paper |
| Forward analysis and model checking for trace bounded WSTS | 2016-06-03 | Paper |
| Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time | 2015-11-04 | Paper |
| Complexity Bounds for Ordinal-Based Termination | 2015-10-28 | Paper |
| Nonelementary Complexities for Branching VASS, MELL, and Extensions | 2015-09-17 | Paper |
| The Power of Priority Channel Systems | 2015-01-15 | Paper |
| Alternating Vector Addition Systems with States | 2014-10-14 | Paper |
| Implicational Relevance Logic is 2-ExpTime-Complete | 2014-07-24 | Paper |
| The Power of Well-Structured Systems | 2013-08-12 | Paper |
| The Power of Priority Channel Systems | 2013-08-12 | Paper |
| The Parametric Ordinal-Recursive Complexity of Post Embedding Problems | 2013-03-18 | Paper |
| Model Checking Coverability Graphs of Vector Addition Systems | 2011-08-17 | Paper |
| Forward Analysis and Model Checking for Trace Bounded WSTS | 2011-06-29 | Paper |
| Parametric random generation of deterministic tree automata | 2010-10-07 | Paper |
| An experimental ambiguity detection tool | 2010-01-15 | Paper |
| Random Generation of Deterministic Tree (Walking) Automata | 2009-07-09 | Paper |
| Noncanonical LALR(1) Parsing | 2009-03-26 | Paper |
| Conservative Ambiguity Detection in Context-Free Grammars | 2007-11-28 | Paper |
| Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time | 2007-09-06 | Paper |
