Author of the publication

Strategy Complexity of Parity Objectives in Countable MDPs.

, , , and . CONCUR, volume 171 of LIPIcs, page 39:1-39:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Effective Definability of the Reachability Relation in Timed Automata., , , and . CoRR, (2019)Controlling a Random Population is EXPTIME-hard., , and . CoRR, (2019)A Beginner's Tutorial on Strategy Complexity in Stochastic Games: Can the King Cautiously Eliminate Robin Hood?. ACM SIGLOG News, 9 (4): 27-43 (October 2022)Coverability in 1-VASS with Disequality Tests., , , , and . CONCUR, volume 171 of LIPIcs, page 38:1-38:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices., , , , and . ISSAC, page 129-138. ACM, (2022)Memoryless Strategies in Stochastic Reachability Games., , , and . CoRR, (2024)Synchronizing Data Words for Register Automata., and . ACM Trans. Comput. Log., 20 (2): 11:1-11:27 (2019)On Learning Polynomial Recursive Programs., , , and . CoRR, (2023)On the Complexity of Value Iteration., , , , and . ICALP, volume 132 of LIPIcs, page 102:1-102:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)How to Play in Infinite MDPs (Invited Talk)., , , , and . ICALP, volume 168 of LIPIcs, page 3:1-3:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)