Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/concur/ChatterjeeDHS19
%A Chatterjee, Krishnendu
%A Dvorák, Wolfgang
%A Henzinger, Monika
%A Svozil, Alexander
%B CONCUR
%D 2019
%E Fokkink, Wan J.
%E van Glabbeek, Rob
%I Schloss Dagstuhl - Leibniz-Zentrum für Informatik
%K dblp
%P 7:1-7:16
%T Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.
%U http://dblp.uni-trier.de/db/conf/concur/concur2019.html#ChatterjeeDHS19
%V 140
%@ 978-3-95977-121-4
@inproceedings{conf/concur/ChatterjeeDHS19,
added-at = {2022-01-03T00:00:00.000+0100},
author = {Chatterjee, Krishnendu and Dvorák, Wolfgang and Henzinger, Monika and Svozil, Alexander},
biburl = {https://www.bibsonomy.org/bibtex/2ebe7d5fdfedeb41bb778dbe8554ccbba/dblp},
booktitle = {CONCUR},
crossref = {conf/concur/2019},
editor = {Fokkink, Wan J. and van Glabbeek, Rob},
ee = {https://doi.org/10.4230/LIPIcs.CONCUR.2019.7},
interhash = {0c8e967f3ebc2475f896009538b92a01},
intrahash = {ebe7d5fdfedeb41bb778dbe8554ccbba},
isbn = {978-3-95977-121-4},
keywords = {dblp},
pages = {7:1-7:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
series = {LIPIcs},
timestamp = {2024-04-10T13:06:20.000+0200},
title = {Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.},
url = {http://dblp.uni-trier.de/db/conf/concur/concur2019.html#ChatterjeeDHS19},
volume = 140,
year = 2019
}
