--- _id: '33968' citation: ama: Scheideler C, ed. 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA. Vol 246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. apa: Scheideler, C. (Ed.). (2022). 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA (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} }' chicago: Scheideler, Christian, ed. 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA. Vol. 246. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. ieee: C. Scheideler, Ed., 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA, vol. 246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. mla: Scheideler, Christian, editor. 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. 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. date_created: 2022-11-02T08:55:30Z date_updated: 2022-11-02T08:56:13Z department: - _id: '79' editor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler intvolume: ' 246' language: - iso: eng 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' publication_identifier: isbn: - 978-3-95977-255-6 publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik series_title: LIPIcs status: public title: 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA type: conference_editor user_id: '15504' volume: 246 year: '2022' ... --- _id: '30239' author: - first_name: Christina full_name: Kolb, Christina last_name: Kolb citation: ama: Kolb C. Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks.; 2022. doi:10.17619/UNIPB/1-1673 apa: Kolb, C. (2022). Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks. https://doi.org/10.17619/UNIPB/1-1673 bibtex: '@book{Kolb_2022, title={Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks}, DOI={10.17619/UNIPB/1-1673 }, author={Kolb, Christina}, year={2022} }' chicago: Kolb, Christina. Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks, 2022. https://doi.org/10.17619/UNIPB/1-1673 . ieee: C. Kolb, Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks. 2022. mla: Kolb, Christina. Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks. 2022, doi:10.17619/UNIPB/1-1673 . short: C. Kolb, Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks, 2022. date_created: 2022-03-11T06:05:54Z date_updated: 2023-03-17T07:22:04Z department: - _id: '79' doi: '10.17619/UNIPB/1-1673 ' language: - iso: eng 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' status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks type: dissertation user_id: '15504' year: '2022' ... --- _id: '21096' 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. article_number: '104697' author: - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: Knollmann T, Scheideler C. A self-stabilizing Hashed Patricia Trie. Information and Computation. Published online 2022. doi:10.1016/j.ic.2021.104697 apa: Knollmann, T., & Scheideler, C. (2022). A self-stabilizing Hashed Patricia Trie. Information and Computation, Article 104697. https://doi.org/10.1016/j.ic.2021.104697 bibtex: '@article{Knollmann_Scheideler_2022, title={A self-stabilizing Hashed Patricia Trie}, DOI={10.1016/j.ic.2021.104697}, number={104697}, journal={Information and Computation}, author={Knollmann, Till and Scheideler, Christian}, year={2022} }' chicago: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” Information and Computation, 2022. https://doi.org/10.1016/j.ic.2021.104697. ieee: 'T. Knollmann and C. Scheideler, “A self-stabilizing Hashed Patricia Trie,” Information and Computation, Art. no. 104697, 2022, doi: 10.1016/j.ic.2021.104697.' mla: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” Information and Computation, 104697, 2022, doi:10.1016/j.ic.2021.104697. short: T. Knollmann, C. Scheideler, Information and Computation (2022). date_created: 2021-01-29T09:39:40Z date_updated: 2023-03-27T07:56:48Z department: - _id: '63' - _id: '79' doi: 10.1016/j.ic.2021.104697 language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Information and Computation publication_identifier: issn: - 0890-5401 publication_status: published status: public title: A self-stabilizing Hashed Patricia Trie type: journal_article user_id: '15504' year: '2022' ... --- _id: '24887' author: - first_name: Kristian full_name: Hinnenthal, Kristian id: '32229' last_name: Hinnenthal citation: ama: Hinnenthal K. Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter.; 2021. doi:10.17619/UNIPB/1-1169 apa: Hinnenthal, K. (2021). Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter. https://doi.org/10.17619/UNIPB/1-1169 bibtex: '@book{Hinnenthal_2021, title={Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter}, DOI={10.17619/UNIPB/1-1169 }, author={Hinnenthal, Kristian}, year={2021} }' chicago: Hinnenthal, Kristian. Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter, 2021. https://doi.org/10.17619/UNIPB/1-1169 . ieee: K. Hinnenthal, Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter. 2021. mla: Hinnenthal, Kristian. Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter. 2021, doi:10.17619/UNIPB/1-1169 . short: K. Hinnenthal, Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter, 2021. date_created: 2021-09-22T12:33:44Z date_updated: 2022-01-06T06:56:40Z department: - _id: '79' doi: '10.17619/UNIPB/1-1169 ' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter type: dissertation user_id: '15504' year: '2021' ... --- _id: '27053' author: - first_name: Leon full_name: Everling, Leon last_name: Everling citation: ama: Everling L. Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme.; 2021. apa: Everling, L. (2021). Selbststabilisierender Bakery Algorithmus für verteilte Systeme. bibtex: '@book{Everling_2021, title={Selbststabilisierender Bakery Algorithmus für verteilte Systeme}, author={Everling, Leon}, year={2021} }' chicago: Everling, Leon. Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme, 2021. ieee: L. Everling, Selbststabilisierender Bakery Algorithmus für verteilte Systeme. 2021. mla: Everling, Leon. Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme. 2021. short: L. Everling, Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme, 2021. date_created: 2021-11-02T10:13:51Z date_updated: 2022-01-06T06:57:33Z department: - _id: '79' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Selbststabilisierender Bakery Algorithmus für verteilte Systeme type: bachelorsthesis user_id: '15504' year: '2021' ... --- _id: '27072' author: - first_name: Vaibhav full_name: Adsul, Vaibhav last_name: Adsul citation: ama: Adsul V. Peer-to-Peer Matching for Distributed Systems.; 2021. apa: Adsul, V. (2021). Peer-to-Peer Matching for Distributed Systems. bibtex: '@book{Adsul_2021, title={Peer-to-Peer Matching for Distributed Systems}, author={Adsul, Vaibhav}, year={2021} }' chicago: Adsul, Vaibhav. Peer-to-Peer Matching for Distributed Systems, 2021. ieee: V. Adsul, Peer-to-Peer Matching for Distributed Systems. 2021. mla: Adsul, Vaibhav. Peer-to-Peer Matching for Distributed Systems. 2021. short: V. Adsul, Peer-to-Peer Matching for Distributed Systems, 2021. date_created: 2021-11-03T06:12:47Z date_updated: 2022-01-06T06:57:33Z department: - _id: '79' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Peer-to-Peer Matching for Distributed Systems type: mastersthesis user_id: '15504' year: '2021' ... --- _id: '21084' author: - first_name: Julian full_name: Werthmann, Julian id: '50024' last_name: Werthmann citation: 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} }' chicago: Werthmann, Julian. 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. 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. date_created: 2021-01-26T13:58:14Z date_updated: 2022-01-06T06:54:44Z department: - _id: '79' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Derandomization and Local Graph Problems in the Node-Capacitated Clique type: mastersthesis user_id: '15504' year: '2021' ... --- _id: '21197' author: - first_name: Ma full_name: Mengshi, Ma last_name: Mengshi citation: ama: Mengshi M. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter.; 2021. apa: Mengshi, M. (2021). Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter. bibtex: '@book{Mengshi_2021, title={Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter}, author={Mengshi, Ma}, year={2021} }' chicago: Mengshi, Ma. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter, 2021. ieee: M. Mengshi, Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter. 2021. mla: Mengshi, Ma. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter. 2021. short: M. Mengshi, Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter, 2021. date_created: 2021-02-09T07:09:22Z date_updated: 2022-01-06T06:54:49Z department: - _id: '79' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '4' name: SFB 901 - Project Area C - _id: '5' name: SFB 901 - Subproject A1 - _id: '13' name: SFB 901 - Subproject C1 status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter type: bachelorsthesis user_id: '15504' year: '2021' ... --- _id: '21628' 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" author: - first_name: Michael full_name: Feldmann, Michael id: '23538' last_name: Feldmann citation: ama: Feldmann M. Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks.; 2021. doi:10.17619/UNIPB/1-1113 apa: Feldmann, M. (2021). Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks. https://doi.org/10.17619/UNIPB/1-1113 bibtex: '@book{Feldmann_2021, title={Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks}, DOI={10.17619/UNIPB/1-1113}, author={Feldmann, Michael}, year={2021} }' chicago: Feldmann, Michael. Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks, 2021. https://doi.org/10.17619/UNIPB/1-1113. ieee: M. Feldmann, Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks. 2021. mla: Feldmann, Michael. Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks. 2021, doi:10.17619/UNIPB/1-1113. short: M. Feldmann, Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks, 2021. date_created: 2021-04-15T08:23:52Z date_updated: 2022-01-06T06:55:08Z ddc: - '006' department: - _id: '79' doi: 10.17619/UNIPB/1-1113 file: - access_level: closed content_type: application/pdf creator: mfeldma2 date_created: 2021-04-15T08:21:15Z date_updated: 2021-04-15T08:21:15Z file_id: '21629' file_name: Dissertation_Michael_Feldmann.pdf file_size: 2617069 relation: main_file success: 1 file_date_updated: 2021-04-15T08:21:15Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks type: dissertation user_id: '23538' year: '2021' ... --- _id: '20683' author: - 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 full_name: Malatyali, Manuel id: '41265' last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. Managing Multiple Mobile Resources. Theory of Computing Systems. 2021;65:943–984. doi:10.1007/s00224-020-10023-8 apa: Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der Heide, F. (2021). Managing Multiple Mobile Resources. Theory of Computing Systems, 65, 943–984. https://doi.org/10.1007/s00224-020-10023-8 bibtex: '@article{Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2021, title={Managing Multiple Mobile Resources}, volume={65}, DOI={10.1007/s00224-020-10023-8}, 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} }' chicago: 'Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Managing Multiple Mobile Resources.” Theory of Computing Systems 65 (2021): 943–984. https://doi.org/10.1007/s00224-020-10023-8.' ieee: 'B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing Multiple Mobile Resources,” Theory of Computing Systems, vol. 65, pp. 943–984, 2021, doi: 10.1007/s00224-020-10023-8.' mla: Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” Theory of Computing Systems, vol. 65, 2021, pp. 943–984, doi:10.1007/s00224-020-10023-8. short: B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, Theory of Computing Systems 65 (2021) 943–984. date_created: 2020-12-08T08:40:10Z date_updated: 2022-01-06T06:54:31Z department: - _id: '63' doi: 10.1007/s00224-020-10023-8 intvolume: ' 65' language: - iso: eng page: 943–984 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Theory of Computing Systems publication_status: published status: public title: Managing Multiple Mobile Resources type: journal_article user_id: '15415' volume: 65 year: '2021' ... --- _id: '20817' author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Pawel full_name: Schmidt, Pawel last_name: Schmidt citation: ama: 'Bienkowski M, Feldkord B, Schmidt P. A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. In: Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS). ; 2021:14:1-14:17. doi:10.4230/LIPIcs.STACS.2021.14' apa: Bienkowski, M., Feldkord, B., & Schmidt, P. (2021). A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. In Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS) (pp. 14:1-14:17). https://doi.org/10.4230/LIPIcs.STACS.2021.14 bibtex: '@inproceedings{Bienkowski_Feldkord_Schmidt_2021, title={A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location}, DOI={10.4230/LIPIcs.STACS.2021.14}, 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} }' chicago: Bienkowski, Marcin, Björn Feldkord, and Pawel Schmidt. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.” In Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 14:1-14:17, 2021. https://doi.org/10.4230/LIPIcs.STACS.2021.14. ieee: M. Bienkowski, B. Feldkord, and P. Schmidt, “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location,” in Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17. mla: Bienkowski, Marcin, et al. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.” Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17, doi:10.4230/LIPIcs.STACS.2021.14. 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.' date_created: 2020-12-21T13:46:16Z date_updated: 2022-01-06T06:54:40Z department: - _id: '63' doi: 10.4230/LIPIcs.STACS.2021.14 language: - iso: eng page: 14:1 - 14:17 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS) publication_status: published status: public title: A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location type: conference user_id: '22704' year: '2021' ... --- _id: '22283' abstract: - lang: eng 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$." author: - first_name: Thorsten full_name: Götte, Thorsten id: '34727' last_name: Götte - first_name: Kristian full_name: Hinnenthal, Kristian id: '32229' last_name: Hinnenthal - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Julian full_name: Werthmann, Julian id: '50024' last_name: Werthmann citation: 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' 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.' 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. 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. 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.' conference: end_date: 2021-07-30 location: Virtual name: ACM Symposium on Principles of Distributed Computing (PODC) start_date: 2021-07-26 date_created: 2021-06-06T19:10:26Z date_updated: 2022-01-06T06:55:30Z ddc: - '000' department: - _id: '34' doi: 10.1145/3465084.3467932 editor: - first_name: Keren full_name: Censor-Hillel, Keren last_name: Censor-Hillel file: - access_level: closed content_type: application/pdf creator: thgoette date_created: 2021-06-06T19:12:49Z date_updated: 2021-06-06T19:12:49Z file_id: '22284' file_name: Wicked_Fast_Overlay_Construction(1).pdf file_size: 590875 relation: main_file success: 1 file_date_updated: 2021-06-06T19:12:49Z has_accepted_license: '1' language: - iso: eng place: New York project: - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 - _id: '4' name: SFB 901 - Project Area C - _id: '13' name: SFB 901 - Subproject C1 - _id: '1' name: SFB 901 publication: Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC '21) publication_status: accepted publisher: ACM status: public title: Time-Optimal Construction of Overlays type: conference user_id: '477' year: '2021' ... --- _id: '26888' author: - first_name: Thorsten full_name: Götte, Thorsten id: '34727' last_name: Götte - first_name: Christina full_name: Kolb, Christina id: '43647' last_name: Kolb - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Julian full_name: Werthmann, Julian id: '50024' last_name: Werthmann citation: 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' 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} }' 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.' 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.' 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.' short: 'T. Götte, C. Kolb, C. Scheideler, J. Werthmann, in: Algorithms for Sensor Systems (ALGOSENSORS ’21), Cham, 2021.' conference: location: Lisbon, Portgual name: ALGOSENSORS 2021 date_created: 2021-10-26T12:06:04Z date_updated: 2022-11-18T10:01:36Z doi: 10.1007/978-3-030-89240-1_7 language: - iso: eng place: Cham project: - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 - _id: '1' name: 'SFB 901: SFB 901' publication: Algorithms for Sensor Systems (ALGOSENSORS '21) publication_identifier: issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: 'Beep-And-Sleep: Message and Energy Efficient Set Cover' type: book_chapter user_id: '477' year: '2021' ... --- _id: '44234' author: - first_name: Thilo Frederik full_name: Berger, Thilo Frederik last_name: Berger citation: ama: Berger TF. Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation.; 2021. apa: Berger, T. F. (2021). Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation. bibtex: '@book{Berger_2021, title={Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation}, author={Berger, Thilo Frederik}, year={2021} }' chicago: Berger, Thilo Frederik. Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation, 2021. ieee: T. F. Berger, Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation. 2021. mla: Berger, Thilo Frederik. Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation. 2021. short: T.F. Berger, Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation, 2021. date_created: 2023-04-27T15:34:07Z date_updated: 2023-04-27T15:34:17Z department: - _id: '63' language: - iso: eng 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' status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation type: bachelorsthesis user_id: '39241' year: '2021' ... --- _id: '44233' author: - first_name: Sebastian full_name: Pranger, Sebastian last_name: Pranger citation: ama: Pranger S. Online K-Facility Reallocation Using k-Server Algorithms.; 2021. apa: Pranger, S. (2021). Online k-Facility Reallocation using k-Server Algorithms. bibtex: '@book{Pranger_2021, title={Online k-Facility Reallocation using k-Server Algorithms}, author={Pranger, Sebastian}, year={2021} }' chicago: Pranger, Sebastian. Online K-Facility Reallocation Using k-Server Algorithms, 2021. ieee: S. Pranger, Online k-Facility Reallocation using k-Server Algorithms. 2021. mla: Pranger, Sebastian. Online K-Facility Reallocation Using k-Server Algorithms. 2021. short: S. Pranger, Online K-Facility Reallocation Using k-Server Algorithms, 2021. date_created: 2023-04-27T15:31:26Z date_updated: 2023-04-27T15:31:57Z department: - _id: '63' language: - iso: eng 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' status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Online k-Facility Reallocation using k-Server Algorithms type: bachelorsthesis user_id: '39241' year: '2021' ... --- _id: '20221' author: - first_name: Paresh Kishor full_name: Yeole, Paresh Kishor last_name: Yeole citation: ama: Yeole PK. Plurality Consensus in Hybrid Networks.; 2020. apa: Yeole, P. K. (2020). Plurality Consensus in Hybrid Networks. bibtex: '@book{Yeole_2020, title={Plurality Consensus in Hybrid Networks}, author={Yeole, Paresh Kishor}, year={2020} }' chicago: Yeole, Paresh Kishor. Plurality Consensus in Hybrid Networks, 2020. ieee: P. K. Yeole, Plurality Consensus in Hybrid Networks. 2020. mla: Yeole, Paresh Kishor. Plurality Consensus in Hybrid Networks. 2020. short: P.K. Yeole, Plurality Consensus in Hybrid Networks, 2020. date_created: 2020-10-29T07:45:57Z date_updated: 2022-01-06T06:54:23Z department: - _id: '79' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Plurality Consensus in Hybrid Networks type: mastersthesis user_id: '15504' year: '2020' ... --- _id: '17370' 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." author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - 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 full_name: Malatyali, Manuel last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The Online Multi-Commodity Facility Location Problem. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures. ; 2020. doi:10.1145/3350755.3400281' apa: Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der Heide, F. (2020). The Online Multi-Commodity Facility Location Problem. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures. https://doi.org/10.1145/3350755.3400281 bibtex: '@inproceedings{Castenow_Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2020, title={The Online Multi-Commodity Facility Location Problem}, DOI={10.1145/3350755.3400281}, 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} }' chicago: Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “The Online Multi-Commodity Facility Location Problem.” In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020. https://doi.org/10.1145/3350755.3400281. ieee: J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “The Online Multi-Commodity Facility Location Problem,” in Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020. mla: Castenow, Jannik, et al. “The Online Multi-Commodity Facility Location Problem.” Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020, doi:10.1145/3350755.3400281. 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.' date_created: 2020-07-14T07:53:20Z date_updated: 2022-01-06T06:53:10Z ddc: - '000' department: - _id: '63' doi: 10.1145/3350755.3400281 external_id: arxiv: - '2005.08391' file: - access_level: closed content_type: application/pdf creator: tillk date_created: 2020-07-14T07:56:52Z date_updated: 2020-07-14T07:56:52Z file_id: '17373' file_name: 3350755.3400281.pdf file_size: 1271416 relation: main_file success: 1 file_date_updated: 2020-07-14T07:56:52Z has_accepted_license: '1' keyword: - Online Multi-Commodity Facility Location - Competitive Ratio - Online Optimization - Facility Location Problem language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures publication_identifier: isbn: - '9781450369350' publication_status: published status: public title: The Online Multi-Commodity Facility Location Problem type: conference user_id: '39241' year: '2020' ... --- _id: '17836' citation: ama: Werneck Richa A, Scheideler C, eds. Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings. Vol 12156. Springer; 2020. doi:10.1007/978-3-030-54921-3 apa: Werneck Richa, A., & Scheideler, C. (Eds.). (2020). Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings (Vol. 12156). Springer. https://doi.org/10.1007/978-3-030-54921-3 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={10.1007/978-3-030-54921-3}, publisher={Springer}, year={2020}, collection={Lecture Notes in Computer Science} }' chicago: Werneck Richa, Andrea, and Christian Scheideler, eds. Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings. Vol. 12156. Lecture Notes in Computer Science. Springer, 2020. https://doi.org/10.1007/978-3-030-54921-3. ieee: A. Werneck Richa and C. Scheideler, Eds., Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings, vol. 12156. Springer, 2020. mla: Werneck Richa, Andrea, and Christian Scheideler, editors. Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings. Vol. 12156, Springer, 2020, doi:10.1007/978-3-030-54921-3. 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. date_created: 2020-08-12T07:54:22Z date_updated: 2022-01-06T06:53:20Z department: - _id: '79' doi: 10.1007/978-3-030-54921-3 editor: - first_name: Andrea full_name: Werneck Richa, Andrea last_name: Werneck Richa - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler intvolume: ' 12156' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subproject A1 - _id: '2' name: SFB 901 - Project Area A publication_identifier: isbn: - 978-3-030-54920-6 publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings type: conference_editor user_id: '15504' volume: 12156 year: '2020' ... --- _id: '17839' citation: ama: 'Scheideler C, Spear M, eds. SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM; 2020. doi:10.1145/3350755' apa: 'Scheideler, C., & Spear, M. (Eds.). (2020). SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM. https://doi.org/10.1145/3350755' 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={10.1145/3350755}, publisher={ACM}, year={2020} }' chicago: 'Scheideler, Christian, and Michael Spear, eds. SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM, 2020. https://doi.org/10.1145/3350755.' ieee: 'C. Scheideler and M. Spear, Eds., SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM, 2020.' mla: 'Scheideler, Christian, and Michael Spear, editors. SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM, 2020, doi:10.1145/3350755.' 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.' date_created: 2020-08-12T07:57:10Z date_updated: 2022-01-06T06:53:20Z department: - _id: '79' doi: 10.1145/3350755 editor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Michael full_name: Spear, Michael last_name: Spear language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication_identifier: isbn: - 978-1-4503-6935-0 publisher: ACM status: public title: 'SPAA ''20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020' type: conference_editor user_id: '15504' year: '2020' ... --- _id: '20495' author: - first_name: Moritz full_name: Jochmaring, Moritz last_name: Jochmaring citation: ama: Jochmaring M. A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks.; 2020. apa: Jochmaring, M. (2020). A self stabilizing protocol for well-formed trees in hybrid networks. bibtex: '@book{Jochmaring_2020, title={A self stabilizing protocol for well-formed trees in hybrid networks}, author={Jochmaring, Moritz}, year={2020} }' chicago: Jochmaring, Moritz. A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks, 2020. ieee: M. Jochmaring, A self stabilizing protocol for well-formed trees in hybrid networks. 2020. mla: Jochmaring, Moritz. A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks. 2020. short: M. Jochmaring, A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks, 2020. date_created: 2020-11-25T07:03:16Z date_updated: 2022-01-06T06:54:27Z department: - _id: '79' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subproject A1 - _id: '2' name: SFB 901 - Project Area A status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: A self stabilizing protocol for well-formed trees in hybrid networks type: mastersthesis user_id: '15504' year: '2020' ...