8 citations · 8 across the 1 of their papers we have counts for
1 paper
Krishnendu Chatterjee, Thomas A. Henzinger, Nir Piterman
The classical algorithm for solving Büchi games requires time O(n⋅m) for game graphs with n states and m edges. For game graphs with constant outdegree, the best known a…