{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T12:09:56Z","timestamp":1790251796209,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T00:00:00Z","timestamp":1531094400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/P020992\/1"],"award-info":[{"award-number":["EP\/P020992\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,9]]},"DOI":"10.1145\/3209108.3209162","type":"proceedings-article","created":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T08:14:43Z","timestamp":1530087283000},"page":"325-334","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["A pseudo-quasi-polynomial algorithm for mean-payoff parity games"],"prefix":"10.1145","author":[{"given":"Laure","family":"Daviaud","sequence":"first","affiliation":[{"name":"DIMAP, Department of Computer Science, University of Warwick, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Jurdzi\u0144ski","sequence":"additional","affiliation":[{"name":"DIMAP, Department of Computer Science, University of Warwick, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ranko","family":"Lazi\u0107","sequence":"additional","affiliation":[{"name":"DIMAP, Department of Computer Science, University of Warwick, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","unstructured":"P. Bouyer N. Markey J. Olschewski and M. Ummels. 2011. Measuring permissiveness in parity games: Mean-payoff parity games revisited. In ATVA. 135--149.","DOI":"10.5555\/2050917.2050930"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-010-0105-x"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","unstructured":"C. S. Calude S. Jain B. Khoussainov W. Li and F. Stephan. 2017. Deciding parity games in quasipolynomial time. In STOC. 252--263. 10.1145\/3055399.3055409","DOI":"10.1145\/3055399.3055409"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.07.038"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"K. Chatterjee L. Doyen H. Gimbert and Y. Oualhadj. 2014. Perfect-information stochastic mean-payoff parity games. In FOSSACS. 210--225.","DOI":"10.1007\/978-3-642-54830-7_14"},{"key":"e_1_3_2_1_6_1","first-page":"1","article-title":"Faster algorithms for mean-payoff parity games","volume":"39","author":"Chatterjee K.","year":"2017","unstructured":"K. Chatterjee, M. Henzinger, and A. Svozil. 2017. Faster algorithms for mean-payoff parity games. In MFCS. 39:1--39:17.","journal-title":"MFCS."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","unstructured":"K. Chatterjee T. A. Henzinger and M. Jurdzi\u0144ski. 2005. Mean-payoff parity games. In LICS. 178--187. 10.1109\/LICS.2005.26","DOI":"10.1109\/LICS.2005.26"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0123-1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90048-K"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"L. Daviaud M. Jurdzi\u0144ski and M. Lazi\u0107. 2018. A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games. arXiv:1803.04756. (2018).","DOI":"10.1145\/3209108.3209162"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01768705"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","unstructured":"E. A. Emerson and C. Jutla. 1991. Tree automata mu-calculus and determinacy. In FOCS. 368--377. 10.1109\/SFCS.1991.185392","DOI":"10.1109\/SFCS.1991.185392"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00034-7"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","unstructured":"J. Fearnley S. Jain S. Schewe F. Stephan and D. Wojtczak. 2017. An ordered approach to solving parity games in quasi polynomial time and quasi linear space. In SPIN. 112--121. 10.1145\/3092282.3092286","DOI":"10.1145\/3092282.3092286"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"N. Fijalkow and M. Zimmermann. 2014. Parity and Streett games with costs. Logical Methods in Computer Science 10 1:14(2014) 1--29.","DOI":"10.2168\/LMCS-10(2:14)2014"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","unstructured":"Y. Gurevich and L. Harrington. 1982. Trees automata and games. In STOC. 60--65. 10.1145\/800070.802177","DOI":"10.1145\/800070.802177"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1240233.1240247"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","unstructured":"M. Jurdzi\u0144ski. 2000. Small progress measures for solving parity games. In STACS. 290--301.","DOI":"10.5555\/646514.695804"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"M. Jurdzi\u0144ski and R. Lazi\u0107. 2017. Succinct progress measures for solving parity games. In LICS. 1--9.","DOI":"10.1109\/LICS.2017.8005092"},{"key":"e_1_3_2_1_20_1","unstructured":"N. Klarlund and D. Kozen. 1995. Rabin measures. Chicago Journal of Theoretical Computer Science (1995). Article 3."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(93)90036-D"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"S. Schewe A. Weinert and M. Ziemmermann. 2018. Parity games with weights. arXiv:1804.06168.(2018).","DOI":"10.23638\/LMCS-15(3:20)2019"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"W. Thomas. 1995. On the synthesis of strategies in infinite games. In STACS. 1--13.","DOI":"10.1007\/3-540-59042-0_57"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00009-7"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00188-3"}],"event":{"name":"LICS '18: 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science","location":"Oxford United Kingdom","acronym":"LICS '18","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","IEEE-CS\\DATC IEEE Computer Society","EACSL European Association for Computer Science Logic"]},"container-title":["Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209162","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3209108.3209162","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T07:30:09Z","timestamp":1781854209000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209162"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,9]]},"references-count":25,"alternative-id":["10.1145\/3209108.3209162","10.1145\/3209108"],"URL":"https:\/\/doi.org\/10.1145\/3209108.3209162","relation":{},"subject":[],"published":{"date-parts":[[2018,7,9]]},"assertion":[{"value":"2018-07-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}