{"doi":"10.1007/978-3-642-39799-8_36","quality_controlled":"1","alternative_title":["LNCS"],"_id":"2444","year":"2013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Ła̧Cki, Jakub","last_name":"Ła̧Cki","first_name":"Jakub"}],"external_id":{"arxiv":["1304.0084"]},"date_updated":"2020-08-11T10:09:47Z","series_title":"Lecture Notes in Computer Science","status":"public","scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1304.0084"}],"volume":8044,"citation":{"ieee":"K. Chatterjee and J. Ła̧Cki, “Faster algorithms for Markov decision processes with low treewidth,” vol. 8044. Springer, pp. 543–558, 2013.","short":"K. Chatterjee, J. Ła̧Cki, 8044 (2013) 543–558.","apa":"Chatterjee, K., &#38; Ła̧Cki, J. (2013). Faster algorithms for Markov decision processes with low treewidth. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_36\">https://doi.org/10.1007/978-3-642-39799-8_36</a>","ama":"Chatterjee K, Ła̧Cki J. Faster algorithms for Markov decision processes with low treewidth. 2013;8044:543-558. doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_36\">10.1007/978-3-642-39799-8_36</a>","chicago":"Chatterjee, Krishnendu, and Jakub Ła̧Cki. “Faster Algorithms for Markov Decision Processes with Low Treewidth.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_36\">https://doi.org/10.1007/978-3-642-39799-8_36</a>.","mla":"Chatterjee, Krishnendu, and Jakub Ła̧Cki. <i>Faster Algorithms for Markov Decision Processes with Low Treewidth</i>. Vol. 8044, Springer, 2013, pp. 543–58, doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_36\">10.1007/978-3-642-39799-8_36</a>.","ista":"Chatterjee K, Ła̧Cki J. 2013. Faster algorithms for Markov decision processes with low treewidth. 8044, 543–558."},"month":"07","publication_status":"published","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"intvolume":"      8044","page":"543 - 558","day":"01","title":"Faster algorithms for Markov decision processes with low treewidth","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:57:42Z","abstract":[{"text":"We consider two core algorithmic problems for probabilistic verification: the maximal end-component decomposition and the almost-sure reachability set computation for Markov decision processes (MDPs). For MDPs with treewidth k, we present two improved static algorithms for both the problems that run in time O(n·k 2.38·2k ) and O(m·logn· k), respectively, where n is the number of states and m is the number of edges, significantly improving the previous known O(n·k·√n· k) bound for low treewidth. We also present decremental algorithms for both problems for MDPs with constant treewidth that run in amortized logarithmic time, which is a huge improvement over the previously known algorithms that require amortized linear time.","lang":"eng"}],"ec_funded":1,"oa":1,"date_published":"2013-07-01T00:00:00Z","oa_version":"Preprint","conference":{"start_date":"2013-07-13","end_date":"2013-07-19","location":"St. Petersburg, Russia","name":"CAV: Computer Aided Verification"},"department":[{"_id":"KrCh"}],"publisher":"Springer","publist_id":"4459","type":"conference"}