{"ddc":["000"],"title":"Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up","year":"2020","type":"conference","language":[{"iso":"eng"}],"user_id":"38705","publication_status":"published","_id":"17371","file_date_updated":"2020-07-14T07:56:04Z","date_created":"2020-07-14T07:53:47Z","date_updated":"2022-01-06T06:53:10Z","status":"public","publication_identifier":{"isbn":["9781450369350"]},"file":[{"content_type":"application/pdf","access_level":"closed","creator":"janniksu","file_name":"3350755.3400263.pdf","success":1,"date_created":"2020-07-14T07:56:04Z","file_id":"17372","date_updated":"2020-07-14T07:56:04Z","relation":"main_file","file_size":1078544}],"department":[{"_id":"63"}],"has_accepted_license":"1","author":[{"full_name":"Castenow, Jannik","last_name":"Castenow","first_name":"Jannik","id":"38705"},{"full_name":"Kling, Peter","last_name":"Kling","first_name":"Peter"},{"first_name":"Till","id":"39241","orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till","last_name":"Knollmann"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523"}],"external_id":{"arxiv":["2010.02043 "]},"citation":{"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.","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} }","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>","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>."},"publication":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","doi":"10.1145/3350755.3400263"}