{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:26:14Z","timestamp":1750220774382,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"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":[[2020,7,6]]},"DOI":"10.1145\/3350755.3400263","type":"proceedings-article","created":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T15:56:12Z","timestamp":1594310172000},"page":"515-517","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up"],"prefix":"10.1145","author":[{"given":"Jannik","family":"Castenow","sequence":"first","affiliation":[{"name":"Heinz Nixdorf Institute & Paderborn University, Paderborn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Kling","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Hamburg, Hamburg , Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Till","family":"Knollmann","sequence":"additional","affiliation":[{"name":"Heinz Nixdorf Institute & Paderborn University, Paderborn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedhelm","family":"Meyer Auf der Heide","sequence":"additional","affiliation":[{"name":"Heinz Nixdorf Institute & Paderborn University, Paderborn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2742341"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05434-1_23"},{"key":"e_1_3_2_1_3_1","volume-title":"IFIP 19th World Computer Congress, TC 10:  1st IFIP International Conference on Biologically Inspired Computing, August21--24","author":"Dynia Miroslaw","year":"2006","unstructured":"Miroslaw Dynia , Jaroslaw Kutylowski , Pawel Lorek , and Friedhelm Meyer auf derHeide. 2006. Maintaining Communication Between an Explorer and a Base Station. In Biologically Inspired Cooperative Computing , IFIP 19th World Computer Congress, TC 10: 1st IFIP International Conference on Biologically Inspired Computing, August21--24 , 2006 , Santiago, Chile. Springer, 137--146. https:\/\/doi.org\/10.1007\/978-0--387--34733--2_14 10.1007\/978-0--387--34733--2_14 Miroslaw Dynia, Jaroslaw Kutylowski, Pawel Lorek, and Friedhelm Meyer auf derHeide. 2006. Maintaining Communication Between an Explorer and a Base Station. In Biologically Inspired Cooperative Computing, IFIP 19th World Computer Congress, TC 10: 1st IFIP International Conference on Biologically Inspired Computing, August21--24, 2006, Santiago, Chile. Springer, 137--146. https:\/\/doi.org\/10.1007\/978-0--387--34733--2_14"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-11072-7"},{"volume-title":"4th International Workshop, ANTS 2004, Brussels, Belgium,September 5 - 8, 2004, Proceedings. Springer, 142--153","author":"Gordon Noam","key":"e_1_3_2_1_5_1","unstructured":"Noam Gordon , Israel A. Wagner , and Alfred M. Bruckstein . 2004. Gathering Multiple Robotic A(ge)nts with Limited Sensing Capabilities. In Ant Colony Optimization and Swarm Intelligence , 4th International Workshop, ANTS 2004, Brussels, Belgium,September 5 - 8, 2004, Proceedings. Springer, 142--153 . https:\/\/doi.org\/10.1007\/978--3--540--28646--2_13 10.1007\/978--3--540--28646--2_13 Noam Gordon, Israel A. Wagner, and Alfred M. Bruckstein. 2004. Gathering Multiple Robotic A(ge)nts with Limited Sensing Capabilities. In Ant Colony Optimization and Swarm Intelligence, 4th International Workshop, ANTS 2004, Brussels, Belgium,September 5 - 8, 2004, Proceedings. Springer, 142--153. https:\/\/doi.org\/10.1007\/978--3--540--28646--2_13"},{"key":"e_1_3_2_1_6_1","volume-title":"SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4--6, 2011 (Co-located with FCRC 2011). ACM, 159--166","author":"Kling Peter","year":"1989","unstructured":"Peter Kling and Friedhelm Meyer auf der Heide. 2011. Convergence of local communication chain strategies via linear transformations: or how to trade locality for speed . In SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4--6, 2011 (Co-located with FCRC 2011). ACM, 159--166 . https:\/\/doi.org\/10.1145\/ 1989 493.1989517 10.1145\/1989493.1989517 Peter Kling and Friedhelm Meyer auf der Heide. 2011. Convergence of local communication chain strategies via linear transformations: or how to trade locality for speed. In SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4--6, 2011 (Co-located with FCRC 2011). ACM, 159--166. https:\/\/doi.org\/10.1145\/1989493.1989517"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.04.010"},{"key":"e_1_3_2_1_8_1","volume-title":"SSS 2017, Boston, MA, USA, November 5--8, 2017, Proceedings (Lecture Notes in Computer Science), Paul G. Spirakis and Philippas Tsigas (Eds.)","volume":"10616","author":"Poudel Pavan","year":"2017","unstructured":"Pavan Poudel and Gokarna Sharma . 2017 . Universally Optimal Gathering Under Limited Visibility. In Stabilization, Safety, and Security of Distributed Systems -19th International Symposium , SSS 2017, Boston, MA, USA, November 5--8, 2017, Proceedings (Lecture Notes in Computer Science), Paul G. Spirakis and Philippas Tsigas (Eds.) , Vol. 10616 . Springer, 323--340. https:\/\/doi.org\/10.1007\/978--3--319--69084--1_23 10.1007\/978--3--319--69084--1_23 Pavan Poudel and Gokarna Sharma. 2017. Universally Optimal Gathering Under Limited Visibility. In Stabilization, Safety, and Security of Distributed Systems -19th International Symposium, SSS 2017, Boston, MA, USA, November 5--8, 2017, Proceedings (Lecture Notes in Computer Science), Paul G. Spirakis and Philippas Tsigas (Eds.), Vol. 10616. Springer, 323--340. https:\/\/doi.org\/10.1007\/978--3--319--69084--1_23"}],"event":{"name":"SPAA '20: 32nd 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","EATCS European Association for Theoretical Computer Science"],"location":"Virtual Event USA","acronym":"SPAA '20"},"container-title":["Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400263","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3350755.3400263","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:21Z","timestamp":1750200081000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,6]]},"references-count":8,"alternative-id":["10.1145\/3350755.3400263","10.1145\/3350755"],"URL":"https:\/\/doi.org\/10.1145\/3350755.3400263","relation":{},"subject":[],"published":{"date-parts":[[2020,7,6]]},"assertion":[{"value":"2020-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}