56 citations · 149 across the 22 of their papers we have counts for
1 paper · 1 filter
Thomas Colcombet, Nathanaël Fijalkow, Paweł Gawrychowski +1
We introduce the notion of universal graphs as a tool for constructing algorithms solving games of infinite duration such as parity games and mean payoff games. In the first part w…