{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,20]],"date-time":"2026-10-20T16:51:08Z","timestamp":1792515068145,"version":"4.5.0"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/lics.2017.8005092","type":"proceedings-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T16:43:24Z","timestamp":1502383404000},"page":"1-9","source":"Crossref","is-referenced-by-count":33,"title":["Succinct progress measures for solving parity games"],"prefix":"10.1109","author":[{"given":"Marcin","family":"Jurdzi\u0144ski","sequence":"first","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":"263","reference":[{"key":"ref10","author":"gimbert","year":"2017","journal-title":"A short proof of correctness of the quasi-polynomial time algorithm for parity games"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-68804-8_3"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1240233.1240247"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46541-3_24"},{"key":"ref14","author":"jurdzinski","year":"2017","journal-title":"Succinct progress measures for solving parity games"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/070686652"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185391"},{"key":"ref17","first-page":"351","article-title":"The limit view of infinite computations","author":"klarlund","year":"1994","journal-title":"CONCUR"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(94)90086-8"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.4086\/cjtcs.1995.003"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055409"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.4086\/cjtcs.1996.001"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00228-9"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185392"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.34"},{"key":"ref8","first-page":"267","article-title":"Efficient model checking in fragments of the propositional mu-calculus (Extended abstract)","author":"emerson","year":"1986","journal-title":"LICS"},{"key":"ref7","first-page":"385","article-title":"On model-checking for fragments of ?-calculus","author":"emerson","year":"1993","journal-title":"CAV"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2002013"},{"key":"ref9","author":"fearnley","year":"2017","journal-title":"An ordered approach to solving parity games in quasi polynomial time and quasi linear space"},{"key":"ref1","author":"ash","year":"1990","journal-title":"Information Theory"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276748"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-16066-3_15"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49529-2_47"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2006.23"},{"key":"ref23","article-title":"Games with forbidden positions","author":"mostowski","year":"1991","journal-title":"Technical Report 78-1"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(96)00130-5"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77050-3_37"}],"event":{"name":"2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Reykjavik, Iceland","start":{"date-parts":[[2017,6,20]]},"end":{"date-parts":[[2017,6,23]]}},"container-title":["2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999337\/8005055\/08005092.pdf?arnumber=8005092","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T17:53:53Z","timestamp":1755021233000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8005092\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/lics.2017.8005092","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}