Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs

Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil. Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs. In Wan Fokkink, Rob van Glabbeek, editors, 30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands. Volume 140 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. [doi]

@inproceedings{ChatterjeeDHS19,
  title = {Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs},
  author = {Krishnendu Chatterjee and Wolfgang Dvorák and Monika Henzinger and Alexander Svozil},
  year = {2019},
  doi = {10.4230/LIPIcs.CONCUR.2019.7},
  url = {https://doi.org/10.4230/LIPIcs.CONCUR.2019.7},
  researchr = {https://researchr.org/publication/ChatterjeeDHS19},
  cites = {0},
  citedby = {0},
  booktitle = {30th International Conference on Concurrency Theory, CONCUR 2019, August 27-30, 2019, Amsterdam, the Netherlands},
  editor = {Wan Fokkink and Rob van Glabbeek},
  volume = {140},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-121-4},
}