[{"_id":"43109","date_updated":"2023-03-27T09:55:04Z","intvolume":" 950","doi":"10.1016/j.tcs.2023.113756","language":[{"iso":"eng"}],"page":"113756","year":"2023","citation":{"apa":"Götte, T., Kolb, C., Scheideler, C., & Werthmann, J. (2023). Beep-and-Sleep: Message and Energy Efficient Set Cover. Theor. Comput. Sci., 950, 113756. https://doi.org/10.1016/j.tcs.2023.113756","ama":"Götte T, Kolb C, Scheideler C, Werthmann J. Beep-and-Sleep: Message and Energy Efficient Set Cover. Theor Comput Sci. 2023;950:113756. doi:10.1016/j.tcs.2023.113756","chicago":"Götte, Thorsten, Christina Kolb, Christian Scheideler, and Julian Werthmann. “Beep-and-Sleep: Message and Energy Efficient Set Cover.” Theor. Comput. Sci. 950 (2023): 113756. https://doi.org/10.1016/j.tcs.2023.113756.","bibtex":"@article{Götte_Kolb_Scheideler_Werthmann_2023, title={Beep-and-Sleep: Message and Energy Efficient Set Cover}, volume={950}, DOI={10.1016/j.tcs.2023.113756}, journal={Theor. Comput. Sci.}, author={Götte, Thorsten and Kolb, Christina and Scheideler, Christian and Werthmann, Julian}, year={2023}, pages={113756} }","mla":"Götte, Thorsten, et al. “Beep-and-Sleep: Message and Energy Efficient Set Cover.” Theor. Comput. Sci., vol. 950, 2023, p. 113756, doi:10.1016/j.tcs.2023.113756.","short":"T. Götte, C. Kolb, C. Scheideler, J. Werthmann, Theor. Comput. Sci. 950 (2023) 113756.","ieee":"T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-and-Sleep: Message and Energy Efficient Set Cover,” Theor. Comput. Sci., vol. 950, p. 113756, 2023, doi: 10.1016/j.tcs.2023.113756."},"type":"journal_article","user_id":"15504","title":"Beep-and-Sleep: Message and Energy Efficient Set Cover","department":[{"_id":"79"}],"publication":"Theor. Comput. Sci.","author":[{"full_name":"Götte, Thorsten","first_name":"Thorsten","id":"34727","last_name":"Götte"},{"full_name":"Kolb, Christina","first_name":"Christina","last_name":"Kolb"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Julian","full_name":"Werthmann, Julian","last_name":"Werthmann","id":"50024"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"date_created":"2023-03-27T07:45:44Z","status":"public","volume":950},{"date_updated":"2023-05-22T09:37:25Z","_id":"45188","doi":"10.48550/ARXIV.2210.05333","citation":{"chicago":"Werthmann, Julian, Christian Scheideler, Sam Coy, Artur Czumaj, and Philipp Schneider. “Routing Schemes for Hybrid Communication Networks,” 2023. https://doi.org/10.48550/ARXIV.2210.05333.","ama":"Werthmann J, Scheideler C, Coy S, Czumaj A, Schneider P. Routing Schemes for Hybrid Communication Networks. In: ; 2023. doi:10.48550/ARXIV.2210.05333","apa":"Werthmann, J., Scheideler, C., Coy, S., Czumaj, A., & Schneider, P. (2023). Routing Schemes for Hybrid Communication Networks. https://doi.org/10.48550/ARXIV.2210.05333","mla":"Werthmann, Julian, et al. Routing Schemes for Hybrid Communication Networks. 2023, doi:10.48550/ARXIV.2210.05333.","bibtex":"@inproceedings{Werthmann_Scheideler_Coy_Czumaj_Schneider_2023, title={Routing Schemes for Hybrid Communication Networks}, DOI={10.48550/ARXIV.2210.05333}, author={Werthmann, Julian and Scheideler, Christian and Coy, Sam and Czumaj, Artur and Schneider, Philipp}, year={2023} }","short":"J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, P. Schneider, in: 2023.","ieee":"J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, and P. Schneider, “Routing Schemes for Hybrid Communication Networks,” 2023, doi: 10.48550/ARXIV.2210.05333."},"type":"conference","year":"2023","language":[{"iso":"eng"}],"title":"Routing Schemes for Hybrid Communication Networks","user_id":"50024","department":[{"_id":"79"}],"author":[{"id":"50024","last_name":"Werthmann","full_name":"Werthmann, Julian","first_name":"Julian"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Coy","full_name":"Coy, Sam","first_name":"Sam"},{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"full_name":"Schneider, Philipp","first_name":"Philipp","last_name":"Schneider"}],"date_created":"2023-05-22T09:17:50Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"status":"public"},{"date_updated":"2023-05-22T16:04:56Z","_id":"45193","conference":{"end_date":"2023-06-25","name":"ACM Symposium on Principles of Distributed Computing (PODC)","start_date":"2023-06-19","location":"Orlando, USA"},"year":"2023","type":"conference","citation":{"ieee":"J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, and J. Werthmann, “Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs,” presented at the ACM Symposium on Principles of Distributed Computing (PODC), Orlando, USA, 2023.","short":"J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, J. Werthmann, in: Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23), 2023.","bibtex":"@inproceedings{Dou_Götte_Hillebrandt_Scheideler_Werthmann_2023, title={Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs}, booktitle={Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23)}, author={Dou, Jinfeng and Götte, Thorsten and Hillebrandt, Henning and Scheideler, Christian and Werthmann, Julian}, year={2023} }","mla":"Dou, Jinfeng, et al. “Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs.” Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23), 2023.","chicago":"Dou, Jinfeng, Thorsten Götte, Henning Hillebrandt, Christian Scheideler, and Julian Werthmann. “Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs.” In Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23), 2023.","ama":"Dou J, Götte T, Hillebrandt H, Scheideler C, Werthmann J. Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs. In: Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23). ; 2023.","apa":"Dou, J., Götte, T., Hillebrandt, H., Scheideler, C., & Werthmann, J. (2023). Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs. Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23). ACM Symposium on Principles of Distributed Computing (PODC), Orlando, USA."},"language":[{"iso":"eng"}],"title":"Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs","user_id":"34727","status":"public","project":[{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"},{"_id":"1","name":"SFB 901: SFB 901"}],"date_created":"2023-05-22T14:42:31Z","author":[{"last_name":"Dou","id":"92888","first_name":"Jinfeng","full_name":"Dou, Jinfeng"},{"id":"34727","last_name":"Götte","full_name":"Götte, Thorsten","first_name":"Thorsten"},{"last_name":"Hillebrandt","first_name":"Henning","full_name":"Hillebrandt, Henning"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"first_name":"Julian","full_name":"Werthmann, Julian","last_name":"Werthmann","id":"50024"}],"publication":"Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC '23)"},{"year":"2023","citation":{"mla":"Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” Distributed Computing, 2023, doi:https://doi.org/10.1007/s00446-023-00442-4.","bibtex":"@article{Götte_Hinnenthal_Scheideler_Werthmann_2023, title={Time-Optimal Construction of Overlays}, DOI={https://doi.org/10.1007/s00446-023-00442-4}, journal={Distributed Computing}, author={Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian and Werthmann, Julian}, year={2023} }","apa":"Götte, T., Hinnenthal, K., Scheideler, C., & Werthmann, J. (2023). Time-Optimal Construction of Overlays. Distributed Computing. https://doi.org/10.1007/s00446-023-00442-4","ama":"Götte T, Hinnenthal K, Scheideler C, Werthmann J. Time-Optimal Construction of Overlays. Distributed Computing. Published online 2023. doi:https://doi.org/10.1007/s00446-023-00442-4","chicago":"Götte, Thorsten, Kristian Hinnenthal, Christian Scheideler, and Julian Werthmann. “Time-Optimal Construction of Overlays.” Distributed Computing, 2023. https://doi.org/10.1007/s00446-023-00442-4.","ieee":"T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction of Overlays,” Distributed Computing, 2023, doi: https://doi.org/10.1007/s00446-023-00442-4.","short":"T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, Distributed Computing (2023)."},"type":"journal_article","language":[{"iso":"eng"}],"doi":"https://doi.org/10.1007/s00446-023-00442-4","_id":"45192","date_updated":"2023-05-23T12:38:57Z","status":"public","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"date_created":"2023-05-22T14:34:34Z","author":[{"id":"34727","last_name":"Götte","full_name":"Götte, Thorsten","first_name":"Thorsten"},{"first_name":"Kristian","full_name":"Hinnenthal, Kristian","last_name":"Hinnenthal","id":"32229"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Werthmann, Julian","first_name":"Julian","id":"50024","last_name":"Werthmann"}],"publication":"Distributed Computing","title":"Time-Optimal Construction of Overlays","user_id":"477"},{"title":"Capabilities and Limitations of Local Strategies in Dynamic Networks","place":"Paderborn","editor":[{"last_name":"Haake","first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Platzner","full_name":"Platzner, Marco","first_name":"Marco"},{"full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"project":[{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)","grant_number":"160364472"}],"department":[{"_id":"7"}],"doi":"10.5281/zenodo.8060372","oa":"1","date_updated":"2023-07-07T06:21:57Z","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","ddc":["004"],"user_id":"477","volume":412,"status":"public","has_accepted_license":"1","date_created":"2023-07-07T06:21:38Z","publisher":"Heinz Nixdorf Institut, Universität Paderborn","author":[{"last_name":"Götte","id":"34727","first_name":"Thorsten","full_name":"Götte, Thorsten"},{"last_name":"Knollmann","id":"39241","first_name":"Till","full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Werthmann","id":"50024","first_name":"Julian","full_name":"Werthmann, Julian"}],"file_date_updated":"2023-07-07T06:20:43Z","publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","file":[{"date_created":"2023-07-07T06:20:43Z","file_name":"A1-Chapter-SFB-Buch-Final.pdf","access_level":"open_access","file_size":543715,"creator":"ups","file_id":"45876","date_updated":"2023-07-07T06:20:43Z","content_type":"application/pdf","relation":"main_file"}],"_id":"45875","intvolume":" 412","year":"2023","type":"book_chapter","citation":{"chicago":"Götte, Thorsten, Till Knollmann, Friedhelm Meyer auf der Heide, Christian Scheideler, and Julian Werthmann. “Capabilities and Limitations of Local Strategies in Dynamic Networks.” In On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:1--20. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. https://doi.org/10.5281/zenodo.8060372.","apa":"Götte, T., Knollmann, T., Meyer auf der Heide, F., Scheideler, C., & Werthmann, J. (2023). Capabilities and Limitations of Local Strategies in Dynamic Networks. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, & H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-services in dynamic markets (Vol. 412, pp. 1--20). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8060372","ama":"Götte T, Knollmann T, Meyer auf der Heide F, Scheideler C, Werthmann J. Capabilities and Limitations of Local Strategies in Dynamic Networks. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:1--20. doi:10.5281/zenodo.8060372","mla":"Götte, Thorsten, et al. “Capabilities and Limitations of Local Strategies in Dynamic Networks.” On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 1--20, doi:10.5281/zenodo.8060372.","bibtex":"@inbook{Götte_Knollmann_Meyer auf der Heide_Scheideler_Werthmann_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Capabilities and Limitations of Local Strategies in Dynamic Networks}, volume={412}, DOI={10.5281/zenodo.8060372}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Götte, Thorsten and Knollmann, Till and Meyer auf der Heide, Friedhelm and Scheideler, Christian and Werthmann, Julian}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={1--20}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","short":"T. Götte, T. Knollmann, F. Meyer auf der Heide, C. Scheideler, J. Werthmann, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 1--20.","ieee":"T. Götte, T. Knollmann, F. Meyer auf der Heide, C. Scheideler, and J. Werthmann, “Capabilities and Limitations of Local Strategies in Dynamic Networks,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 1--20."},"page":"1--20"},{"citation":{"chicago":"Werthmann, Julian. Derandomization and Local Graph Problems in the Node-Capacitated Clique, 2021.","ama":"Werthmann J. Derandomization and Local Graph Problems in the Node-Capacitated Clique.; 2021.","apa":"Werthmann, J. (2021). Derandomization and Local Graph Problems in the Node-Capacitated Clique.","bibtex":"@book{Werthmann_2021, title={Derandomization and Local Graph Problems in the Node-Capacitated Clique}, author={Werthmann, Julian}, year={2021} }","mla":"Werthmann, Julian. Derandomization and Local Graph Problems in the Node-Capacitated Clique. 2021.","short":"J. Werthmann, Derandomization and Local Graph Problems in the Node-Capacitated Clique, 2021.","ieee":"J. Werthmann, Derandomization and Local Graph Problems in the Node-Capacitated Clique. 2021."},"type":"mastersthesis","year":"2021","supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:44Z","_id":"21084","department":[{"_id":"79"}],"author":[{"last_name":"Werthmann","id":"50024","first_name":"Julian","full_name":"Werthmann, Julian"}],"date_created":"2021-01-26T13:58:14Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"status":"public","title":"Derandomization and Local Graph Problems in the Node-Capacitated Clique","user_id":"15504"},{"user_id":"477","ddc":["000"],"abstract":[{"text":" We show how to construct an overlay network of constant degree and diameter $O(\\log n)$ in time $O(\\log n)$ starting from an arbitrary weakly connected graph.\r\n We assume a synchronous communication network in which nodes can send messages to nodes they know the identifier of and establish new connections by sending node identifiers.\r\n If the initial network's graph is weakly connected and has constant degree, then our algorithm constructs the desired topology with each node sending and receiving only $O(\\log n)$ messages in each round in time $O(\\log n)$, w.h.p., which beats the currently best $O(\\log^{3/2} n)$ time algorithm of [Götte et al., SIROCCO'19].\r\n Since the problem cannot be solved faster than by using pointer jumping for $O(\\log n)$ rounds (which would even require each node to communicate $\\Omega(n)$ bits), our algorithm is asymptotically optimal.\r\n We achieve this speedup by using short random walks to repeatedly establish random connections between the nodes that quickly reduce the conductance of the graph using an observation of [Kwok and Lau, APPROX'14].\r\n \r\n Additionally, we show how our algorithm can be used to efficiently solve graph problems in \\emph{hybrid networks} [Augustine et al., SODA'20].\r\n Motivated by the idea that nodes possess two different modes of communication, we assume that communication of the \\emph{initial} edges is unrestricted. In contrast, only polylogarithmically many messages can be communicated over edges that have been established throughout an algorithm's execution.\r\n For an (undirected) graph $G$ with arbitrary degree, we show how to compute connected components, a spanning tree, and biconnected components in time $O(\\log n)$, w.h.p.\r\n Furthermore, we show how to compute an MIS in time $O(\\log d + \\log \\log n)$, w.h.p., where $d$ is the initial degree of $G$.","lang":"eng"}],"status":"public","has_accepted_license":"1","date_created":"2021-06-06T19:10:26Z","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2021-06-06T19:12:49Z","file_id":"22284","creator":"thgoette","file_size":590875,"access_level":"closed","date_created":"2021-06-06T19:12:49Z","file_name":"Wicked_Fast_Overlay_Construction(1).pdf"}],"author":[{"last_name":"Götte","id":"34727","first_name":"Thorsten","full_name":"Götte, Thorsten"},{"full_name":"Hinnenthal, Kristian","first_name":"Kristian","id":"32229","last_name":"Hinnenthal"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Werthmann","id":"50024","first_name":"Julian","full_name":"Werthmann, Julian"}],"publisher":"ACM","file_date_updated":"2021-06-06T19:12:49Z","publication":"Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC '21)","_id":"22283","conference":{"location":"Virtual","name":"ACM Symposium on Principles of Distributed Computing (PODC)","start_date":"2021-07-26","end_date":"2021-07-30"},"year":"2021","citation":{"ieee":"T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction of Overlays,” in Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), Virtual.","short":"T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, in: K. Censor-Hillel (Ed.), Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), ACM, New York, n.d.","mla":"Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), edited by Keren Censor-Hillel, ACM, doi:10.1145/3465084.3467932.","bibtex":"@inproceedings{Götte_Hinnenthal_Scheideler_Werthmann, place={New York}, title={Time-Optimal Construction of Overlays}, DOI={10.1145/3465084.3467932}, booktitle={Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)}, publisher={ACM}, author={Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian and Werthmann, Julian}, editor={Censor-Hillel, KerenEditor} }","chicago":"Götte, Thorsten, Kristian Hinnenthal, Christian Scheideler, and Julian Werthmann. “Time-Optimal Construction of Overlays.” In Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), edited by Keren Censor-Hillel. New York: ACM, n.d. https://doi.org/10.1145/3465084.3467932.","ama":"Götte T, Hinnenthal K, Scheideler C, Werthmann J. Time-Optimal Construction of Overlays. In: Censor-Hillel K, ed. Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21). New York: ACM. doi:10.1145/3465084.3467932","apa":"Götte, T., Hinnenthal, K., Scheideler, C., & Werthmann, J. (n.d.). Time-Optimal Construction of Overlays. In K. Censor-Hillel (Ed.), Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21). New York: ACM. https://doi.org/10.1145/3465084.3467932"},"type":"conference","title":"Time-Optimal Construction of Overlays","place":"New York","project":[{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"_id":"1","name":"SFB 901"}],"editor":[{"first_name":"Keren","full_name":"Censor-Hillel, Keren","last_name":"Censor-Hillel"}],"publication_status":"accepted","department":[{"_id":"34"}],"doi":"10.1145/3465084.3467932","date_updated":"2022-01-06T06:55:30Z","language":[{"iso":"eng"}]},{"type":"book_chapter","year":"2021","citation":{"bibtex":"@inbook{Götte_Kolb_Scheideler_Werthmann_2021, place={Cham}, title={Beep-And-Sleep: Message and Energy Efficient Set Cover}, DOI={10.1007/978-3-030-89240-1_7}, booktitle={Algorithms for Sensor Systems (ALGOSENSORS ’21)}, author={Götte, Thorsten and Kolb, Christina and Scheideler, Christian and Werthmann, Julian}, year={2021} }","mla":"Götte, Thorsten, et al. “Beep-And-Sleep: Message and Energy Efficient Set Cover.” Algorithms for Sensor Systems (ALGOSENSORS ’21), 2021, doi:10.1007/978-3-030-89240-1_7.","chicago":"Götte, Thorsten, Christina Kolb, Christian Scheideler, and Julian Werthmann. “Beep-And-Sleep: Message and Energy Efficient Set Cover.” In Algorithms for Sensor Systems (ALGOSENSORS ’21). Cham, 2021. https://doi.org/10.1007/978-3-030-89240-1_7.","ama":"Götte T, Kolb C, Scheideler C, Werthmann J. Beep-And-Sleep: Message and Energy Efficient Set Cover. In: Algorithms for Sensor Systems (ALGOSENSORS ’21). ; 2021. doi:10.1007/978-3-030-89240-1_7","apa":"Götte, T., Kolb, C., Scheideler, C., & Werthmann, J. (2021). Beep-And-Sleep: Message and Energy Efficient Set Cover. In Algorithms for Sensor Systems (ALGOSENSORS ’21). ALGOSENSORS 2021, Lisbon, Portgual. https://doi.org/10.1007/978-3-030-89240-1_7","ieee":"T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-And-Sleep: Message and Energy Efficient Set Cover,” in Algorithms for Sensor Systems (ALGOSENSORS ’21), Cham, 2021.","short":"T. Götte, C. Kolb, C. Scheideler, J. Werthmann, in: Algorithms for Sensor Systems (ALGOSENSORS ’21), Cham, 2021."},"language":[{"iso":"eng"}],"_id":"26888","date_updated":"2022-11-18T10:01:36Z","conference":{"location":"Lisbon, Portgual","name":"ALGOSENSORS 2021"},"doi":"10.1007/978-3-030-89240-1_7","author":[{"full_name":"Götte, Thorsten","first_name":"Thorsten","id":"34727","last_name":"Götte"},{"last_name":"Kolb","id":"43647","first_name":"Christina","full_name":"Kolb, Christina"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Werthmann","id":"50024","first_name":"Julian","full_name":"Werthmann, Julian"}],"publication":"Algorithms for Sensor Systems (ALGOSENSORS '21)","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"]},"status":"public","date_created":"2021-10-26T12:06:04Z","project":[{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901: SFB 901","_id":"1"}],"place":"Cham","title":"Beep-And-Sleep: Message and Energy Efficient Set Cover","user_id":"477"}]