{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:57Z","timestamp":1750307037828,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,3,18]],"date-time":"2013-03-18T00:00:00Z","timestamp":1363564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004359","name":"Vetenskapsr\u00e4det","doi-asserted-by":"publisher","award":["621-2011-6080"],"award-info":[{"award-number":["621-2011-6080"]}],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["FP7-ICT-233599"],"award-info":[{"award-number":["FP7-ICT-233599"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,3,18]]},"DOI":"10.1145\/2448496.2448510","type":"proceedings-article","created":{"date-parts":[[2013,3,19]],"date-time":"2013-03-19T13:34:53Z","timestamp":1363700093000},"page":"105-116","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["On optimum left-to-right strategies for active context-free games"],"prefix":"10.1145","author":[{"given":"Henrik","family":"Bj\u00f6rklund","sequence":"first","affiliation":[{"name":"Ume\u00e5 University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Schuster","sequence":"additional","affiliation":[{"name":"TU Dortmund"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Schwentick","sequence":"additional","affiliation":[{"name":"TU Dortmund"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joscha","family":"Kulbatzki","sequence":"additional","affiliation":[{"name":"SCISYS Deutschland GmbH"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,3,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872821"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065204"},{"key":"e_1_3_2_1_3_1","unstructured":"ActiveXML. http:\/\/www-rocq.inria.fr\/verso\/Gemo\/Projects\/axml.  ActiveXML. http:\/\/www-rocq.inria.fr\/verso\/Gemo\/Projects\/axml."},{"key":"e_1_3_2_1_4_1","volume-title":"December","author":"Bj\u00f6rklund H.","year":"2012","unstructured":"H. Bj\u00f6rklund , M. Schuster , T. Schwentick , and J. Kulbatzki . On optimum left-to-right strategies for active context-free games , December 2012 . Available online at http:\/\/arxiv.org\/abs\/1212.3501. H. Bj\u00f6rklund, M. Schuster, T. Schwentick, and J. Kulbatzki. On optimum left-to-right strategies for active context-free games, December 2012. Available online at http:\/\/arxiv.org\/abs\/1212.3501."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(86)90036-X"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36387-4"},{"key":"e_1_3_2_1_7_1","volume-title":"Technische Universit\u00e4t Dortmund","author":"Kulbatzki J.","year":"2010","unstructured":"J. Kulbatzki . Active XML und Untersuchungen perfekter Rewriting-Strategien f\u00fcr kontexfreie Spiele auf Strings. Master's thesis , Technische Universit\u00e4t Dortmund , 2010 . J. Kulbatzki. Active XML und Untersuchungen perfekter Rewriting-Strategien f\u00fcr kontexfreie Spiele auf Strings. Master's thesis, Technische Universit\u00e4t Dortmund, 2010."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1061318.1061319"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-005-1278-3"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(70)80006-X"},{"key":"e_1_3_2_1_11_1","series-title":"Lec","first-page":"331","volume-title":"Complexity, Logic and Recursion","author":"van Emde Boas P.","year":"1997","unstructured":"P. van Emde Boas . The convenience of tilings . In Complexity, Logic and Recursion , volume 187 of Lec . Notes in Pure and App. Math., pages 331 -- 363 . Routledge , 1997 . P. van Emde Boas. The convenience of tilings. In Complexity, Logic and Recursion, volume 187 of Lec. Notes in Pure and App. Math., pages 331--363. Routledge, 1997."}],"event":{"name":"EDBT\/ICDT '13: Joint 2013 EDBT\/ICDT Conferences","acronym":"EDBT\/ICDT '13","location":"Genoa Italy"},"container-title":["Proceedings of the 16th International Conference on Database Theory"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2448496.2448510","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2448496.2448510","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:51Z","timestamp":1750238451000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2448496.2448510"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,18]]},"references-count":11,"alternative-id":["10.1145\/2448496.2448510","10.1145\/2448496"],"URL":"https:\/\/doi.org\/10.1145\/2448496.2448510","relation":{},"subject":[],"published":{"date-parts":[[2013,3,18]]},"assertion":[{"value":"2013-03-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}