5 citations · 11 across the 9 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2022
Playing Safe, Ten Years Later
Thomas Colcombet, Nathanaël Fijalkow, Florian Horn
We consider two-player games over graphs and give tight bounds on the memory size of strategies ensuring safety objectives. More specifically, we show that the minimal number of me…
cs.GT2018
Parity games and universal graphs
Thomas Colcombet, Nathanaël Fijalkow
This paper is a contribution to the study of parity games and the recent constructions of three quasipolynomial time algorithms for solving them. We revisit a result of Czerwiński,…