@article{Etessami:2018aa,
    Author = {Etessami, Kousha and Stewart, Alistair and Yannakakis, Mihalis},
    BookTitle = {ICALP 2015},
    File = {1-s2.0-S0890540118300166-main (0) (0) (0) - a - a - p.pdf},
    ISBN = {0890-5401},
    Journal = {Information and Computation},
    Pages = {355--382},
    Title = {Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes},
    URL = {http://www.sciencedirect.com/science/article/pii/S0890540118300166},
    Volume = {261},
    Year = {2018},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0890540118300166},
    bdsk-url-2 = {https://doi.org/10.1016/j.ic.2018.02.013},
    da = {2018/08/01/},
    date-added = {2018-10-02 13:03:19 +0000},
    date-modified = {2018-10-02 13:03:19 +0000},
    ty = {JOUR},
    doi = {10.1016/j.ic.2018.02.013}
}

@article{Etessami:2018aa, Author = {Etessami, Kousha and Stewart, Alistair and Yannakakis, Mihalis}, BookTitle = {ICALP 2015}, File = {1-s2.0-S0890540118300166-main (0) (0) (0) - a - a - p.pdf}, ISBN = {0890-5401}, Journal = {Information and Computation}, Pages = {355--382}, Title = {Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes}, URL = {http://www.sciencedirect.com/science/article/pii/S0890540118300166}, Volume = {261}, Year = {2018}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0890540118300166}, bdsk-url-2 = {https://doi.org/10.1016/j.ic.2018.02.013}, da = {2018/08/01/}, date-added = {2018-10-02 13:03:19 +0000}, date-modified = {2018-10-02 13:03:19 +0000}, ty = {JOUR}, doi = {10.1016/j.ic.2018.02.013} }