| Publication | Date of Publication | Type |
|---|
| The Strahler number of a parity game | 2026-03-18 | Paper |
| Lookahead games and efficient determinisation of history-deterministic Büchi automata | 2026-01-14 | Paper |
| A technique to speed up symmetric attractor-based algorithms for parity games | 2024-09-12 | Paper |
Universal algorithms for parity games and nested fixpoints
Lecture Notes in Computer Science | 2023-08-10 | Paper |
scientific article; zbMATH DE number 7649926 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| When is containment decidable for probabilistic automata? | 2021-07-28 | Paper |
When are emptiness and containment decidable for probabilistic automata?
Journal of Computer and System Sciences | 2021-04-14 | Paper |
When are emptiness and containment decidable for probabilistic automata?
Journal of Computer and System Sciences | 2021-04-14 | Paper |
| Succinct progress measures for solving parity games | 2021-01-19 | Paper |
Succinct progress measures for solving parity games
(available as arXiv preprint) | 2021-01-19 | Paper |
| Perfect half space games | 2021-01-19 | Paper |
Perfect half space games
(available as arXiv preprint) | 2021-01-19 | Paper |
Universal trees grow inside separating automata: quasi-polynomial lower bounds for parity games
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Distributed methods for computing approximate equilibria
Algorithmica | 2019-03-11 | Paper |
scientific article; zbMATH DE number 6862072 (Why is no real title available?)
(available as arXiv preprint) | 2018-04-19 | Paper |
Distributed Methods for Computing Approximate Equilibria
Web and Internet Economics | 2017-02-10 | Paper |
Distributed Methods for Computing Approximate Equilibria
Web and Internet Economics | 2017-02-10 | Paper |
Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
Information Processing Letters | 2016-06-09 | Paper |
Fixed-dimensional energy games are in pseudo-polynomial time
Automata, Languages, and Programming | 2015-11-04 | Paper |
Alternating automata on data trees and XPath satisfiability
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
| Quantitative stochastic parity games | 2015-08-03 | Paper |
Reachability in two-clock timed automata is PSPACE-complete
Information and Computation | 2015-06-09 | Paper |
Stochastic timed automata
Logical Methods in Computer Science | 2015-01-15 | Paper |
Approximate well-supported Nash equilibria in symmetric bimatrix games
Algorithmic Game Theory | 2015-01-14 | Paper |
Reachability in two-clock timed automata is PSPACE-complete
Automata, Languages, and Programming | 2013-08-07 | Paper |
The covering and boundedness problems for branching vector addition systems
Journal of Computer and System Sciences | 2013-02-21 | Paper |
| The covering and boundedness problems for branching vector addition systems | 2012-10-24 | Paper |
| Average-time games | 2012-10-19 | Paper |
| Algorithms for solving parity games | 2011-10-05 | Paper |
A deterministic subexponential algorithm for solving parity games
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Linear complementarity algorithms for infinite games
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
Concavely-Priced Probabilistic Timed Automata
CONCUR 2009 - Concurrency Theory | 2009-10-22 | Paper |
A Deterministic Subexponential Algorithm for Solving Parity Games
SIAM Journal on Computing | 2009-08-20 | Paper |
Average-Price-per-Reward Games on Hybrid Automata with Strong Resets
Lecture Notes in Computer Science | 2009-02-10 | Paper |
Concavely-Priced Timed Automata
Lecture Notes in Computer Science | 2008-12-02 | Paper |
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
Lecture Notes in Computer Science | 2008-12-02 | Paper |
Model Checking Probabilistic Timed Automata with One or Two Clocks
Logical Methods in Computer Science | 2008-11-13 | Paper |
A Simple P-Matrix Linear Complementarity Problem for Discounted Games
Logic and Theory of Algorithms | 2008-06-19 | Paper |
Reachability-Time Games on Timed Automata
Automata, Languages and Programming | 2007-11-28 | Paper |
Model Checking Probabilistic Timed Automata with One or Two Clocks
Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-03 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
Calculating Probabilities of Real-Time Test Cases
Formal Approaches to Software Testing | 2007-05-02 | Paper |
Games with secure equilibria
Theoretical Computer Science | 2006-12-07 | Paper |
Formal Methods for Components and Objects
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Undecidability of domino games and hhp-bisimilarity.
Information and Computation | 2003-08-19 | Paper |
| scientific article; zbMATH DE number 1948169 (Why is no real title available?) | 2003-07-10 | Paper |
| scientific article; zbMATH DE number 1903369 (Why is no real title available?) | 2003-05-01 | Paper |
| Games for verification: Algorithmic issues | 2002-01-16 | Paper |
| scientific article; zbMATH DE number 1670778 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1500523 (Why is no real title available?) | 2000-09-04 | Paper |
| scientific article; zbMATH DE number 1500529 (Why is no real title available?) | 2000-09-04 | Paper |
