| Publication | Date of Publication | Type |
|---|
| A technique to speed up symmetric attractor-based algorithms for parity games | 2024-09-12 | Paper |
| Universal algorithms for parity games and nested fixpoints | 2023-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875379 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002806 | 2021-07-28 | Paper |
| When are emptiness and containment decidable for probabilistic automata? | 2021-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144638 | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144652 | 2021-01-19 | Paper |
| Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games | 2019-10-15 | Paper |
| Distributed methods for computing approximate equilibria | 2019-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636594 | 2018-04-19 | Paper |
| Distributed Methods for Computing Approximate Equilibria | 2017-02-10 | Paper |
| Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) | 2016-06-09 | Paper |
| Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time | 2015-11-04 | Paper |
| Alternating automata on data trees and XPath satisfiability | 2015-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501249 | 2015-08-03 | Paper |
| Reachability in two-clock timed automata is PSPACE-complete | 2015-06-09 | Paper |
| Stochastic Timed Automata | 2015-01-15 | Paper |
| Approximate Well-Supported Nash Equilibria in Symmetric Bimatrix Games | 2015-01-14 | Paper |
| Reachability in Two-Clock Timed Automata Is PSPACE-Complete | 2013-08-07 | Paper |
| The covering and boundedness problems for branching vector addition systems | 2013-02-21 | Paper |
| The covering and boundedness problems for branching vector addition systems | 2012-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3165971 | 2012-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3172529 | 2011-10-05 | Paper |
| A deterministic subexponential algorithm for solving parity games | 2010-08-16 | Paper |
| Linear Complementarity Algorithms for Infinite Games | 2010-01-28 | Paper |
| Concavely-Priced Probabilistic Timed Automata | 2009-10-22 | Paper |
| A Deterministic Subexponential Algorithm for Solving Parity Games | 2009-08-20 | Paper |
| Average-Price-per-Reward Games on Hybrid Automata with Strong Resets | 2009-02-10 | Paper |
| Concavely-Priced Timed Automata | 2008-12-02 | Paper |
| Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets | 2008-12-02 | Paper |
| Model Checking Probabilistic Timed Automata with One or Two Clocks | 2008-11-13 | Paper |
| A Simple P-Matrix Linear Complementarity Problem for Discounted Games | 2008-06-19 | Paper |
| Reachability-Time Games on Timed Automata | 2007-11-28 | Paper |
| Model Checking Probabilistic Timed Automata with One or Two Clocks | 2007-09-03 | Paper |
| Computer Science Logic | 2007-06-21 | Paper |
| Calculating Probabilities of Real-Time Test Cases | 2007-05-02 | Paper |
| Games with secure equilibria | 2006-12-07 | Paper |
| Formal Methods for Components and Objects | 2006-11-01 | Paper |
| Computer Science Logic | 2005-08-22 | Paper |
| Undecidability of domino games and hhp-bisimilarity. | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411830 | 2003-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4804914 | 2003-05-01 | Paper |
| Games for verification: Algorithmic issues | 2002-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754084 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501540 | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501547 | 2000-09-04 | Paper |
