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