Deciding regular games: a playground for exponential time algorithms
From MaRDI portal
Cites work
- A Dynamic Algorithm for Reachability Games Played on Trees
- A modal \(\mu\) perspective on solving parity games in quasi-polynomial time
- Automata, logics, and infinite games. A guide to current research
- Deciding parity games in quasipolynomial time
- Down the Borel hierarchy: solving Muller games via safety games
- Efficient algorithms for games played on trees with back-edges
- Explicit Muller games are PTIME
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
- scientific article; zbMATH DE number 1696528 (Why is no real title available?)
- scientific article; zbMATH DE number 3492660 (Why is no real title available?)
- scientific article; zbMATH DE number 1953100 (Why is no real title available?)
- scientific article; zbMATH DE number 2040951 (Why is no real title available?)
- scientific article; zbMATH DE number 2081020 (Why is no real title available?)
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- McNaughton games and extracting strategies for concurrent programs
- Network control games played on graphs
- Simple and tight complexity lower bounds for solving Rabin games
- Succinct progress measures for solving parity games
- The Complexity of Tree Automata and Logics of Programs
- Topological network-control games
- Topological network-control games played on graphs
- Update games and update networks
- Why These Automata Types?
This page was built for publication: Deciding regular games: a playground for exponential time algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310241)
