1. H. Björklund, S. Sandberg, S. Vorobyov, A discrete subexponential algorithm for parity games, in: H. Alt, M. Habib (Eds.), 20th Internat. Symp. on Theoretical Aspects of Computer Science, STACS’2003, Lecture Notes in Computer Science, Vol. 2607, Springer, Berlin, 2003, pp. 663–674. Full preliminary version: TR-2002-026, Department of Information Technology, Uppsala University, September 2002.
2. Positional games over a graph;Ehrenfeucht;Notices Amer. Math Soc.,1973
3. Positional strategies for mean payoff games;Ehrenfeucht;Internat. J. Game Theory,1979
4. Automata, tableaux, and temporal logics;Emerson,1985
5. E.A. Emerson, C.S. Jutla, Tree automata, μ-calculus and determinacy, in: Ann. IEEE Symp. on Foundations of Computer Science, 1991, pp. 368–377.