1. Condon, A.: The complexity of stochastic games. Inf. Comput. 96(2), 203–224 (1992)
2. Csanky, L.: Fast parallel matrix inversion algorithms. SIAM J. Comput. 5(4), 618–623 (1976). https://doi.org/10.1137/020504
3. Dohrau, J., Gärtner, B., Kohler, M., Matoušek, J., Welzl, E.: ARRIVAL: a zero-player graph game in $${\sf NP}\cap {\sf coNP}$$. In: Loebl, M., Nešetřil, J., Thomas, R. (eds.) A Journey Through Discrete Mathematics, pp. 367–374. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-44479-6_14
4. Fearnley, J., Gairing, M., Mnich, M., Savani, R.: Reachability switching games. Log. Methods Comput. Sci. 17(2) (2021)
5. Fearnley, J., Gordon, S., Mehta, R., Savani, R.: Unique end of potential line. In: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), LIPIcs, vol. 132, pp. 1–15 (2019)