[{"title":"A self-stabilizing Hashed Patricia Trie","status":"public","year":"2022","publication_identifier":{"issn":["0890-5401"]},"author":[{"id":"39241","last_name":"Knollmann","orcid":"0000-0003-2014-4696","first_name":"Till","full_name":"Knollmann, Till"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"date_updated":"2023-03-27T07:56:48Z","publication_status":"published","article_number":"104697","language":[{"iso":"eng"}],"_id":"21096","doi":"10.1016/j.ic.2021.104697","user_id":"15504","publication":"Information and Computation","citation":{"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>","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>.","short":"T. Knollmann, C. Scheideler, Information and Computation (2022).","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>.","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>.","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>","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} }"},"abstract":[{"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.","lang":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"date_created":"2021-01-29T09:39:40Z","type":"journal_article","department":[{"_id":"63"},{"_id":"79"}]},{"date_updated":"2022-01-06T06:56:40Z","status":"public","title":"Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter","year":"2021","author":[{"last_name":"Hinnenthal","first_name":"Kristian","full_name":"Hinnenthal, Kristian","id":"32229"}],"doi":"10.17619/UNIPB/1-1169 ","user_id":"15504","_id":"24887","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"supervisor":[{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"citation":{"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>.","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>","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} }","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>","ieee":"K. Hinnenthal, <i>Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter</i>. 2021.","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>.","short":"K. Hinnenthal, Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter, 2021."},"type":"dissertation","department":[{"_id":"79"}],"date_created":"2021-09-22T12:33:44Z"},{"file":[{"date_created":"2021-09-29T12:34:47Z","creator":"liedtke","file_id":"25128","content_type":"application/pdf","relation":"main_file","date_updated":"2021-09-29T12:34:47Z","file_name":"Master - Thesis.pdf","access_level":"local","file_size":10114825}],"date_created":"2021-09-29T12:37:39Z","keyword":["Robot Exploration","Finite Automaton","Hybrid Model for Programmable Matter","Convex Hull"],"type":"mastersthesis","department":[{"_id":"79"}],"file_date_updated":"2021-09-29T12:34:47Z","citation":{"mla":"Liedtke, David Jan. <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>. 2021.","bibtex":"@book{Liedtke_2021, title={Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model}, author={Liedtke, David Jan}, year={2021} }","ama":"Liedtke DJ. <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>.; 2021.","ieee":"D. J. Liedtke, <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>. 2021.","apa":"Liedtke, D. J. (2021). <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>.","chicago":"Liedtke, David Jan. <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>, 2021.","short":"D.J. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model, 2021."},"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"abstract":[{"lang":"eng","text":"Motivated by the prospect of computing agents that explore unknown environments and construct convex hulls on the nanoscale, we investigate the capabilities and limitations of a single deterministic finite automaton robot in the three-dimensional hybrid model for programmable matter. In this model, active robots move on a set of passive tiles, called configuration, with the geometric shape of rhombic dodecahedra on the adjacency graph of the face-centered cubic sphere-packing. We show that the exploration problem is equally hard in the hybrid model and in three-dimensional mazes, in which tiles have the shape of cubes and are positioned at the vertices of $\\mathbb{Z}^3$. Thereby, a single robot with a constant number of pebbles cannot solve this problem in the hybrid model on arbitrary configurations. We provide algorithms for a robot with two pebbles that solve the exploration problem in the subclass of compact configurations of size $n$ in $\\O(n^3)$ rounds. Further, we investigate the robot's capabilities of detection and hull construction in terms of restricted orientation convexity. We show that a robot without any pebble can detect strong $\\O$-convexity in $\\O(n)$ rounds, but cannot detect weak $\\O$-convexity, not even if provided with a single pebble. Assuming that a robot can construct tiles from scratch and deconstruct previously constructed tiles, we show that the strong $\\O$-hull of any given configuration of size $n$ can be constructed in $\\O(n^4)$ rounds, even if the robot cannot distinguish constructed from native tiles."}],"language":[{"iso":"eng"}],"_id":"25126","user_id":"55557","ddc":["000"],"status":"public","title":"Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model","year":"2021","author":[{"id":"55557","full_name":"Liedtke, David Jan","first_name":"David Jan","last_name":"Liedtke"}],"date_updated":"2022-01-06T06:56:53Z","has_accepted_license":"1"},{"date_created":"2021-12-15T09:37:38Z","department":[{"_id":"79"}],"type":"conference","citation":{"mla":"Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.” <i>Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings</i>, edited by Colette Johnen et al., vol. 13046, Springer, 2021, pp. 484–88, doi:<a href=\"https://doi.org/10.1007/978-3-030-91081-5\\_34\">10.1007/978-3-030-91081-5\\_34</a>.","bibtex":"@inproceedings{Feldmann_Padalkin_Scheideler_Dolev_2021, series={Lecture Notes in Computer Science}, title={Coordinating Amoebots via Reconfigurable Circuits}, volume={13046}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-91081-5\\_34\">10.1007/978-3-030-91081-5\\_34</a>}, booktitle={Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings}, publisher={Springer}, author={Feldmann, Michael and Padalkin, Andreas and Scheideler, Christian and Dolev, Shlomi}, editor={Johnen, Colette and Michael Schiller, Elad and Schmid, Stefan}, year={2021}, pages={484–488}, collection={Lecture Notes in Computer Science} }","ama":"Feldmann M, Padalkin A, Scheideler C, Dolev S. Coordinating Amoebots via Reconfigurable Circuits. In: Johnen C, Michael Schiller E, Schmid S, eds. <i>Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings</i>. Vol 13046. Lecture Notes in Computer Science. Springer; 2021:484-488. doi:<a href=\"https://doi.org/10.1007/978-3-030-91081-5\\_34\">10.1007/978-3-030-91081-5\\_34</a>","ieee":"M. Feldmann, A. Padalkin, C. Scheideler, and S. Dolev, “Coordinating Amoebots via Reconfigurable Circuits,” in <i>Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings</i>, 2021, vol. 13046, pp. 484–488, doi: <a href=\"https://doi.org/10.1007/978-3-030-91081-5\\_34\">10.1007/978-3-030-91081-5\\_34</a>.","apa":"Feldmann, M., Padalkin, A., Scheideler, C., &#38; Dolev, S. (2021). Coordinating Amoebots via Reconfigurable Circuits. In C. Johnen, E. Michael Schiller, &#38; S. Schmid (Eds.), <i>Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings</i> (Vol. 13046, pp. 484–488). Springer. <a href=\"https://doi.org/10.1007/978-3-030-91081-5\\_34\">https://doi.org/10.1007/978-3-030-91081-5\\_34</a>","short":"M. Feldmann, A. Padalkin, C. Scheideler, S. Dolev, in: C. Johnen, E. Michael Schiller, S. Schmid (Eds.), Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, Springer, 2021, pp. 484–488.","chicago":"Feldmann, Michael, Andreas Padalkin, Christian Scheideler, and Shlomi Dolev. “Coordinating Amoebots via Reconfigurable Circuits.” In <i>Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings</i>, edited by Colette Johnen, Elad Michael Schiller, and Stefan Schmid, 13046:484–88. Lecture Notes in Computer Science. Springer, 2021. <a href=\"https://doi.org/10.1007/978-3-030-91081-5\\_34\">https://doi.org/10.1007/978-3-030-91081-5\\_34</a>."},"publication":"Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings","language":[{"iso":"eng"}],"_id":"28917","series_title":"Lecture Notes in Computer Science","publisher":"Springer","page":"484-488","editor":[{"full_name":"Johnen, Colette","first_name":"Colette","last_name":"Johnen"},{"last_name":"Michael Schiller","first_name":"Elad","full_name":"Michael Schiller, Elad"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"}],"volume":13046,"doi":"10.1007/978-3-030-91081-5\\_34","user_id":"15504","author":[{"full_name":"Feldmann, Michael","last_name":"Feldmann","first_name":"Michael"},{"id":"88238","full_name":"Padalkin, Andreas","last_name":"Padalkin","first_name":"Andreas"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"first_name":"Shlomi","last_name":"Dolev","full_name":"Dolev, Shlomi"}],"title":"Coordinating Amoebots via Reconfigurable Circuits","status":"public","year":"2021","intvolume":"     13046","date_updated":"2022-01-06T06:58:41Z"},{"language":[{"iso":"eng"}],"_id":"28998","user_id":"15504","year":"2021","title":"Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers","status":"public","author":[{"last_name":"Suermann","first_name":"Dennis","full_name":"Suermann, Dennis"}],"date_updated":"2022-01-06T06:58:43Z","date_created":"2021-12-16T06:41:25Z","type":"bachelorsthesis","department":[{"_id":"79"}],"supervisor":[{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"citation":{"apa":"Suermann, D. (2021). <i>Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers</i>.","ieee":"D. Suermann, <i>Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers</i>. 2021.","chicago":"Suermann, Dennis. <i>Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers</i>, 2021.","short":"D. Suermann, Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers, 2021.","mla":"Suermann, Dennis. <i>Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers</i>. 2021.","ama":"Suermann D. <i>Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers</i>.; 2021.","bibtex":"@book{Suermann_2021, title={Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers}, author={Suermann, Dennis}, year={2021} }"},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}]},{"language":[{"iso":"eng"}],"_id":"27053","user_id":"15504","author":[{"full_name":"Everling, Leon","last_name":"Everling","first_name":"Leon"}],"status":"public","year":"2021","title":"Selbststabilisierender Bakery Algorithmus für verteilte Systeme","date_updated":"2022-01-06T06:57:33Z","date_created":"2021-11-02T10:13:51Z","department":[{"_id":"79"}],"type":"bachelorsthesis","supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"citation":{"short":"L. Everling, Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme, 2021.","chicago":"Everling, Leon. <i>Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme</i>, 2021.","apa":"Everling, L. (2021). <i>Selbststabilisierender Bakery Algorithmus für verteilte Systeme</i>.","ieee":"L. Everling, <i>Selbststabilisierender Bakery Algorithmus für verteilte Systeme</i>. 2021.","ama":"Everling L. <i>Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme</i>.; 2021.","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."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}]},{"title":"Peer-to-Peer Matching for Distributed Systems","status":"public","year":"2021","author":[{"full_name":"Adsul, Vaibhav","first_name":"Vaibhav","last_name":"Adsul"}],"date_updated":"2022-01-06T06:57:33Z","_id":"27072","language":[{"iso":"eng"}],"user_id":"15504","citation":{"ieee":"V. Adsul, <i>Peer-to-Peer Matching for Distributed Systems</i>. 2021.","apa":"Adsul, V. (2021). <i>Peer-to-Peer Matching for Distributed Systems</i>.","short":"V. Adsul, Peer-to-Peer Matching for Distributed Systems, 2021.","chicago":"Adsul, Vaibhav. <i>Peer-to-Peer Matching for Distributed Systems</i>, 2021.","mla":"Adsul, Vaibhav. <i>Peer-to-Peer Matching for Distributed Systems</i>. 2021.","bibtex":"@book{Adsul_2021, title={Peer-to-Peer Matching for Distributed Systems}, author={Adsul, Vaibhav}, year={2021} }","ama":"Adsul V. <i>Peer-to-Peer Matching for Distributed Systems</i>.; 2021."},"supervisor":[{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"date_created":"2021-11-03T06:12:47Z","type":"mastersthesis","department":[{"_id":"79"}]},{"date_created":"2021-01-26T13:58:14Z","type":"mastersthesis","department":[{"_id":"79"}],"supervisor":[{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"citation":{"short":"J. Werthmann, Derandomization and Local Graph Problems in the Node-Capacitated Clique, 2021.","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.","apa":"Werthmann, J. (2021). <i>Derandomization and Local Graph Problems in the Node-Capacitated Clique</i>.","bibtex":"@book{Werthmann_2021, title={Derandomization and Local Graph Problems in the Node-Capacitated Clique}, author={Werthmann, Julian}, year={2021} }","ama":"Werthmann J. <i>Derandomization and Local Graph Problems in the Node-Capacitated Clique</i>.; 2021.","mla":"Werthmann, Julian. <i>Derandomization and Local Graph Problems in the Node-Capacitated Clique</i>. 2021."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"21084","language":[{"iso":"eng"}],"user_id":"15504","title":"Derandomization and Local Graph Problems in the Node-Capacitated Clique","year":"2021","status":"public","author":[{"last_name":"Werthmann","first_name":"Julian","full_name":"Werthmann, Julian","id":"50024"}],"date_updated":"2022-01-06T06:54:44Z"},{"author":[{"last_name":"Mengshi","first_name":"Ma","full_name":"Mengshi, Ma"}],"title":"Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter","year":"2021","status":"public","date_updated":"2022-01-06T06:54:49Z","_id":"21197","language":[{"iso":"eng"}],"user_id":"15504","supervisor":[{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"citation":{"apa":"Mengshi, M. (2021). <i>Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter</i>.","ieee":"M. Mengshi, <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.","chicago":"Mengshi, Ma. <i>Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter</i>, 2021.","mla":"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.","bibtex":"@book{Mengshi_2021, title={Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter}, author={Mengshi, Ma}, year={2021} }"},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"date_created":"2021-02-09T07:09:22Z","department":[{"_id":"79"}],"type":"bachelorsthesis"},{"date_updated":"2022-01-06T06:55:08Z","title":"Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model","year":"2021","status":"public","author":[{"last_name":"Liedtke","first_name":"David","full_name":"Liedtke, David"}],"user_id":"15504","_id":"21627","language":[{"iso":"eng"}],"citation":{"apa":"Liedtke, D. (2021). <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>.","mla":"Liedtke, David. <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>. 2021.","ieee":"D. Liedtke, <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>. 2021.","chicago":"Liedtke, David. <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>, 2021.","short":"D. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model, 2021.","ama":"Liedtke D. <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>.; 2021.","bibtex":"@book{Liedtke_2021, title={Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model}, author={Liedtke, David}, year={2021} }"},"supervisor":[{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"type":"mastersthesis","department":[{"_id":"79"}],"date_created":"2021-04-15T05:51:43Z"},{"has_accepted_license":"1","date_updated":"2022-01-06T06:55:08Z","author":[{"full_name":"Feldmann, Michael","first_name":"Michael","last_name":"Feldmann","id":"23538"}],"title":"Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks","year":"2021","status":"public","ddc":["006"],"doi":"10.17619/UNIPB/1-1113","user_id":"23538","language":[{"iso":"eng"}],"_id":"21628","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"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"}],"supervisor":[{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"citation":{"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>.","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} }","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>","ieee":"M. Feldmann, <i>Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks</i>. 2021.","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>","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>.","short":"M. Feldmann, Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks, 2021."},"file_date_updated":"2021-04-15T08:21:15Z","department":[{"_id":"79"}],"type":"dissertation","date_created":"2021-04-15T08:23:52Z","file":[{"date_created":"2021-04-15T08:21:15Z","creator":"mfeldma2","file_id":"21629","content_type":"application/pdf","success":1,"file_name":"Dissertation_Michael_Feldmann.pdf","access_level":"closed","file_size":2617069,"relation":"main_file","date_updated":"2021-04-15T08:21:15Z"}]},{"citation":{"ieee":"S. Coy <i>et al.</i>, “Near-Shortest Path Routing in Hybrid Communication Networks,” in <i>25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France</i>, 2021, vol. 217, p. 11:1–11:23, doi: <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2021.11\">10.4230/LIPIcs.OPODIS.2021.11</a>.","apa":"Coy, S., Czumaj, A., Feldmann, M., Hinnenthal, K., Kuhn, F., Scheideler, C., Schneider, P., &#38; Struijs, M. (2021). Near-Shortest Path Routing in Hybrid Communication Networks. In Q. Bramas, V. Gramoli, &#38; A. Milani (Eds.), <i>25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France</i> (Vol. 217, p. 11:1–11:23). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2021.11\">https://doi.org/10.4230/LIPIcs.OPODIS.2021.11</a>","short":"S. Coy, A. Czumaj, M. Feldmann, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, M. Struijs, in: Q. Bramas, V. Gramoli, A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 11:1–11:23.","chicago":"Coy, Sam, Artur Czumaj, Michael Feldmann, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider, and Martijn Struijs. “Near-Shortest Path Routing in Hybrid Communication Networks.” In <i>25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France</i>, edited by Quentin Bramas, Vincent Gramoli, and Alessia Milani, 217:11:1–11:23. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2021.11\">https://doi.org/10.4230/LIPIcs.OPODIS.2021.11</a>.","mla":"Coy, Sam, et al. “Near-Shortest Path Routing in Hybrid Communication Networks.” <i>25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France</i>, edited by Quentin Bramas et al., vol. 217, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 11:1–11:23, doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2021.11\">10.4230/LIPIcs.OPODIS.2021.11</a>.","bibtex":"@inproceedings{Coy_Czumaj_Feldmann_Hinnenthal_Kuhn_Scheideler_Schneider_Struijs_2021, series={LIPIcs}, title={Near-Shortest Path Routing in Hybrid Communication Networks}, volume={217}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2021.11\">10.4230/LIPIcs.OPODIS.2021.11</a>}, booktitle={25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Coy, Sam and Czumaj, Artur and Feldmann, Michael and Hinnenthal, Kristian and Kuhn, Fabian and Scheideler, Christian and Schneider, Philipp and Struijs, Martijn}, editor={Bramas, Quentin and Gramoli, Vincent and Milani, Alessia}, year={2021}, pages={11:1–11:23}, collection={LIPIcs} }","ama":"Coy S, Czumaj A, Feldmann M, et al. Near-Shortest Path Routing in Hybrid Communication Networks. In: Bramas Q, Gramoli V, Milani A, eds. <i>25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France</i>. Vol 217. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021:11:1–11:23. doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2021.11\">10.4230/LIPIcs.OPODIS.2021.11</a>"},"publication":"25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France","date_created":"2022-03-09T10:43:28Z","department":[{"_id":"79"}],"type":"conference","author":[{"last_name":"Coy","first_name":"Sam","full_name":"Coy, Sam"},{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"last_name":"Feldmann","first_name":"Michael","full_name":"Feldmann, Michael"},{"last_name":"Hinnenthal","first_name":"Kristian","full_name":"Hinnenthal, Kristian"},{"last_name":"Kuhn","first_name":"Fabian","full_name":"Kuhn, Fabian"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"last_name":"Schneider","first_name":"Philipp","full_name":"Schneider, Philipp"},{"full_name":"Struijs, Martijn","last_name":"Struijs","first_name":"Martijn"}],"title":"Near-Shortest Path Routing in Hybrid Communication Networks","year":"2021","status":"public","intvolume":"       217","date_updated":"2022-03-09T10:46:34Z","_id":"30217","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","series_title":"LIPIcs","language":[{"iso":"eng"}],"page":"11:1–11:23","editor":[{"first_name":"Quentin","last_name":"Bramas","full_name":"Bramas, Quentin"},{"last_name":"Gramoli","first_name":"Vincent","full_name":"Gramoli, Vincent"},{"full_name":"Milani, Alessia","last_name":"Milani","first_name":"Alessia"}],"volume":217,"doi":"10.4230/LIPIcs.OPODIS.2021.11","user_id":"15504"},{"department":[{"_id":"79"}],"type":"mastersthesis","date_created":"2020-10-29T07:45:57Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"citation":{"apa":"Yeole, P. K. (2020). <i>Plurality Consensus in Hybrid Networks</i>.","ieee":"P. K. Yeole, <i>Plurality Consensus in Hybrid Networks</i>. 2020.","short":"P.K. Yeole, Plurality Consensus in Hybrid Networks, 2020.","chicago":"Yeole, Paresh Kishor. <i>Plurality Consensus in Hybrid Networks</i>, 2020.","mla":"Yeole, Paresh Kishor. <i>Plurality Consensus in Hybrid Networks</i>. 2020.","ama":"Yeole PK. <i>Plurality Consensus in Hybrid Networks</i>.; 2020.","bibtex":"@book{Yeole_2020, title={Plurality Consensus in Hybrid Networks}, author={Yeole, Paresh Kishor}, year={2020} }"},"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"user_id":"15504","language":[{"iso":"eng"}],"_id":"20221","date_updated":"2022-01-06T06:54:23Z","author":[{"full_name":"Yeole, Paresh Kishor","last_name":"Yeole","first_name":"Paresh Kishor"}],"title":"Plurality Consensus in Hybrid Networks","year":"2020","status":"public"},{"publisher":"Springer","_id":"17836","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"user_id":"15504","doi":"10.1007/978-3-030-54921-3","volume":12156,"editor":[{"first_name":"Andrea","last_name":"Werneck Richa","full_name":"Werneck Richa, Andrea"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"year":"2020","title":"Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings","status":"public","publication_identifier":{"isbn":["978-3-030-54920-6"]},"date_updated":"2022-01-06T06:53:20Z","intvolume":"     12156","date_created":"2020-08-12T07:54:22Z","type":"conference_editor","department":[{"_id":"79"}],"citation":{"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>","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} }","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>.","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>.","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.","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>","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."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}]},{"citation":{"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.","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>","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.","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>.","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>.","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} }","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>"},"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"date_created":"2020-08-12T07:57:10Z","type":"conference_editor","department":[{"_id":"79"}],"status":"public","year":"2020","title":"SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020","publication_identifier":{"isbn":["978-1-4503-6935-0"]},"date_updated":"2022-01-06T06:53:20Z","publisher":"ACM","_id":"17839","language":[{"iso":"eng"}],"user_id":"15504","doi":"10.1145/3350755","editor":[{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"},{"first_name":"Michael","last_name":"Spear","full_name":"Spear, Michael"}]},{"department":[{"_id":"79"}],"type":"mastersthesis","date_created":"2020-11-25T07:03:16Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"bibtex":"@book{Jochmaring_2020, title={A self stabilizing protocol for well-formed trees in hybrid networks}, author={Jochmaring, Moritz}, year={2020} }","ama":"Jochmaring M. <i>A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks</i>.; 2020.","mla":"Jochmaring, Moritz. <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.","short":"M. Jochmaring, A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks, 2020.","ieee":"M. Jochmaring, <i>A self stabilizing protocol for well-formed trees in hybrid networks</i>. 2020.","apa":"Jochmaring, M. (2020). <i>A self stabilizing protocol for well-formed trees in hybrid networks</i>."},"supervisor":[{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"user_id":"15504","_id":"20495","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:27Z","author":[{"last_name":"Jochmaring","first_name":"Moritz","full_name":"Jochmaring, Moritz"}],"title":"A self stabilizing protocol for well-formed trees in hybrid networks","status":"public","year":"2020"},{"department":[{"_id":"79"}],"type":"conference","date_created":"2020-12-16T10:20:18Z","file":[{"date_created":"2020-12-16T10:18:50Z","creator":"mfeldma2","file_id":"20756","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2020-12-16T10:18:50Z","file_name":"Fast_Hybrid_Network_Algorithms_for_Shortest_Paths_in_Sparse_Graphs.pdf","file_size":867373,"access_level":"closed"}],"abstract":[{"lang":"eng","text":"We consider the problem of computing shortest paths in \\emph{hybrid networks}, in which nodes can make use of different communication modes. For example, mobile phones may use ad-hoc connections via Bluetooth or Wi-Fi in addition to the cellular network to solve tasks more efficiently. Like in this case, the different communication modes may differ considerably in range, bandwidth, and flexibility. We build upon the model of Augustine et al. [SODA '20], which captures these differences by a \\emph{local} and a \\emph{global} mode. Specifically, the local edges model a fixed communication network in which $O(1)$ messages of size $O(\\log n)$ can be sent over every edge in each synchronous round. The global edges form a clique, but nodes are only allowed to send and receive a total of at most $O(\\log n)$ messages over global edges, which restricts the nodes to use these edges only very sparsely.\r\n\r\nWe demonstrate the power of hybrid networks by presenting algorithms to compute Single-Source Shortest Paths and the diameter very efficiently in \\emph{sparse graphs}. Specifically, we present exact $O(\\log n)$ time algorithms for cactus graphs (i.e., graphs in which each edge is contained in at most one cycle), and $3$-approximations for graphs that have at most $n + O(n^{1/3})$ edges and arboricity $O(\\log n)$. For these graph classes, our algorithms provide exponentially faster solutions than the best known algorithms for general graphs in this model.\r\nBeyond shortest paths, we also provide a variety of useful tools and techniques for hybrid networks, which may be of independent interest.\r\n"}],"publication":"Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)","doi":"10.4230/LIPIcs.OPODIS.2020.31","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:36Z","author":[{"id":"23538","full_name":"Feldmann, Michael","last_name":"Feldmann","first_name":"Michael"},{"id":"32229","full_name":"Hinnenthal, Kristian","first_name":"Kristian","last_name":"Hinnenthal"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"title":"Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs","year":"2020","external_id":{"arxiv":["2007.01191"]},"project":[{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"1","name":"SFB 901"}],"citation":{"chicago":"Feldmann, Michael, Kristian Hinnenthal, and Christian Scheideler. “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.” In <i>Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)</i>. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2020.31\">https://doi.org/10.4230/LIPIcs.OPODIS.2020.31</a>.","short":"M. Feldmann, K. Hinnenthal, C. Scheideler, in: Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ieee":"M. Feldmann, K. Hinnenthal, and C. Scheideler, “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs,” in <i>Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2020.","apa":"Feldmann, M., Hinnenthal, K., &#38; Scheideler, C. (2020). Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs. In <i>Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)</i>. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2020.31\">https://doi.org/10.4230/LIPIcs.OPODIS.2020.31</a>","bibtex":"@inproceedings{Feldmann_Hinnenthal_Scheideler_2020, title={Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2020.31\">10.4230/LIPIcs.OPODIS.2020.31</a>}, booktitle={Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Feldmann, Michael and Hinnenthal, Kristian and Scheideler, Christian}, year={2020} }","ama":"Feldmann M, Hinnenthal K, Scheideler C. Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs. In: <i>Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)</i>. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2020.31\">10.4230/LIPIcs.OPODIS.2020.31</a>","mla":"Feldmann, Michael, et al. “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.” <i>Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)</i>, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2020.31\">10.4230/LIPIcs.OPODIS.2020.31</a>."},"file_date_updated":"2020-12-16T10:18:50Z","user_id":"23538","ddc":["000"],"_id":"20755","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","has_accepted_license":"1","status":"public"},{"type":"bachelorsthesis","department":[{"_id":"79"}],"date_created":"2020-08-20T07:40:58Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"citation":{"mla":"Skowronek, Michael. <i>Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn, 2020.","ama":"Skowronek M. <i>Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn; 2020.","bibtex":"@book{Skowronek_2020, title={Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks}, publisher={Universität Paderborn}, author={Skowronek, Michael}, year={2020} }","apa":"Skowronek, M. (2020). <i>Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn.","ieee":"M. Skowronek, <i>Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn, 2020.","chicago":"Skowronek, Michael. <i>Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn, 2020.","short":"M. Skowronek, Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks, Universität Paderborn, 2020."},"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"user_id":"477","publisher":"Universität Paderborn","_id":"18066","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:25Z","year":"2020","title":"Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks","status":"public","author":[{"first_name":"Michael","last_name":"Skowronek","full_name":"Skowronek, Michael"}]},{"type":"dissertation","department":[{"_id":"79"}],"date_created":"2020-08-28T06:50:29Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"citation":{"ama":"Setzer A. <i>Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks</i>. Universität Paderborn; 2020. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1026\">10.17619/UNIPB/1-1026</a>","short":"A. Setzer, Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks, Universität Paderborn, 2020.","chicago":"Setzer, Alexander. <i>Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks</i>. Universität Paderborn, 2020. <a href=\"https://doi.org/10.17619/UNIPB/1-1026\">https://doi.org/10.17619/UNIPB/1-1026</a>.","bibtex":"@book{Setzer_2020, title={Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1026\">10.17619/UNIPB/1-1026</a>}, publisher={Universität Paderborn}, author={Setzer, Alexander}, year={2020} }","mla":"Setzer, Alexander. <i>Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks</i>. Universität Paderborn, 2020, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1026\">10.17619/UNIPB/1-1026</a>.","apa":"Setzer, A. (2020). <i>Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-1026\">https://doi.org/10.17619/UNIPB/1-1026</a>","ieee":"A. Setzer, <i>Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks</i>. Universität Paderborn, 2020."},"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"user_id":"477","doi":"10.17619/UNIPB/1-1026","language":[{"iso":"eng"}],"_id":"18520","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:36Z","year":"2020","title":"Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks","status":"public","author":[{"full_name":"Setzer, Alexander","first_name":"Alexander","last_name":"Setzer","id":"11108"}]},{"department":[{"_id":"79"}],"type":"bachelorsthesis","date_created":"2020-08-31T07:14:51Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"supervisor":[{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"citation":{"apa":"Guggenmos, A. (2020). <i>Algorithmen für selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn.","ieee":"A. Guggenmos, <i>Algorithmen für selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn, 2020.","short":"A. Guggenmos, Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen, Universität Paderborn, 2020.","chicago":"Guggenmos, Andreas. <i>Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn, 2020.","mla":"Guggenmos, Andreas. <i>Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn, 2020.","ama":"Guggenmos A. <i>Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen</i>. Universität Paderborn; 2020.","bibtex":"@book{Guggenmos_2020, title={Algorithmen für selbststabilisierende Skip+-Delaunaygraphen}, publisher={Universität Paderborn}, author={Guggenmos, Andreas}, year={2020} }"},"user_id":"477","_id":"18648","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:50Z","author":[{"full_name":"Guggenmos, Andreas","last_name":"Guggenmos","first_name":"Andreas"}],"status":"public","title":"Algorithmen für selbststabilisierende Skip+-Delaunaygraphen","year":"2020"}]