6 citations · 10 across the 6 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.CC2012
The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
Felix Canavoi, Erich Grädel, Roman Rabinovich
For some time the discrete strategy improvement algorithm due to Jurdzinski and Voge had been considered as a candidate for solving parity games in polynomial time. However, it has…
cs.LO2012★ 4 cited
Down the Borel Hierarchy: Solving Muller Games via Safety Games
Daniel Neider, Roman Rabinovich, Martin Zimmermann
We transform a Muller game with n vertices into a safety game with (n!)^3 vertices whose solution allows to determine the winning regions of the Muller game and to compute a finite…