Dietmar Berwanger, Anuj Dawar, Paul Hunter & Stephan Kreutzer (2006):
DAG-Width and Parity Games.
In: STACS 2006, Proceedings of the 23rd Symposium on Theoretical Aspects of Computer Science,
LNCS 3884.
Springer-Verlag,
pp. 524–436,
doi:10.1007/11672142_43.
Olivier Carton & Ramón Maceiras (1999):
Computing the Rabin Index of a Parity Automaton.
ITA 33(6),
pp. 495–506.
E.A. Emerson & C. Jutla (1991):
Tree Automata, μ-Calculus and Determinacy.
In: Proc. 32nd IEEE Symp. on Foundations of Computer Science,
pp. 368–377,
doi:10.1109/SFCS.1991.185392.
Shimon Even, Alon Itai & Adi Shamir (1976):
On the Complexity of Timetable and Multicommodity Flow Problems.
SIAM J. Comput. 5(4),
pp. 691–703,
doi:10.1109/SFCS.1975.21.
Steven Fortune, John Hofcroft & James Wyllie (1980):
The Directed Subgraph Homeomorphism Problem.
Theoretical Computer Science 10,
pp. 111–121,
doi:10.1016/0304-3975(80)90009-2.
Oliver Friedmann & Martin Lange (2009):
Solving Parity Games in Practice.
In: Zhiming Liu & Anders Ravn: Proc. of Automated Technology for Verification and Analysis,
Lecture Notes in Computer Science 5799.
Springer,
pp. 182–196,
doi:10.1007/978-3-642-04761-9_15.
Oliver Friedmann & Martin Lange (2010):
The PGSolver Collection of Parity Game Solvers.
Technical Report.
Institut für Informatik, LMU Munich.
Version 3.
Marcin Jurdziński (2000):
Small Progress Measures for Solving Parity Games.
In: STACS '00: Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science.
Springer-Verlag,
London, UK,
pp. 290–301,
doi:10.1007/3-540-46541-3_24.
J. Vöge & M. Jurdziński (2000):
A Discrete Strategy Improvement Algorithm for Solving Parity Games.
In: Proc 12th Int. Conf. on Computer Aided Verification,
Lecture Notes in Computer Science 1855.
Springer,
pp. 202–215,
doi:10.1007/10722167_18.
Wieslaw Zielonka (1998):
Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees.
Theoretical Computer Science 200(1Ð2),
pp. 135 – 183,
doi:10.1016/S0304-3975(98)00009-7.
eptcs@eptcs.org