{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:39Z","timestamp":1759638579293,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T00:00:00Z","timestamp":1468195200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,11]]},"DOI":"10.1145\/2935764.2935789","type":"proceedings-article","created":{"date-parts":[[2016,7,8]],"date-time":"2016-07-08T15:03:00Z","timestamp":1467990180000},"page":"301-312","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Asymptotically Optimal Gathering on a Grid"],"prefix":"10.1145","author":[{"given":"Andreas","family":"Cord-Landwehr","sequence":"first","affiliation":[{"name":"Paderborn University, Paderborn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Fischer","sequence":"additional","affiliation":[{"name":"Paderborn University, Paderborn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Jung","sequence":"additional","affiliation":[{"name":"Paderborn University, Paderborn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"additional","affiliation":[{"name":"Paderborn University, Paderborn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"S. Absho A. Cord-Landwehr M. Fischer D. Jung and F. Meyer auf der Heide. Gathering a closed chain of robots on a grid. CoRR abs\/1510.05454 2015.  S. Absho A. Cord-Landwehr M. Fischer D. Jung and F. Meyer auf der Heide. Gathering a closed chain of robots on a grid. CoRR abs\/1510.05454 2015."},{"volume-title":"IPDPS '16","author":"Absho S.","key":"e_1_3_2_1_2_1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIC.1995.525098"},{"key":"e_1_3_2_1_4_1","first-page":"1181","volume-title":"Solving the Robots Gathering Problem. In ICALP '03","author":"Cieliebak M.","year":"2003"},{"key":"e_1_3_2_1_5_1","series-title":"LNCS","first-page":"79","volume-title":"SIROCCO '04","author":"Cohen R.","year":"2004"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989515"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810523"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/3118736.3118835"},{"key":"e_1_3_2_1_9_1","first-page":"213","volume":"8179","author":"Di Stefano G.","year":"2013","journal-title":"Optimal Gathering of Oblivious Robots in Anonymous Graphs. LNCS"},{"key":"e_1_3_2_1_10_1","first-page":"211","volume-title":"SSS '14","author":"Di Stefano G.","year":"2014"},{"key":"e_1_3_2_1_11_1","first-page":"137","volume-title":"IFIP TC10","author":"Dynia M.","year":"2006"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31104-8_28"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2423886"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/100797916"},{"key":"e_1_3_2_1_15_1","series-title":"LNCS","first-page":"274","volume-title":"SIROCCO '07","author":"Katayama Y.","year":"2007"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.09.032"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.04.010"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2009.05.013"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.04.023"}],"event":{"name":"SPAA '16: 28th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Pacific Grove California USA","acronym":"SPAA '16"},"container-title":["Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2935764.2935789","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2935764.2935789","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:39:57Z","timestamp":1750217997000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2935764.2935789"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,11]]},"references-count":19,"alternative-id":["10.1145\/2935764.2935789","10.1145\/2935764"],"URL":"https:\/\/doi.org\/10.1145\/2935764.2935789","relation":{},"subject":[],"published":{"date-parts":[[2016,7,11]]},"assertion":[{"value":"2016-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}