| Publication | Date of Publication | Type |
|---|
| The power of counting steps in quantitative games | 2026-02-10 | Paper |
| Bounded-memory strategies in partial-information games | 2025-06-18 | Paper |
| Complexity of spatial games | 2024-09-12 | Paper |
The Big Match with a Clock and a Bit of Memory
Mathematics of Operations Research | 2024-02-23 | Paper |
| scientific article; zbMATH DE number 7799620 (Why is no real title available?) | 2024-02-05 | Paper |
scientific article; zbMATH DE number 7559393 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Faster algorithms for quantitative verification in bounded treewidth graphs
Formal Methods in System Design | 2021-12-08 | Paper |
Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies
(available as arXiv preprint) | 2021-08-04 | Paper |
Absorbing games with a clock and two bits of memory
Games and Economic Behavior | 2021-06-08 | Paper |
One-Clock Priced Timed Games are PSPACE-hard
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
Infinite-duration poorman-bidding games
(available as arXiv preprint) | 2020-06-18 | Paper |
| scientific article; zbMATH DE number 7204389 (Why is no real title available?) | 2020-05-26 | Paper |
scientific article; zbMATH DE number 7204395 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-26 | Paper |
| Bidding games on Markov decision processes | 2019-10-22 | Paper |
| Optimal reachability and a space-time tradeoff for distance queries in constant-treewidth graphs | 2018-03-02 | Paper |
Faster algorithms for quantitative verification in constant treewidth graphs
(available as arXiv preprint) | 2018-03-01 | Paper |
| Faster algorithms for quantitative verification in constant treewidth graphs | 2018-03-01 | Paper |
Edit distance for pushdown automata
(available as arXiv preprint) | 2017-10-12 | Paper |
The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Edit distance for timed automata
Proceedings of the 17th international conference on Hybrid systems: computation and control | 2017-05-16 | Paper |
Algorithms for algebraic path properties in concurrent systems of constant treewidth components
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-10-24 | Paper |
Faster algorithms for algebraic path properties in recursive state machines with constant treewidth
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-09-29 | Paper |
The Big Match in small space (extended abstract)
Algorithmic Game Theory | 2016-09-29 | Paper |
Edit distance for pushdown automata
Automata, Languages, and Programming | 2015-11-04 | Paper |
Qualitative analysis of concurrent mean-payoff games
Information and Computation | 2015-06-01 | Paper |
The complexity of solving reachability games using value and strategy iteration
Theory of Computing Systems | 2015-02-05 | Paper |
The complexity of ergodic mean-payoff games
Automata, Languages, and Programming | 2014-07-01 | Paper |
Patience of matrix games
Discrete Applied Mathematics | 2014-04-10 | Paper |
A faster algorithm for solving one-clock priced timed games
CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games
Lecture Notes in Computer Science | 2013-08-05 | Paper |
Solving simple stochastic games with few coin toss positions
Algorithms – ESA 2012 | 2012-09-25 | Paper |
The complexity of solving reachability games using value and strategy iteration
Lecture Notes in Computer Science | 2011-06-17 | Paper |
