[{"acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification, Vienna Science and Technology Fund (WWTF) Grant ICT10-002, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","publisher":"SIAM","quality_controlled":"1","status":"public","pubrep_id":"15","oa_version":"None","department":[{"_id":"KrCh"}],"date_created":"2018-12-11T12:01:46Z","type":"conference","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"date_published":"2012-01-01T00:00:00Z","day":"01","conference":{"location":"Kyoto, Japan","start_date":"2012-01-17","end_date":"2012-01-19","name":"SODA: Symposium on Discrete Algorithms"},"page":"1386 - 1399","_id":"3165","doi":"10.1137/1.9781611973099.109","title":"An O(n2) time algorithm for alternating Büchi games","publication":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms","date_updated":"2021-01-12T08:01:32Z","language":[{"iso":"eng"}],"year":"2012","citation":{"short":"K. Chatterjee, M. Henzinger, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2012, pp. 1386–1399.","apa":"Chatterjee, K., & Henzinger, M. (2012). An O(n2) time algorithm for alternating Büchi games. In *Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms* (pp. 1386–1399). Kyoto, Japan: SIAM. https://doi.org/10.1137/1.9781611973099.109","ieee":"K. Chatterjee and M. Henzinger, “An O(n2) time algorithm for alternating Büchi games,” in *Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms*, Kyoto, Japan, 2012, pp. 1386–1399.","ista":"Chatterjee K, Henzinger M. 2012. An O(n2) time algorithm for alternating Büchi games. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1386–1399.","ama":"Chatterjee K, Henzinger M. An O(n2) time algorithm for alternating Büchi games. In: *Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms*. SIAM; 2012:1386-1399. doi:10.1137/1.9781611973099.109","chicago":"Chatterjee, Krishnendu, and Monika Henzinger. “An O(N2) Time Algorithm for Alternating Büchi Games.” In *Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms*, 1386–99. SIAM, 2012. https://doi.org/10.1137/1.9781611973099.109.","mla":"Chatterjee, Krishnendu, and Monika Henzinger. “An O(N2) Time Algorithm for Alternating Büchi Games.” *Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms*, SIAM, 2012, pp. 1386–99, doi:10.1137/1.9781611973099.109."},"abstract":[{"text":"Computing the winning set for Büchi objectives in alternating games on graphs is a central problem in computer aided verification with a large number of applications. The long standing best known upper bound for solving the problem is Õ(n·m), where n is the number of vertices and m is the number of edges in the graph. We are the first to break the Õ(n·m) boundary by presenting a new technique that reduces the running time to O(n 2). This bound also leads to O(n 2) time algorithms for computing the set of almost-sure winning vertices for Büchi objectives (1) in alternating games with probabilistic transitions (improving an earlier bound of Õ(n·m)), (2) in concurrent graph games with constant actions (improving an earlier bound of O(n 3)), and (3) in Markov decision processes (improving for m > n 4/3 an earlier bound of O(min(m 1.5, m·n 2/3)). We also show that the same technique can be used to compute the maximal end-component decomposition of a graph in time O(n 2), which is an improvement over earlier bounds for m > n 4/3. Finally, we show how to maintain the winning set for Büchi objectives in alternating games under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per operation. This is the first dynamic algorithm for this problem.","lang":"eng"}],"publist_id":"3519","publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"later_version","status":"public","id":"2141"},{"status":"public","id":"5379","relation":"earlier_version"}]},"month":"01","ec_funded":1,"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"first_name":"Monika","full_name":"Henzinger, Monika","last_name":"Henzinger"}]}]