| Publication | Date of Publication | Type |
|---|
| Unboundedness for recursion schemes: a simpler type system | 2024-06-24 | Paper |
| Weak bisimulation finiteness of pushdown systems with deterministic \(\varepsilon\)-transitions is 2-\textsc{ExpTime}-complete | 2024-05-14 | Paper |
| Improved complexity analysis of quasi-polynomial algorithms solving parity games | 2024-01-12 | Paper |
| Cost Automata, Safe Schemes, and Downward Closures | 2023-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874219 | 2023-02-07 | Paper |
| Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time | 2022-07-21 | Paper |
| The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic | 2022-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5076057 | 2022-05-12 | Paper |
| Shelah-Stupp's and Muchnik's iterations revisited | 2022-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5028462 | 2022-02-09 | Paper |
| Homogeneity without loss of generality | 2021-06-15 | Paper |
| Higher-order pushdown systems with data | 2021-04-27 | Paper |
| Bisimulation Finiteness of Pushdown Systems Is Elementary | 2021-01-21 | Paper |
| A type system describing unboundedness | 2021-01-05 | Paper |
| The Complexity of the Diagonal Problem for Recursion Schemes | 2020-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5119391 | 2020-09-04 | Paper |
| Recursion schemes and the WMSO+U logic | 2020-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5109508 | 2020-05-12 | Paper |
| Extensions of the Caucal hierarchy? | 2019-12-04 | Paper |
| Universal trees grow inside separating automata: quasi-polynomial lower bounds for parity games | 2019-10-15 | Paper |
| Minimization of tree patterns | 2019-02-25 | Paper |
| Reasoning about integrity constraints for tree-structured data | 2018-07-16 | Paper |
| The diagonal problem for higher-order recursion schemes is decidable | 2018-04-23 | Paper |
| Two-way cost automata and cost logics over infinite trees | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601873 | 2018-01-24 | Paper |
| On a fragment of AMSO and tiling systems | 2018-01-24 | Paper |
| A characterization of lambda-terms transforming numerals | 2017-10-23 | Paper |
| Models of \(\lambda\)-calculus and the weak MSO logic | 2017-07-19 | Paper |
| Reasoning about integrity constraints for tree-structured data | 2017-07-14 | Paper |
| Ordered tree-pushdown systems | 2017-07-13 | Paper |
| On the significance of the collapse operation | 2017-05-16 | Paper |
| Decidable classes of documents for XPath | 2017-01-26 | Paper |
| Weak containment for partial words is coNP-complete | 2015-12-01 | Paper |
| How many numbers can a lambda-term contain? | 2014-07-24 | Paper |
| First-Order Logic on CPDA Graphs | 2014-06-24 | Paper |
| XPath evaluation in linear time | 2014-02-17 | Paper |
| Some results on complexity of \(\mu\)-calculus evaluation in the black-box model | 2013-08-13 | Paper |
| Variants of collapsible pushdown systems | 2012-11-22 | Paper |
| Strictness of the collapsible pushdown hierarchy | 2012-09-25 | Paper |
| Weak alternating timed automata | 2012-09-25 | Paper |
| A pumping lemma for pushdown graphs of any level | 2012-08-23 | Paper |
| Collapse operation increases expressive power of deterministic higher order pushdown automata | 2012-01-23 | Paper |
| Efficient evaluation of nondeterministic automata using factorization forests | 2010-09-07 | Paper |
| Weak Alternating Timed Automata | 2009-07-14 | Paper |
| Systems of Equations Satisfied in All Commutative Finite Semigroups | 2008-04-11 | Paper |
