{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T07:53:29Z","timestamp":1781855609467,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":26,"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\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["01IS160253"],"award-info":[{"award-number":["01IS160253"]}],"id":[{"id":"10.13039\/501100002347","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.3209115","type":"proceedings-article","created":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T08:14:43Z","timestamp":1530087283000},"page":"639-648","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["A modal \u03bc perspective on solving parity games in quasi-polynomial time"],"prefix":"10.1145","author":[{"given":"Karoliina","family":"Lehtinen","sequence":"first","affiliation":[{"name":"Kiel University, Kiel, Germany"}],"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","DOI":"10.5555\/1781794.1781838"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.256.9"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11672142_43"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-32275-7_15"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.07.010"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-006-1317-8"},{"key":"e_1_3_2_1_7_1","volume-title":"University of Warsaw. https:\/\/www.mimuw.edu.pl\/~bojan\/papers\/toolbox-reduced-feb6.pdf last checked","author":"Boja\u0144czyk Miko\u0142aj","year":"2018","unstructured":"Miko\u0142aj Boja\u0144czyk and Wojciech Czerwi\u0144ski. 2018. Automata-Toolbox. University of Warsaw. https:\/\/www.mimuw.edu.pl\/~bojan\/papers\/toolbox-reduced-feb6.pdf last checked April 2018."},{"key":"e_1_3_2_1_8_1","volume-title":"Studies in logic and practical reasoning 3","author":"Bradfield Julian","year":"2007","unstructured":"Julian Bradfield and Colin Stirling. 2007. Modal μ-calculi. Studies in logic and practical reasoning 3 (2007), 721--756."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055409"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87531-4_26"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185392"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3092282.3092286"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2009.27"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/2011124"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Moses Ganardi. 2015. Parity Games of Bounded Tree-and Clique-Width.. In FoSSaCS. 390--404.","DOI":"10.1007\/978-3-662-46678-0_25"},{"key":"e_1_3_2_1_16_1","volume-title":"A short proof of correctness of the quasi-polynomial time algorithm for parity games. arXiv preprint arXiv:1702.01953","author":"Gimbert Hugo","year":"2017","unstructured":"Hugo Gimbert and Rasmus Ibsen-Jensen. 2017. A short proof of correctness of the quasi-polynomial time algorithm for parity games. arXiv preprint arXiv:1702.01953 (2017)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1789494.1789512"},{"key":"e_1_3_2_1_18_1","volume-title":"Finite Model Theory and its applications","author":"Gr\u00e4del Erich","unstructured":"Erich Gr\u00e4del, Phokion G Kolaitis, Leonid Libkin, Maarten Marx, Joel Spencer, Moshe Y Vardi, Yde Venema, and Scott Weinstein. 2007. Finite Model Theory and its applications. Springer Science & Business Media."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1283383.1283452"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2015.06.005"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00150-1"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/646514.695804"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005092"},{"key":"e_1_3_2_1_24_1","first-page":"2017","volume-title":"Proceedings of International Symposium on Games, Automata, Logics, and Formal Verification","author":"Lehtinen Karoliina","year":"2017","unstructured":"Karoliina Lehtinen. 2017. The descriptive complexity of modal μ model-checking parity games. Proceedings of International Symposium on Games, Automata, Logics, and Formal Verification, 2017 (2017)."},{"key":"e_1_3_2_1_25_1","volume-title":"Oink: an Implementation and Evaluation of Modern Parity Game Solvers. CoRR abs\/1801.03859","author":"van Dijk Tom","year":"2018","unstructured":"Tom van Dijk. 2018. Oink: an Implementation and Evaluation of Modern Parity Game Solvers. CoRR abs\/1801.03859 (2018). arXiv:1801.03859 http:\/\/arxiv.org\/abs\/1801.03859"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.36045\/bbms\/1102714178"}],"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.3209115","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3209108.3209115","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T07:29:41Z","timestamp":1781854181000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,9]]},"references-count":26,"alternative-id":["10.1145\/3209108.3209115","10.1145\/3209108"],"URL":"https:\/\/doi.org\/10.1145\/3209108.3209115","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"}}]}}