{"author":[{"last_name":"Castenow","full_name":"Castenow, Jannik","id":"38705","first_name":"Jannik"},{"first_name":"Peter","last_name":"Kling","full_name":"Kling, Peter"},{"first_name":"Till","id":"39241","last_name":"Knollmann","orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till"},{"first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"status":"public","department":[{"_id":"63"}],"file":[{"date_updated":"2020-07-14T07:56:04Z","date_created":"2020-07-14T07:56:04Z","file_id":"17372","relation":"main_file","content_type":"application/pdf","access_level":"closed","creator":"janniksu","file_size":1078544,"file_name":"3350755.3400263.pdf","success":1}],"publication_status":"published","doi":"10.1145/3350755.3400263","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:10Z","date_created":"2020-07-14T07:53:47Z","has_accepted_license":"1","type":"conference","publication_identifier":{"isbn":["9781450369350"]},"title":"Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up","citation":{"ama":"Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up. In: <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>. ; 2020. doi:<a href=\"https://doi.org/10.1145/3350755.3400263\">10.1145/3350755.3400263</a>","bibtex":"@inproceedings{Castenow_Kling_Knollmann_Meyer auf der Heide_2020, title={Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up}, DOI={<a href=\"https://doi.org/10.1145/3350755.3400263\">10.1145/3350755.3400263</a>}, booktitle={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures}, author={Castenow, Jannik and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}, year={2020} }","mla":"Castenow, Jannik, et al. “Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed Up.” <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020, doi:<a href=\"https://doi.org/10.1145/3350755.3400263\">10.1145/3350755.3400263</a>.","ieee":"J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up,” in <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020.","chicago":"Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed Up.” In <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020. <a href=\"https://doi.org/10.1145/3350755.3400263\">https://doi.org/10.1145/3350755.3400263</a>.","apa":"Castenow, J., Kling, P., Knollmann, T., &#38; Meyer auf der Heide, F. (2020). Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up. In <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>. <a href=\"https://doi.org/10.1145/3350755.3400263\">https://doi.org/10.1145/3350755.3400263</a>","short":"J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020."},"_id":"17371","year":"2020","file_date_updated":"2020-07-14T07:56:04Z","ddc":["000"],"external_id":{"arxiv":["2010.02043 "]},"user_id":"38705","publication":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures"}