Solving parity games in big steps

Alur, 2002, Alternating-time temporal logic, J. ACM, 49, 672, 10.1145/585265.585270 Berwanger, 2006, Dag-width and parity games, 524 Björklund, 2004, Memoryless determinacy of parity and mean payoff games: a simple proof, Theor. Comput. Sci., 310, 365, 10.1016/S0304-3975(03)00427-4 Björklund, 2007, A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games, Discrete Appl. Math., 155, 210, 10.1016/j.dam.2006.04.029 Browne, 1997, An improved algorithm for the evaluation of fixpoint expressions, Theor. Comput. Sci., 178, 237, 10.1016/S0304-3975(96)00228-9 de Alfaro, 2001, From verification to control: dynamic programs for omega-regular objectives, 279 Emerson, 1993, On model-checking for fragments of μ-calculus, 385 Emerson, 1986, Efficient model checking in fragments of the propositional μ-calculus, 267 Fearnley, 2013, Time and parallelizability results for parity games with bounded tree and DAG width, Log. Methods Comput. Sci., 467, 1 Jurdziński, 1998, Deciding the winner in parity games is in UP ∩ co-UP, Inf. Process. Lett., 68, 119, 10.1016/S0020-0190(98)00150-1 Jurdziński, 2000, Small Progress Measures for Solving Parity Games, vol. 1770, 290 Jurdziński, 2008, A deterministic subexponential algorithm for solving parity games, 38, 1519 Kozen, 1983, Results on the propositional μ-calculus, Theor. Comput. Sci., 27, 333, 10.1016/0304-3975(82)90125-6 Kupferman, 1997, Module checking revisited, vol. 1254, 36 Lange, 2005, Solving parity games by a reduction to SAT Ludwig, 1995, A subexponential randomized algorithm for the simple stochastic game problem, Inf. Comput., 117, 151, 10.1006/inco.1995.1035 McNaughton, 1993, Infinite games played on finite graphs, Ann. Pure Appl. Logic, 65, 149, 10.1016/0168-0072(93)90036-D Obdržálek, 2003, Fast mu-calculus model checking when tree-width is bounded, 80 Piterman, 2007, From nondeterministic Büchi and Streett automata to deterministic parity automata, Log. Methods Comput. Sci., 3, 10.2168/LMCS-3(3:5)2007 Puri, 1995 Schewe, 2007, Solving parity games in big steps, vol. 4805, 449 Schewe, 2008 Schewe, 2009, Tighter bounds for the determinisation of Büchi automata, vol. 5504, 167 Schewe, 2006, Satisfiability and finite model property for the alternating-time μ-calculus, vol. 4207, 591 Schewe, 2006, Synthesis of asynchronous systems, vol. 4407, 127 Vardi, 1998, Reasoning about the past with two-way automata, 628 Vöge, 2000, A discrete strategy improvement algorithm for solving parity games, 202 Wilke, 2001, Alternating tree automata, parity games, and modal μ-calculus, Bull. Soc. Math. Belg., 8 Zielonka, 1998, Infinite games on finitely coloured graphs with applications to automata on infinite trees, Theor. Comput. Sci., 200, 135, 10.1016/S0304-3975(98)00009-7 Zwick, 1996, The complexity of mean payoff games on graphs, Theor. Comput. Sci., 158, 343, 10.1016/0304-3975(95)00188-3