A.Ehrenfeucht & J.Mycielski (1979):
Positional Strategies for Mean Payoff Games..
IJGT 8(2),
doi:10.1007/BF01768705.
E.A. Emerson & C.S. Jutla (1988):
The Complexity of Tree Automata and Logics of Programs (Extended Abstract)..
In: FOCS'88.
IEEE Computer Society,
pp. 328–337,
doi:10.1109/SFCS.1988.21949.
E.A. Emerson & C.S. Jutla (1991):
Tree Automata, muCalculus, and Determinacy..
In: FOCS'91.
IEEE Computer Society,
pp. 368–377,
doi:10.1109/SFCS.1988.21949.
E.A. Emerson, C.S. Jutla & A.P. Sistla (1993):
On Model Checking for the muCalculus and its Fragments..
In: CAV'93,
LNCS 697.
Springer,
pp. 385–396,
doi:10.1016/S0304-3975(00)00034-7.
O.Friedmann & M.Lange (2009):
Solving Parity Games in Practice..
In: ATVA'09,
LNCS 5799.
Springer,
pp. 182–196,
doi:10.1007/978-3-642-04761-9_15.
E.Grädel, W.Thomas & T.Wilke (2002):
Automata, Logics, and Infinite Games: A Guide to Current Research..
LNCS 2500.
Springer,
doi:10.1007/3-540-36387-4.
V.A. Gurevich, A.V. Karzanov & L.G. Khachivan (1990):
Cyclic Games and an Algorithm to Find Minimax Cycle Means in Directed Graphs..
USSRCMMP 28(5),
pp. 85–91,
doi:10.1016/0041-5553(88)90012-2.
M.Jurdziński (1998):
Deciding the Winner in Parity Games is in UP co-UP..
IPL 68(3),
pp. 119–124,
doi:10.1016/S0020-0190(98)00150-1.
M.Jurdziński (2000):
Small Progress Measures for Solving Parity Games..
In: STACS'00,
LNCS 1770.
Springer,
pp. 290–301,
doi:10.1007/3-540-46541-3_24.
M.Jurdziński, M.Paterson & U.Zwick (2008):
A Deterministic Subexponential Algorithm for Solving Parity Games..
SJM 38(4),
pp. 1519–1532,
doi:10.1137/070686652.
O.Kupferman & M.Y. Vardi (1998):
Weak Alternating Automata and Tree Automata Emptiness..
In: STOC'98.
Association for Computing Machinery,
pp. 224–233,
doi:10.1145/276698.276748.
O.Kupferman, M.Y. Vardi & P.Wolper (2000):
An Automata Theoretic Approach to Branching-Time Model Checking..
JACM 47(2),
pp. 312–360,
doi:10.1145/333979.333987.
A.W. Mostowski (1984):
Regular Expressions for Infinite Trees and a Standard Form of Automata..
In: SCT'84,
LNCS 208.
Springer,
pp. 157–168,
doi:10.1007/3-540-16066-3_15.
A.W. Mostowski (1991):
Games with Forbidden Positions..
Technical Report.
University of Gdańsk, Gdańsk, Poland.
S.Schewe (2007):
Solving Parity Games in Big Steps..
In: FSTTCS'07,
LNCS 4855.
Springer,
pp. 449–460,
doi:10.1007/978-3-540-77050-3_37.
S.Schewe (2008):
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games..
In: CSL'08,
LNCS 5213.
Springer,
pp. 369–384,
doi:10.1007/978-3-540-87531-4_27.
J.Vöge & M.Jurdziński (2000):
A Discrete Strategy Improvement Algorithm for Solving Parity Games..
In: CAV'00,
LNCS 1855.
Springer,
pp. 202–215,
doi:10.1007/10722167_18.
W.Zielonka (1998):
Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees..
TCS 200(1-2),
pp. 135–183,
doi:10.1016/S0304-3975(98)00009-7.
U.Zwick & M.Paterson (1996):
The Complexity of Mean Payoff Games on Graphs..
TCS 158(1-2),
pp. 343–359,
doi:10.1016/0304-3975(95)00188-3.