| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147300 | 2024-01-15 | Paper |
| Languages given by Finite Automata over the Unary Alphabet | 2023-02-13 | Paper |
| The Reachability Problem for Petri Nets Is Not Elementary | 2022-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092425 | 2022-07-21 | Paper |
| Universality Problem for Unambiguous VASS | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5089315 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075772 | 2022-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009453 | 2021-08-04 | Paper |
| Unboundedness Problems for Languages of Vector Addition Systems. | 2021-07-28 | Paper |
| Improved Bounds for the Excluded-Minor Approximation of Treedepth | 2021-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4986258 | 2021-04-27 | Paper |
| An Approach to Regular Separability in Vector Addition Systems | 2021-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144625 | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111449 | 2020-05-27 | Paper |
| The reachability problem for Petri nets is not elementary | 2020-01-30 | Paper |
| Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games | 2019-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4968382 | 2019-07-12 | Paper |
| Shortest Paths in One-Counter Systems | 2019-03-18 | Paper |
| Minimization of Tree Patterns | 2019-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4560219 | 2018-12-10 | Paper |
| Reasoning about integrity constraints for tree-structured data | 2018-07-16 | Paper |
| Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME | 2018-04-23 | Paper |
| Separability of Reachability Sets of Vector Addition Systems | 2018-04-19 | Paper |
| Reasoning About Integrity Constraints for Tree-Structured Data | 2017-07-14 | Paper |
| Deciding definability by deterministic regular expressions | 2017-06-30 | Paper |
| Non-dominating Sequences of Vectors Using only Resets and Increments | 2016-08-15 | Paper |
| Shortest Paths in One-Counter Systems | 2016-06-10 | Paper |
| A Note on Decidable Separability by Piecewise Testable Languages | 2015-09-29 | Paper |
| Decidability of branching bisimulation on normed commutative context-free processes | 2015-02-05 | Paper |
| Reachability Problem for Weak Multi-Pushdown Automata | 2013-09-26 | Paper |
| Complexity of Checking Bisimilarity between Sequential and Parallel Processes | 2013-09-20 | Paper |
| Efficient Separability of Regular Languages by Subsequences and Suffixes | 2013-08-07 | Paper |
| Deciding Definability by Deterministic Regular Expressions | 2013-03-18 | Paper |
| Reachability Problem for Weak Multi-Pushdown Automata | 2012-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2908855 | 2012-08-29 | Paper |
| Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes | 2011-09-02 | Paper |
| Partially-commutative context-free processes: expressibility and tractability | 2011-05-04 | Paper |
| Partially-Commutative Context-Free Processes | 2009-10-22 | Paper |
