@inproceedings(DBLP:conf/csl/BaierKKW14,
 author       = {C. Baier and J. Klein and S. Kl{\"{u}}ppelholz and S. Wunderlich},
 year         = {2014},
 title        = {Weight monitoring with linear temporal logic: complexity and decidability},
 booktitle    = {Proc. of CSL-LICS},
 publisher    = {{ACM}},
 pages        = {11:1--11:10},
 doi          = {10.1145/2603088.2603162},
)
@article(Beeri80,
 author       = {C. Beeri},
 year         = {1980},
 title        = {On the Membership Problem for Functional and Multivalued Dependencies in Relational Databases},
 journal      = {{ACM} Trans. Database Syst.},
 volume       = {5},
 number       = {3},
 pages        = {241--259},
 doi          = {10.1145/320613.320614},
)
@article(DBLP:journals/corr/BruyereHR16,
 author       = {V. Bruy{\`{e}}re and Q. Hautem and M. Randour},
 year         = {2016},
 title        = {Window parity games: an alternative approach toward parity games with time bounds},
 journal      = {CoRR},
 volume       = {abs/1606.01831},
 url          = {http://arxiv.org/abs/1606.01831},
)
@article(DBLP:journals/jacm/ChandraKS81,
 author       = {A.K. Chandra and D. Kozen and L.J. Stockmeyer},
 year         = {1981},
 title        = {Alternation},
 journal      = {J. ACM},
 volume       = {28},
 number       = {1},
 pages        = {114--133},
 doi          = {10.1145/322234.322243},
)
@article(Chatterjee0RR15,
 author       = {K. Chatterjee and L. Doyen and M. Randour and J.-F. Raskin},
 year         = {2015},
 title        = {Looking at mean-payoff and total-payoff through windows},
 journal      = {Information and Computation},
 volume       = {242},
 pages        = {25--52},
 doi          = {10.1016/j.ic.2015.03.010},
)
@inproceedings(ChatterjeeF13,
 author       = {K. Chatterjee and N. Fijalkow},
 year         = {2013},
 title        = {Infinite-state games with finitary conditions},
 booktitle    = {Proc. of CSL},
 series       = {LIPIcs 23},
 publisher    = {Schloss Dagstuhl - LZI},
 pages        = {181--196},
 doi          = {10.4230/LIPIcs.CSL.2013.181},
)
@article(ChatterjeeH14,
 author       = {K. Chatterjee and M. Henzinger},
 year         = {2014},
 title        = {Efficient and Dynamic Algorithms for Alternating {B}{\"{u}}chi Games and Maximal End-Component Decomposition},
 journal      = {J. {ACM}},
 volume       = {61},
 number       = {3},
 pages        = {15:1--15:40},
 doi          = {10.1145/2597631},
)
@article(ChatterjeeHH09,
 author       = {K. Chatterjee and T.A. Henzinger and F. Horn},
 year         = {2009},
 title        = {Finitary winning in $\omega$-regular games},
 journal      = {{ACM} Trans. Comput. Log.},
 volume       = {11},
 number       = {1},
 doi          = {10.1145/1614431.1614432},
)
@inproceedings(DBLP:conf/fossacs/ChatterjeeHP07,
 author       = {K. Chatterjee and T.A. Henzinger and N. Piterman},
 year         = {2007},
 title        = {Generalized Parity Games},
 booktitle    = {Proc. of FOSSACS},
 series       = {LNCS 4423},
 publisher    = {Springer},
 pages        = {153--167},
 doi          = {10.1007/978-3-540-71389-0\_12},
)
@article(CRR14,
 author       = {K. Chatterjee and M. Randour and J.-F. Raskin},
 year         = {2014},
 title        = {Strategy synthesis for multi-dimensional quantitative objectives},
 journal      = {Acta Informatica},
 volume       = {51},
 number       = {3-4},
 pages        = {129--163},
 doi          = {10.1007/s00236-013-0182-6},
)
@inproceedings(DziembowskiJW97,
 author       = {S. Dziembowski and M. Jurdzinski and I. Walukiewicz},
 year         = {1997},
 title        = {How Much Memory is Needed to Win Infinite Games?},
 booktitle    = {Proc. of LICS},
 publisher    = {{IEEE} Computer Society},
 pages        = {99--110},
 doi          = {10.1109/LICS.1997.614939},
)
@inproceedings(EmersonJ88,
 author       = {E.A. Emerson and C.S. Jutla},
 year         = {1988},
 title        = {The Complexity of Tree Automata and Logics of Programs (Extended Abstract)},
 booktitle    = {Proc. of FOCS},
 pages        = {328--337},
 doi          = {10.1109/SFCS.1988.21949},
)
@inproceedings(EmersonJ91,
 author       = {E.A. Emerson and C.S. Jutla},
 year         = {1991},
 title        = {Tree Automata, Mu-Calculus and Determinacy (Extended Abstract)},
 booktitle    = {Proc. of FOCS},
 publisher    = {{IEEE} Computer Society},
 pages        = {368--377},
 doi          = {10.1109/SFCS.1991.185392},
)
@inproceedings(DBLP:conf/cav/EmersonJS93,
 author       = {E.A. Emerson and C.S. Jutla and A.P. Sistla},
 year         = {1993},
 title        = {On Model-Checking for Fragments of $\mu$-Calculus},
 booktitle    = {Proc. of CAV},
 series       = {LNCS 697},
 publisher    = {Springer},
 pages        = {385--396},
 doi          = {10.1007/3-540-56922-7\_32},
)
@article(FijalkowH13,
 author       = {N. Fijalkow and F. Horn},
 year         = {2010},
 title        = {The surprizing complexity of generalized reachability games},
 journal      = {CoRR},
 volume       = {abs/1010.2420},
 url          = {http://arxiv.org/abs/1010.2420},
)
@article(DBLP:journals/corr/abs-1207-0663,
 author       = {N. Fijalkow and M. Zimmermann},
 year         = {2014},
 title        = {Parity and {S}treett Games with Costs},
 journal      = {LMCS},
 volume       = {10},
 number       = {2},
 doi          = {10.2168/LMCS-10(2:14)2014},
)
@proceedings(2001automata,
 editor       = {E. Gr{\"{a}}del and W. Thomas and T. Wilke},
 year         = {2002},
 title        = {Automata, Logics, and Infinite Games: {A} Guide to Current Research},
 series       = {LNCS 2500},
 publisher    = {Springer},
 doi          = {10.1007/3-540-36387-4},
)
@unpublished(Hor05-GDV,
 author       = {F. Horn},
 year         = {2005},
 title        = {Streett Games on Finite Graphs},
 note         = {In {GDV}'05},
)
@article(Immerman81,
 author       = {N. Immerman},
 year         = {1981},
 title        = {Number of Quantifiers is Better Than Number of Tape Cells},
 journal      = {J. Comput. Syst. Sci.},
 volume       = {22},
 number       = {3},
 pages        = {384--406},
 doi          = {10.1016/0022-0000(81)90039-8},
)
@article(Jurdzinski98,
 author       = {M. Jurdzinski},
 year         = {1998},
 title        = {Deciding the Winner in Parity Games is in {UP} $\cap$ co-{UP}},
 journal      = {Inf. Process. Lett.},
 volume       = {68},
 number       = {3},
 pages        = {119--124},
 doi          = {10.1016/S0020-0190(98)00150-1},
)
@inproceedings(Jurdzinski00,
 author       = {M. Jurdzinski},
 year         = {2000},
 title        = {Small Progress Measures for Solving Parity Games},
 booktitle    = {Proc. of STACS},
 series       = {LNCS 1770},
 publisher    = {Springer},
 pages        = {290--301},
 doi          = {10.1007/3-540-46541-3\_24},
)
@article(DBLP:journals/siamcomp/JurdzinskiPZ08,
 author       = {M. Jurdzinski and M. Paterson and U. Zwick},
 year         = {2008},
 title        = {A Deterministic Subexponential Algorithm for Solving Parity Games},
 journal      = {{SIAM} J. Comput.},
 volume       = {38},
 number       = {4},
 pages        = {1519--1532},
 doi          = {10.1137/070686652},
)
@article(DBLP:journals/fmsd/KupfermanPV09,
 author       = {O. Kupferman and N. Piterman and M.Y. Vardi},
 year         = {2009},
 title        = {From liveness to promptness},
 journal      = {FMSD},
 volume       = {34},
 number       = {2},
 pages        = {83--103},
 doi          = {10.1007/s10703-009-0067-z},
)
@article(Martin75,
 author       = {D.A. Martin},
 year         = {1975},
 title        = {Borel determinacy},
 journal      = {Annals of Mathematics},
 volume       = {102},
 number       = {2},
 pages        = {363--371},
 doi          = {10.2307/1971035},
)
@incollection(randourECCS,
 author       = {M. Randour},
 year         = {2013},
 title        = {Automated Synthesis of Reliable and Efficient Systems Through Game Theory: A Case Study},
 booktitle    = {Proc. of ECCS 2012},
 series       = {Springer Proceedings in Complexity XVII},
 publisher    = {Springer},
 pages        = {731--738},
 doi          = {10.1007/978-3-319-00395-5\_90},
)
@inproceedings(DBLP:conf/fsttcs/Schewe07,
 author       = {S. Schewe},
 year         = {2007},
 title        = {Solving Parity Games in Big Steps},
 booktitle    = {Proc. of FSTTCS},
 series       = {LNCS 4855},
 publisher    = {Springer},
 pages        = {449--460},
 doi          = {10.1007/978-3-540-77050-3\_37},
)
@incollection(Thomas97,
 author       = {W. Thomas},
 year         = {1997},
 title        = {Languages, Automata, and Logic},
 booktitle    = {Handbook of Formal Languages},
 chapter      = {7},
 volume       = {3, Beyond Words},
 publisher    = {Springer},
 pages        = {389--455},
 doi          = {10.1007/978-3-642-59126-6\_7},
)
@inproceedings(WallmeierHT03,
 author       = {N. Wallmeier and P. H{\"{u}}tten and W. Thomas},
 year         = {2003},
 title        = {Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications},
 booktitle    = {Proc. of CIAA},
 series       = {LNCS 2759},
 publisher    = {Springer},
 pages        = {11--22},
 doi          = {10.1007/3-540-45089-0\_3},
)
@inproceedings(Weinert016,
 author       = {A. Weinert and M. Zimmermann},
 year         = {2016},
 title        = {Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs},
 booktitle    = {Proc. of CSL},
 series       = {LIPIcs},
 publisher    = {Schloss Dagstuhl - LZI},
 note         = {To appear},
)
@article(Zielonka98,
 author       = {W. Zielonka},
 year         = {1998},
 title        = {Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees},
 journal      = {Theor. Comput. Sci.},
 volume       = {200},
 number       = {1-2},
 pages        = {135--183},
 doi          = {10.1016/S0304-3975(98)00009-7},
)