@InProceedings{chatterjee_et_al:LIPIcs.CONCUR.2019.7,
author = {Chatterjee, Krishnendu and Dvo\v{r}\'{a}k, Wolfgang and Henzinger, Monika and Svozil, Alexander},
title = {{Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {7:1--7:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.7},
URN = {urn:nbn:de:0030-drops-109093},
doi = {10.4230/LIPIcs.CONCUR.2019.7},
annote = {Keywords: model checking, graph games, Streett games}
}