[{"editor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"status":"public","type":"conference_editor","language":[{"iso":"eng"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"_id":"33968","series_title":"LIPIcs","user_id":"15504","department":[{"_id":"79"}],"year":"2022","citation":{"ama":"Scheideler C, ed. <i>36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA</i>. Vol 246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022.","ieee":"C. Scheideler, Ed., <i>36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA</i>, vol. 246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","chicago":"Scheideler, Christian, ed. <i>36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA</i>. Vol. 246. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","apa":"Scheideler, C. (Ed.). (2022). <i>36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA</i> (Vol. 246). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.","bibtex":"@book{Scheideler_2022, series={LIPIcs}, title={36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA}, volume={246}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, year={2022}, collection={LIPIcs} }","short":"C. Scheideler, ed., 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","mla":"Scheideler, Christian, editor. <i>36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA</i>. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022."},"intvolume":"       246","publication_identifier":{"isbn":["978-3-95977-255-6"]},"title":"36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA","date_updated":"2022-11-02T08:56:13Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_created":"2022-11-02T08:55:30Z","volume":246},{"type":"dissertation","status":"public","_id":"30239","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"}],"department":[{"_id":"79"}],"user_id":"15504","language":[{"iso":"eng"}],"year":"2022","citation":{"bibtex":"@book{Kolb_2022, title={Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1673 \">10.17619/UNIPB/1-1673 </a>}, author={Kolb, Christina}, year={2022} }","short":"C. Kolb, Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks, 2022.","mla":"Kolb, Christina. <i>Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks</i>. 2022, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1673 \">10.17619/UNIPB/1-1673 </a>.","apa":"Kolb, C. (2022). <i>Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1673 \">https://doi.org/10.17619/UNIPB/1-1673 </a>","chicago":"Kolb, Christina. <i>Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks</i>, 2022. <a href=\"https://doi.org/10.17619/UNIPB/1-1673 \">https://doi.org/10.17619/UNIPB/1-1673 </a>.","ieee":"C. Kolb, <i>Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks</i>. 2022.","ama":"Kolb C. <i>Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks</i>.; 2022. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1673 \">10.17619/UNIPB/1-1673 </a>"},"date_updated":"2023-03-17T07:22:04Z","author":[{"first_name":"Christina","last_name":"Kolb","full_name":"Kolb, Christina"}],"date_created":"2022-03-11T06:05:54Z","supervisor":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"title":"Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks","doi":"10.17619/UNIPB/1-1673 "},{"publication_identifier":{"issn":["0890-5401"]},"publication_status":"published","citation":{"chicago":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” <i>Information and Computation</i>, 2022. <a href=\"https://doi.org/10.1016/j.ic.2021.104697\">https://doi.org/10.1016/j.ic.2021.104697</a>.","ieee":"T. Knollmann and C. Scheideler, “A self-stabilizing Hashed Patricia Trie,” <i>Information and Computation</i>, Art. no. 104697, 2022, doi: <a href=\"https://doi.org/10.1016/j.ic.2021.104697\">10.1016/j.ic.2021.104697</a>.","ama":"Knollmann T, Scheideler C. A self-stabilizing Hashed Patricia Trie. <i>Information and Computation</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1016/j.ic.2021.104697\">10.1016/j.ic.2021.104697</a>","apa":"Knollmann, T., &#38; Scheideler, C. (2022). A self-stabilizing Hashed Patricia Trie. <i>Information and Computation</i>, Article 104697. <a href=\"https://doi.org/10.1016/j.ic.2021.104697\">https://doi.org/10.1016/j.ic.2021.104697</a>","short":"T. Knollmann, C. Scheideler, Information and Computation (2022).","bibtex":"@article{Knollmann_Scheideler_2022, title={A self-stabilizing Hashed Patricia Trie}, DOI={<a href=\"https://doi.org/10.1016/j.ic.2021.104697\">10.1016/j.ic.2021.104697</a>}, number={104697}, journal={Information and Computation}, author={Knollmann, Till and Scheideler, Christian}, year={2022} }","mla":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” <i>Information and Computation</i>, 104697, 2022, doi:<a href=\"https://doi.org/10.1016/j.ic.2021.104697\">10.1016/j.ic.2021.104697</a>."},"year":"2022","author":[{"first_name":"Till","last_name":"Knollmann","orcid":"0000-0003-2014-4696","id":"39241","full_name":"Knollmann, Till"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2021-01-29T09:39:40Z","date_updated":"2023-03-27T07:56:48Z","doi":"10.1016/j.ic.2021.104697","title":"A self-stabilizing Hashed Patricia Trie","publication":"Information and Computation","type":"journal_article","status":"public","abstract":[{"lang":"eng","text":"While many research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures. However, when peers in peer-to-peer networks crash, a distributed data structure may not remain intact. We present a self-stabilizing protocol for a distributed data structure called the Hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys. The data structure has many applications while offering low overhead and efficient operations when embedded on top of a Distributed Hash Table. Especially, longest prefix matching for x can be done in O(log |x|) hash table read accesses. We show how to maintain the structure in a self-stabilizing way, while assuring a low overhead in a legal state and an asymptotically optimal memory demand of O(d) bits, where d is the number of bits needed for storing all keys."}],"department":[{"_id":"63"},{"_id":"79"}],"user_id":"15504","_id":"21096","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"language":[{"iso":"eng"}],"article_number":"104697"},{"citation":{"ama":"Hinnenthal K. <i>Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter</i>.; 2021. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1169 \">10.17619/UNIPB/1-1169 </a>","chicago":"Hinnenthal, Kristian. <i>Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter</i>, 2021. <a href=\"https://doi.org/10.17619/UNIPB/1-1169 \">https://doi.org/10.17619/UNIPB/1-1169 </a>.","ieee":"K. Hinnenthal, <i>Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter</i>. 2021.","apa":"Hinnenthal, K. (2021). <i>Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1169 \">https://doi.org/10.17619/UNIPB/1-1169 </a>","bibtex":"@book{Hinnenthal_2021, title={Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1169 \">10.17619/UNIPB/1-1169 </a>}, author={Hinnenthal, Kristian}, year={2021} }","mla":"Hinnenthal, Kristian. <i>Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter</i>. 2021, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1169 \">10.17619/UNIPB/1-1169 </a>.","short":"K. Hinnenthal, Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter, 2021."},"year":"2021","doi":"10.17619/UNIPB/1-1169 ","title":"Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter","date_created":"2021-09-22T12:33:44Z","supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"author":[{"first_name":"Kristian","id":"32229","full_name":"Hinnenthal, Kristian","last_name":"Hinnenthal"}],"date_updated":"2022-01-06T06:56:40Z","status":"public","type":"dissertation","language":[{"iso":"eng"}],"user_id":"15504","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"24887"},{"citation":{"apa":"Everling, L. (2021). <i>Selbststabilisierender Bakery Algorithmus für verteilte Systeme</i>.","bibtex":"@book{Everling_2021, title={Selbststabilisierender Bakery Algorithmus für verteilte Systeme}, author={Everling, Leon}, year={2021} }","mla":"Everling, Leon. <i>Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme</i>. 2021.","short":"L. Everling, Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme, 2021.","ama":"Everling L. <i>Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme</i>.; 2021.","ieee":"L. Everling, <i>Selbststabilisierender Bakery Algorithmus für verteilte Systeme</i>. 2021.","chicago":"Everling, Leon. <i>Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme</i>, 2021."},"year":"2021","title":"Selbststabilisierender Bakery Algorithmus für verteilte Systeme","date_created":"2021-11-02T10:13:51Z","author":[{"first_name":"Leon","full_name":"Everling, Leon","last_name":"Everling"}],"supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_updated":"2022-01-06T06:57:33Z","status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"15504","_id":"27053","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}]},{"date_updated":"2022-01-06T06:57:33Z","supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2021-11-03T06:12:47Z","author":[{"first_name":"Vaibhav","last_name":"Adsul","full_name":"Adsul, Vaibhav"}],"title":"Peer-to-Peer Matching for Distributed Systems","year":"2021","citation":{"ieee":"V. Adsul, <i>Peer-to-Peer Matching for Distributed Systems</i>. 2021.","chicago":"Adsul, Vaibhav. <i>Peer-to-Peer Matching for Distributed Systems</i>, 2021.","ama":"Adsul V. <i>Peer-to-Peer Matching for Distributed Systems</i>.; 2021.","mla":"Adsul, Vaibhav. <i>Peer-to-Peer Matching for Distributed Systems</i>. 2021.","short":"V. Adsul, Peer-to-Peer Matching for Distributed Systems, 2021.","bibtex":"@book{Adsul_2021, title={Peer-to-Peer Matching for Distributed Systems}, author={Adsul, Vaibhav}, year={2021} }","apa":"Adsul, V. (2021). <i>Peer-to-Peer Matching for Distributed Systems</i>."},"_id":"27072","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"79"}],"user_id":"15504","language":[{"iso":"eng"}],"type":"mastersthesis","status":"public"},{"type":"mastersthesis","status":"public","_id":"21084","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"79"}],"user_id":"15504","language":[{"iso":"eng"}],"year":"2021","citation":{"short":"J. Werthmann, Derandomization and Local Graph Problems in the Node-Capacitated Clique, 2021.","bibtex":"@book{Werthmann_2021, title={Derandomization and Local Graph Problems in the Node-Capacitated Clique}, author={Werthmann, Julian}, year={2021} }","mla":"Werthmann, Julian. <i>Derandomization and Local Graph Problems in the Node-Capacitated Clique</i>. 2021.","apa":"Werthmann, J. (2021). <i>Derandomization and Local Graph Problems in the Node-Capacitated Clique</i>.","chicago":"Werthmann, Julian. <i>Derandomization and Local Graph Problems in the Node-Capacitated Clique</i>, 2021.","ieee":"J. Werthmann, <i>Derandomization and Local Graph Problems in the Node-Capacitated Clique</i>. 2021.","ama":"Werthmann J. <i>Derandomization and Local Graph Problems in the Node-Capacitated Clique</i>.; 2021."},"date_updated":"2022-01-06T06:54:44Z","date_created":"2021-01-26T13:58:14Z","supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"author":[{"last_name":"Werthmann","full_name":"Werthmann, Julian","id":"50024","first_name":"Julian"}],"title":"Derandomization and Local Graph Problems in the Node-Capacitated Clique"},{"_id":"21197","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"department":[{"_id":"79"}],"user_id":"15504","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","date_updated":"2022-01-06T06:54:49Z","supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"author":[{"first_name":"Ma","last_name":"Mengshi","full_name":"Mengshi, Ma"}],"date_created":"2021-02-09T07:09:22Z","title":"Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter","year":"2021","citation":{"ieee":"M. Mengshi, <i>Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter</i>. 2021.","chicago":"Mengshi, Ma. <i>Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter</i>, 2021.","ama":"Mengshi M. <i>Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter</i>.; 2021.","short":"M. Mengshi, Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter, 2021.","mla":"Mengshi, Ma. <i>Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter</i>. 2021.","bibtex":"@book{Mengshi_2021, title={Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter}, author={Mengshi, Ma}, year={2021} }","apa":"Mengshi, M. (2021). <i>Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter</i>."}},{"ddc":["006"],"file_date_updated":"2021-04-15T08:21:15Z","language":[{"iso":"eng"}],"_id":"21628","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"79"}],"user_id":"23538","abstract":[{"lang":"eng","text":"This thesis considers the realization of distributed data structures and the construction of distributed protocols for self-stabilizing overlay networks.\r\n\r\nIn the first part of this thesis, we provide distributed protocols for queues, stacks and priority queues that serve the insertion and deletion of elements within a logarithmic amount of rounds.\r\nOur protocols respect semantic constraints such as sequential consistency or serializability and the individual semantic constraints given by the type (queue, stack, priority queue) of the data structure.\r\nWe furthermore provide a protocol that handles joining and leaving nodes.\r\nAs an important side product, we present a novel protocol solving the distributed $k$-selection problem in a logarithmic amount of rounds, that is, to find the $k$-smallest elements among a polynomial number of elements spread among $n$ nodes.\r\n\t\r\nThe second part of this thesis is devoted to the construction of protocols for self-stabilizing overlay networks, i.e., distributed protocols that transform an overlay network from any initial (potentially illegitimate) state into a legitimate state in finite time.\r\nWe present protocols for self-stabilizing generalized De Bruijn graphs, self-stabilizing quadtrees and self-stabilizing supervised skip rings.\r\nEach of those protocols comes with unique properties that makes it interesting for certain distributed applications.\r\nGeneralized De Bruijn networks provide routing within a constant amount of hops, thus serving the interest in networks that require a low latency for requests.\r\nThe protocol for the quadtree guarantees monotonic searchability as well as a geometric variant of monotonic searchability, making it interesting for wireless networks or applications needed in the area of computational geometry.\r\nThe supervised skip ring can be used to construct a self-stabilizing publish-subscribe system.\r\n"}],"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":2617069,"file_name":"Dissertation_Michael_Feldmann.pdf","access_level":"closed","file_id":"21629","date_updated":"2021-04-15T08:21:15Z","date_created":"2021-04-15T08:21:15Z","creator":"mfeldma2"}],"type":"dissertation","title":"Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks","doi":"10.17619/UNIPB/1-1113","date_updated":"2022-01-06T06:55:08Z","date_created":"2021-04-15T08:23:52Z","author":[{"last_name":"Feldmann","full_name":"Feldmann, Michael","id":"23538","first_name":"Michael"}],"supervisor":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"year":"2021","citation":{"chicago":"Feldmann, Michael. <i>Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks</i>, 2021. <a href=\"https://doi.org/10.17619/UNIPB/1-1113\">https://doi.org/10.17619/UNIPB/1-1113</a>.","ieee":"M. Feldmann, <i>Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks</i>. 2021.","ama":"Feldmann M. <i>Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks</i>.; 2021. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1113\">10.17619/UNIPB/1-1113</a>","apa":"Feldmann, M. (2021). <i>Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1113\">https://doi.org/10.17619/UNIPB/1-1113</a>","bibtex":"@book{Feldmann_2021, title={Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1113\">10.17619/UNIPB/1-1113</a>}, author={Feldmann, Michael}, year={2021} }","mla":"Feldmann, Michael. <i>Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks</i>. 2021, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1113\">10.17619/UNIPB/1-1113</a>.","short":"M. Feldmann, Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks, 2021."},"has_accepted_license":"1"},{"publication_status":"published","intvolume":"        65","page":"943–984","citation":{"ama":"Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. Managing Multiple Mobile Resources. <i>Theory of Computing Systems</i>. 2021;65:943–984. doi:<a href=\"https://doi.org/10.1007/s00224-020-10023-8\">10.1007/s00224-020-10023-8</a>","ieee":"B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing Multiple Mobile Resources,” <i>Theory of Computing Systems</i>, vol. 65, pp. 943–984, 2021, doi: <a href=\"https://doi.org/10.1007/s00224-020-10023-8\">10.1007/s00224-020-10023-8</a>.","chicago":"Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Managing Multiple Mobile Resources.” <i>Theory of Computing Systems</i> 65 (2021): 943–984. <a href=\"https://doi.org/10.1007/s00224-020-10023-8\">https://doi.org/10.1007/s00224-020-10023-8</a>.","apa":"Feldkord, B., Knollmann, T., Malatyali, M., &#38; Meyer auf der Heide, F. (2021). Managing Multiple Mobile Resources. <i>Theory of Computing Systems</i>, <i>65</i>, 943–984. <a href=\"https://doi.org/10.1007/s00224-020-10023-8\">https://doi.org/10.1007/s00224-020-10023-8</a>","mla":"Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” <i>Theory of Computing Systems</i>, vol. 65, 2021, pp. 943–984, doi:<a href=\"https://doi.org/10.1007/s00224-020-10023-8\">10.1007/s00224-020-10023-8</a>.","short":"B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, Theory of Computing Systems 65 (2021) 943–984.","bibtex":"@article{Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2021, title={Managing Multiple Mobile Resources}, volume={65}, DOI={<a href=\"https://doi.org/10.1007/s00224-020-10023-8\">10.1007/s00224-020-10023-8</a>}, journal={Theory of Computing Systems}, author={Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2021}, pages={943–984} }"},"year":"2021","volume":65,"author":[{"last_name":"Feldkord","full_name":"Feldkord, Björn","id":"22704","first_name":"Björn"},{"first_name":"Till","full_name":"Knollmann, Till","id":"39241","orcid":"0000-0003-2014-4696","last_name":"Knollmann"},{"first_name":"Manuel","last_name":"Malatyali","full_name":"Malatyali, Manuel","id":"41265"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_created":"2020-12-08T08:40:10Z","date_updated":"2022-01-06T06:54:31Z","doi":"10.1007/s00224-020-10023-8","title":"Managing Multiple Mobile Resources","publication":"Theory of Computing Systems","type":"journal_article","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"20683","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"language":[{"iso":"eng"}]},{"department":[{"_id":"63"}],"user_id":"22704","_id":"20817","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"language":[{"iso":"eng"}],"publication":"Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)","type":"conference","status":"public","date_created":"2020-12-21T13:46:16Z","author":[{"first_name":"Marcin","last_name":"Bienkowski","full_name":"Bienkowski, Marcin"},{"last_name":"Feldkord","id":"22704","full_name":"Feldkord, Björn","first_name":"Björn"},{"last_name":"Schmidt","full_name":"Schmidt, Pawel","first_name":"Pawel"}],"date_updated":"2022-01-06T06:54:40Z","doi":"10.4230/LIPIcs.STACS.2021.14","title":"A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location","publication_status":"published","page":"14:1 - 14:17","citation":{"ieee":"M. Bienkowski, B. Feldkord, and P. Schmidt, “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location,” in <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 2021, pp. 14:1-14:17.","chicago":"Bienkowski, Marcin, Björn Feldkord, and Pawel Schmidt. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.” In <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 14:1-14:17, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">https://doi.org/10.4230/LIPIcs.STACS.2021.14</a>.","ama":"Bienkowski M, Feldkord B, Schmidt P. A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. In: <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i>. ; 2021:14:1-14:17. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">10.4230/LIPIcs.STACS.2021.14</a>","mla":"Bienkowski, Marcin, et al. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.” <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 2021, pp. 14:1-14:17, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">10.4230/LIPIcs.STACS.2021.14</a>.","bibtex":"@inproceedings{Bienkowski_Feldkord_Schmidt_2021, title={A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">10.4230/LIPIcs.STACS.2021.14</a>}, booktitle={Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)}, author={Bienkowski, Marcin and Feldkord, Björn and Schmidt, Pawel}, year={2021}, pages={14:1-14:17} }","short":"M. Bienkowski, B. Feldkord, P. Schmidt, in: Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17.","apa":"Bienkowski, M., Feldkord, B., &#38; Schmidt, P. (2021). A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. In <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i> (pp. 14:1-14:17). <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">https://doi.org/10.4230/LIPIcs.STACS.2021.14</a>"},"year":"2021"},{"year":"2021","date_created":"2021-06-06T19:10:26Z","publisher":"ACM","title":"Time-Optimal Construction of Overlays","publication":"Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC '21)","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2021-06-06T19:12:49Z","date_created":"2021-06-06T19:12:49Z","creator":"thgoette","file_size":590875,"access_level":"closed","file_id":"22284","file_name":"Wicked_Fast_Overlay_Construction(1).pdf"}],"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"}],"language":[{"iso":"eng"}],"ddc":["000"],"publication_status":"accepted","has_accepted_license":"1","citation":{"apa":"Götte, T., Hinnenthal, K., Scheideler, C., &#38; Werthmann, J. (n.d.). Time-Optimal Construction of Overlays. In K. Censor-Hillel (Ed.), <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>. New York: ACM. <a href=\"https://doi.org/10.1145/3465084.3467932\">https://doi.org/10.1145/3465084.3467932</a>","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.","bibtex":"@inproceedings{Götte_Hinnenthal_Scheideler_Werthmann, place={New York}, title={Time-Optimal Construction of Overlays}, DOI={<a href=\"https://doi.org/10.1145/3465084.3467932\">10.1145/3465084.3467932</a>}, 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} }","mla":"Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>, edited by Keren Censor-Hillel, ACM, doi:<a href=\"https://doi.org/10.1145/3465084.3467932\">10.1145/3465084.3467932</a>.","ama":"Götte T, Hinnenthal K, Scheideler C, Werthmann J. Time-Optimal Construction of Overlays. In: Censor-Hillel K, ed. <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>. New York: ACM. doi:<a href=\"https://doi.org/10.1145/3465084.3467932\">10.1145/3465084.3467932</a>","chicago":"Götte, Thorsten, Kristian Hinnenthal, Christian Scheideler, and Julian Werthmann. “Time-Optimal Construction of Overlays.” In <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>, edited by Keren Censor-Hillel. New York: ACM, n.d. <a href=\"https://doi.org/10.1145/3465084.3467932\">https://doi.org/10.1145/3465084.3467932</a>.","ieee":"T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction of Overlays,” in <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>, Virtual."},"place":"New York","author":[{"first_name":"Thorsten","last_name":"Götte","full_name":"Götte, Thorsten","id":"34727"},{"last_name":"Hinnenthal","id":"32229","full_name":"Hinnenthal, Kristian","first_name":"Kristian"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"first_name":"Julian","last_name":"Werthmann","id":"50024","full_name":"Werthmann, Julian"}],"date_updated":"2022-01-06T06:55:30Z","conference":{"location":"Virtual","end_date":"2021-07-30","start_date":"2021-07-26","name":"ACM Symposium on Principles of Distributed Computing (PODC)"},"doi":"10.1145/3465084.3467932","type":"conference","status":"public","editor":[{"last_name":"Censor-Hillel","full_name":"Censor-Hillel, Keren","first_name":"Keren"}],"user_id":"477","department":[{"_id":"34"}],"project":[{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"_id":"1","name":"SFB 901"}],"_id":"22283","file_date_updated":"2021-06-06T19:12:49Z"},{"user_id":"477","_id":"26888","project":[{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"1","name":"SFB 901: SFB 901"}],"language":[{"iso":"eng"}],"publication":"Algorithms for Sensor Systems (ALGOSENSORS '21)","type":"book_chapter","status":"public","author":[{"full_name":"Götte, Thorsten","id":"34727","last_name":"Götte","first_name":"Thorsten"},{"id":"43647","full_name":"Kolb, Christina","last_name":"Kolb","first_name":"Christina"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"id":"50024","full_name":"Werthmann, Julian","last_name":"Werthmann","first_name":"Julian"}],"date_created":"2021-10-26T12:06:04Z","date_updated":"2022-11-18T10:01:36Z","doi":"10.1007/978-3-030-89240-1_7","conference":{"name":"ALGOSENSORS 2021","location":"Lisbon, Portgual"},"title":"Beep-And-Sleep: Message and Energy Efficient Set Cover","publication_identifier":{"issn":["0302-9743","1611-3349"]},"publication_status":"published","citation":{"mla":"Götte, Thorsten, et al. “Beep-And-Sleep: Message and Energy Efficient Set Cover.” <i>Algorithms for Sensor Systems (ALGOSENSORS ’21)</i>, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-89240-1_7\">10.1007/978-3-030-89240-1_7</a>.","bibtex":"@inbook{Götte_Kolb_Scheideler_Werthmann_2021, place={Cham}, title={Beep-And-Sleep: Message and Energy Efficient Set Cover}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-89240-1_7\">10.1007/978-3-030-89240-1_7</a>}, booktitle={Algorithms for Sensor Systems (ALGOSENSORS ’21)}, author={Götte, Thorsten and Kolb, Christina and Scheideler, Christian and Werthmann, Julian}, year={2021} }","short":"T. Götte, C. Kolb, C. Scheideler, J. Werthmann, in: Algorithms for Sensor Systems (ALGOSENSORS ’21), Cham, 2021.","apa":"Götte, T., Kolb, C., Scheideler, C., &#38; Werthmann, J. (2021). Beep-And-Sleep: Message and Energy Efficient Set Cover. In <i>Algorithms for Sensor Systems (ALGOSENSORS ’21)</i>. ALGOSENSORS 2021, Lisbon, Portgual. <a href=\"https://doi.org/10.1007/978-3-030-89240-1_7\">https://doi.org/10.1007/978-3-030-89240-1_7</a>","chicago":"Götte, Thorsten, Christina Kolb, Christian Scheideler, and Julian Werthmann. “Beep-And-Sleep: Message and Energy Efficient Set Cover.” In <i>Algorithms for Sensor Systems (ALGOSENSORS ’21)</i>. Cham, 2021. <a href=\"https://doi.org/10.1007/978-3-030-89240-1_7\">https://doi.org/10.1007/978-3-030-89240-1_7</a>.","ieee":"T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-And-Sleep: Message and Energy Efficient Set Cover,” in <i>Algorithms for Sensor Systems (ALGOSENSORS ’21)</i>, Cham, 2021.","ama":"Götte T, Kolb C, Scheideler C, Werthmann J. Beep-And-Sleep: Message and Energy Efficient Set Cover. In: <i>Algorithms for Sensor Systems (ALGOSENSORS ’21)</i>. ; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-89240-1_7\">10.1007/978-3-030-89240-1_7</a>"},"place":"Cham","year":"2021"},{"title":"Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation","date_updated":"2023-04-27T15:34:17Z","supervisor":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_created":"2023-04-27T15:34:07Z","author":[{"first_name":"Thilo Frederik","last_name":"Berger","full_name":"Berger, Thilo Frederik"}],"year":"2021","citation":{"chicago":"Berger, Thilo Frederik. <i>Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation</i>, 2021.","ieee":"T. F. Berger, <i>Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation</i>. 2021.","ama":"Berger TF. <i>Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation</i>.; 2021.","short":"T.F. Berger, Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation, 2021.","bibtex":"@book{Berger_2021, title={Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation}, author={Berger, Thilo Frederik}, year={2021} }","mla":"Berger, Thilo Frederik. <i>Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation</i>. 2021.","apa":"Berger, T. F. (2021). <i>Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation</i>."},"language":[{"iso":"eng"}],"_id":"44234","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"63"}],"user_id":"39241","status":"public","type":"bachelorsthesis"},{"department":[{"_id":"63"}],"user_id":"39241","_id":"44233","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"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","author":[{"full_name":"Pranger, Sebastian","last_name":"Pranger","first_name":"Sebastian"}],"date_created":"2023-04-27T15:31:26Z","supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_updated":"2023-04-27T15:31:57Z","title":"Online k-Facility Reallocation using k-Server Algorithms","citation":{"ama":"Pranger S. <i>Online K-Facility Reallocation Using k-Server Algorithms</i>.; 2021.","chicago":"Pranger, Sebastian. <i>Online K-Facility Reallocation Using k-Server Algorithms</i>, 2021.","ieee":"S. Pranger, <i>Online k-Facility Reallocation using k-Server Algorithms</i>. 2021.","short":"S. Pranger, Online K-Facility Reallocation Using k-Server Algorithms, 2021.","bibtex":"@book{Pranger_2021, title={Online k-Facility Reallocation using k-Server Algorithms}, author={Pranger, Sebastian}, year={2021} }","mla":"Pranger, Sebastian. <i>Online K-Facility Reallocation Using k-Server Algorithms</i>. 2021.","apa":"Pranger, S. (2021). <i>Online k-Facility Reallocation using k-Server Algorithms</i>."},"year":"2021"},{"citation":{"ama":"Yeole PK. <i>Plurality Consensus in Hybrid Networks</i>.; 2020.","ieee":"P. K. Yeole, <i>Plurality Consensus in Hybrid Networks</i>. 2020.","chicago":"Yeole, Paresh Kishor. <i>Plurality Consensus in Hybrid Networks</i>, 2020.","apa":"Yeole, P. K. (2020). <i>Plurality Consensus in Hybrid Networks</i>.","short":"P.K. Yeole, Plurality Consensus in Hybrid Networks, 2020.","mla":"Yeole, Paresh Kishor. <i>Plurality Consensus in Hybrid Networks</i>. 2020.","bibtex":"@book{Yeole_2020, title={Plurality Consensus in Hybrid Networks}, author={Yeole, Paresh Kishor}, year={2020} }"},"year":"2020","author":[{"first_name":"Paresh Kishor","last_name":"Yeole","full_name":"Yeole, Paresh Kishor"}],"supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_created":"2020-10-29T07:45:57Z","date_updated":"2022-01-06T06:54:23Z","title":"Plurality Consensus in Hybrid Networks","type":"mastersthesis","status":"public","department":[{"_id":"79"}],"user_id":"15504","_id":"20221","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"language":[{"iso":"eng"}]},{"file":[{"date_created":"2020-07-14T07:56:52Z","creator":"tillk","date_updated":"2020-07-14T07:56:52Z","file_name":"3350755.3400281.pdf","access_level":"closed","file_id":"17373","file_size":1271416,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"lang":"eng","text":" We consider a natural extension to the metric uncapacitated Facility Location Problem (FLP) in which requests ask for different commodities out of a finite set \\( S \\) of commodities.\r\n  Ravi and Sinha (SODA 2004) introduced the model as the \\emph{Multi-Commodity Facility Location Problem} (MFLP) and considered it an offline optimization problem.\r\n  The model itself is similar to the FLP: i.e., requests are located at points of a finite metric space and the task of an algorithm is to construct facilities and assign requests to facilities while minimizing the construction cost and the sum over all assignment distances.\r\n  In addition, requests and facilities are heterogeneous; they request or offer multiple commodities out of $S$.\r\n  A request has to be connected to a set of facilities jointly offering the commodities demanded by it.\r\n  In comparison to the FLP, an algorithm has to decide not only if and where to place facilities, but also which commodities to offer at each.\r\n\r\n  To the best of our knowledge we are the first to study the problem in its online variant in which requests, their positions and their commodities are not known beforehand but revealed over time.\r\n  We present results regarding the competitive ratio.\r\n  On the one hand, we show that heterogeneity influences the competitive ratio by developing a lower bound on the competitive ratio for any randomized online algorithm of \\( \\Omega (  \\sqrt{|S|} + \\frac{\\log n}{\\log \\log n}  ) \\) that already holds for simple line metrics.\r\n  Here, \\( n \\) is the number of requests.\r\n  On the other side, we establish a deterministic \\( \\mathcal{O}(\\sqrt{|S|} \\cdot \\log n) \\)-competitive algorithm and a randomized \\( \\mathcal{O}(\\sqrt{|S|} \\cdot \\frac{\\log n}{\\log \\log n} ) \\)-competitive algorithm.\r\n  Further, we show that when considering a more special class of cost functions for the construction cost of a facility, the competitive ratio decreases given by our deterministic algorithm depending on the function."}],"publication":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","language":[{"iso":"eng"}],"keyword":["Online Multi-Commodity Facility Location","Competitive Ratio","Online Optimization","Facility Location Problem"],"ddc":["000"],"external_id":{"arxiv":["2005.08391"]},"year":"2020","title":"The Online Multi-Commodity Facility Location Problem","date_created":"2020-07-14T07:53:20Z","status":"public","type":"conference","file_date_updated":"2020-07-14T07:56:52Z","department":[{"_id":"63"}],"user_id":"39241","_id":"17370","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"citation":{"ama":"Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The Online Multi-Commodity Facility Location Problem. 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.3400281\">10.1145/3350755.3400281</a>","chicago":"Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “The Online Multi-Commodity Facility Location Problem.” In <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020. <a href=\"https://doi.org/10.1145/3350755.3400281\">https://doi.org/10.1145/3350755.3400281</a>.","ieee":"J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “The Online Multi-Commodity Facility Location Problem,” in <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020.","apa":"Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., &#38; Meyer auf der Heide, F. (2020). The Online Multi-Commodity Facility Location Problem. In <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>. <a href=\"https://doi.org/10.1145/3350755.3400281\">https://doi.org/10.1145/3350755.3400281</a>","bibtex":"@inproceedings{Castenow_Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2020, title={The Online Multi-Commodity Facility Location Problem}, DOI={<a href=\"https://doi.org/10.1145/3350755.3400281\">10.1145/3350755.3400281</a>}, booktitle={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures}, author={Castenow, Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2020} }","mla":"Castenow, Jannik, et al. “The Online Multi-Commodity Facility Location Problem.” <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020, doi:<a href=\"https://doi.org/10.1145/3350755.3400281\">10.1145/3350755.3400281</a>.","short":"J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020."},"has_accepted_license":"1","publication_identifier":{"isbn":["9781450369350"]},"publication_status":"published","doi":"10.1145/3350755.3400281","author":[{"id":"38705","full_name":"Castenow, Jannik","last_name":"Castenow","first_name":"Jannik"},{"first_name":"Björn","full_name":"Feldkord, Björn","id":"22704","last_name":"Feldkord"},{"first_name":"Till","full_name":"Knollmann, Till","id":"39241","last_name":"Knollmann","orcid":"0000-0003-2014-4696"},{"first_name":"Manuel","last_name":"Malatyali","full_name":"Malatyali, Manuel"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_updated":"2022-01-06T06:53:10Z"},{"_id":"17836","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"79"}],"user_id":"15504","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"type":"conference_editor","editor":[{"first_name":"Andrea","last_name":"Werneck Richa","full_name":"Werneck Richa, Andrea"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"status":"public","publisher":"Springer","date_updated":"2022-01-06T06:53:20Z","volume":12156,"date_created":"2020-08-12T07:54:22Z","title":"Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings","doi":"10.1007/978-3-030-54921-3","publication_identifier":{"isbn":["978-3-030-54920-6"]},"year":"2020","intvolume":"     12156","citation":{"chicago":"Werneck Richa, Andrea, and Christian Scheideler, eds. <i>Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings</i>. Vol. 12156. Lecture Notes in Computer Science. Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-54921-3\">https://doi.org/10.1007/978-3-030-54921-3</a>.","ieee":"A. Werneck Richa and C. Scheideler, Eds., <i>Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings</i>, vol. 12156. Springer, 2020.","ama":"Werneck Richa A, Scheideler C, eds. <i>Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings</i>. Vol 12156. Springer; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-54921-3\">10.1007/978-3-030-54921-3</a>","apa":"Werneck Richa, A., &#38; Scheideler, C. (Eds.). (2020). <i>Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings</i> (Vol. 12156). Springer. <a href=\"https://doi.org/10.1007/978-3-030-54921-3\">https://doi.org/10.1007/978-3-030-54921-3</a>","mla":"Werneck Richa, Andrea, and Christian Scheideler, editors. <i>Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings</i>. Vol. 12156, Springer, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-54921-3\">10.1007/978-3-030-54921-3</a>.","short":"A. Werneck Richa, C. Scheideler, eds., Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings, Springer, 2020.","bibtex":"@book{Werneck Richa_Scheideler_2020, series={Lecture Notes in Computer Science}, title={Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings}, volume={12156}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-54921-3\">10.1007/978-3-030-54921-3</a>}, publisher={Springer}, year={2020}, collection={Lecture Notes in Computer Science} }"}},{"citation":{"apa":"Scheideler, C., &#38; Spear, M. (Eds.). (2020). <i>SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020</i>. ACM. <a href=\"https://doi.org/10.1145/3350755\">https://doi.org/10.1145/3350755</a>","mla":"Scheideler, Christian, and Michael Spear, editors. <i>SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020</i>. ACM, 2020, doi:<a href=\"https://doi.org/10.1145/3350755\">10.1145/3350755</a>.","short":"C. Scheideler, M. Spear, eds., SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020, ACM, 2020.","bibtex":"@book{Scheideler_Spear_2020, title={SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020}, DOI={<a href=\"https://doi.org/10.1145/3350755\">10.1145/3350755</a>}, publisher={ACM}, year={2020} }","ieee":"C. Scheideler and M. Spear, Eds., <i>SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020</i>. ACM, 2020.","chicago":"Scheideler, Christian, and Michael Spear, eds. <i>SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020</i>. ACM, 2020. <a href=\"https://doi.org/10.1145/3350755\">https://doi.org/10.1145/3350755</a>.","ama":"Scheideler C, Spear M, eds. <i>SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020</i>. ACM; 2020. doi:<a href=\"https://doi.org/10.1145/3350755\">10.1145/3350755</a>"},"year":"2020","publication_identifier":{"isbn":["978-1-4503-6935-0"]},"doi":"10.1145/3350755","title":"SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020","date_created":"2020-08-12T07:57:10Z","date_updated":"2022-01-06T06:53:20Z","publisher":"ACM","status":"public","editor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"last_name":"Spear","full_name":"Spear, Michael","first_name":"Michael"}],"type":"conference_editor","language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"15504","_id":"17839","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}]},{"_id":"20495","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"79"}],"user_id":"15504","language":[{"iso":"eng"}],"type":"mastersthesis","status":"public","date_updated":"2022-01-06T06:54:27Z","author":[{"last_name":"Jochmaring","full_name":"Jochmaring, Moritz","first_name":"Moritz"}],"date_created":"2020-11-25T07:03:16Z","supervisor":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"title":"A self stabilizing protocol for well-formed trees in hybrid networks","year":"2020","citation":{"mla":"Jochmaring, Moritz. <i>A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks</i>. 2020.","short":"M. Jochmaring, A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks, 2020.","bibtex":"@book{Jochmaring_2020, title={A self stabilizing protocol for well-formed trees in hybrid networks}, author={Jochmaring, Moritz}, year={2020} }","apa":"Jochmaring, M. (2020). <i>A self stabilizing protocol for well-formed trees in hybrid networks</i>.","ama":"Jochmaring M. <i>A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks</i>.; 2020.","ieee":"M. Jochmaring, <i>A self stabilizing protocol for well-formed trees in hybrid networks</i>. 2020.","chicago":"Jochmaring, Moritz. <i>A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks</i>, 2020."}}]