{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:18Z","timestamp":1750220658850,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T00:00:00Z","timestamp":1594166400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["683080"],"award-info":[{"award-number":["683080"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2016\/21\/D\/ST6\/00491, 2016\/21\/D\/ST6\/01485"],"award-info":[{"award-number":["2016\/21\/D\/ST6\/00491, 2016\/21\/D\/ST6\/01485"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,8]]},"DOI":"10.1145\/3373718.3394782","type":"proceedings-article","created":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:23:18Z","timestamp":1590452598000},"page":"384-396","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Uniformisations of Regular Relations Over Bi-Infinite Words"],"prefix":"10.1145","author":[{"given":"Grzegorz","family":"Fabia\u0144ski","sequence":"first","affiliation":[{"name":"Institute of Informatics, University of Warsaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Skrzypczak","sequence":"additional","affiliation":[{"name":"Institute of Informatics, University of Warsaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Szymon","family":"Toru\u0144czyk","sequence":"additional","affiliation":[{"name":"Institute of Informatics, University of Warsaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"81","article-title":"Unambiguity and uniformization problems on infinite trees","volume":"23","author":"Bilkowski Marcin","year":"2013","journal-title":"CSL (LIPIcs)"},{"volume-title":"Proc. 1960 Int. Congr. for Logic, Methodology and Philosophy of Science. 1--11","year":"1962","author":"B\u00fcchi Julius Richard","key":"e_1_3_2_1_2_1"},{"key":"e_1_3_2_1_3_1","first-page":"662","article-title":"Choice functions and well-orderings over the infinite binary tree","volume":"8","author":"Carayol Arnaud","year":"2010","journal-title":"Central European Journal of Mathematics"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.2307\/2273673"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.2307\/2586591"},{"volume-title":"Infinite Words: Automata, Semigroups, Logic and Games","year":"2004","author":"Perrin Dominique","key":"e_1_3_2_1_6_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1016\/j.ic.2006.12.004"},{"doi-asserted-by":"crossref","unstructured":"Alexander Rabinovich and Amit Shomrat. 2008. Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey. In Pillars of Computer Science. 571--588.  Alexander Rabinovich and Amit Shomrat. 2008. Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey. In Pillars of Computer Science. 571--588.","key":"e_1_3_2_1_8_1","DOI":"10.1007\/978-3-540-78127-1_31"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.2178\/jsl\/1230396747"},{"volume-title":"Handbook of Formal Languages","author":"Thomas Wolfgang","key":"e_1_3_2_1_10_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1142\/S0218196793000287"}],"event":{"sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"],"acronym":"LICS '20","name":"LICS '20: 35th Annual ACM\/IEEE Symposium on Logic in Computer Science","location":"Saarbr\u00fccken Germany"},"container-title":["Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394782","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3373718.3394782","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:35Z","timestamp":1750197755000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394782"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,8]]},"references-count":11,"alternative-id":["10.1145\/3373718.3394782","10.1145\/3373718"],"URL":"https:\/\/doi.org\/10.1145\/3373718.3394782","relation":{},"subject":[],"published":{"date-parts":[[2020,7,8]]},"assertion":[{"value":"2020-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}