Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

307 Publications


2021 | Conference Paper | LibreCat-ID: 28917
Feldmann, Michael, Andreas Padalkin, Christian Scheideler, and Shlomi Dolev. “Coordinating Amoebots via Reconfigurable Circuits.” In Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, edited by Colette Johnen, Elad Michael Schiller, and Stefan Schmid, 13046:484–88. Lecture Notes in Computer Science. Springer, 2021. https://doi.org/10.1007/978-3-030-91081-5\_34.
LibreCat | DOI
 

2021 | Bachelorsthesis | LibreCat-ID: 28998
Suermann, Dennis. Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers, 2021.
LibreCat
 

2021 | Bachelorsthesis | LibreCat-ID: 27053
Everling, Leon. Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme, 2021.
LibreCat
 

2021 | Mastersthesis | LibreCat-ID: 27072
Adsul, Vaibhav. Peer-to-Peer Matching for Distributed Systems, 2021.
LibreCat
 

2021 | Mastersthesis | LibreCat-ID: 21084
Werthmann, Julian. Derandomization and Local Graph Problems in the Node-Capacitated Clique, 2021.
LibreCat
 

2021 | Bachelorsthesis | LibreCat-ID: 21197
Mengshi, Ma. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter, 2021.
LibreCat
 

2021 | Mastersthesis | LibreCat-ID: 21627
Liedtke, David. Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model, 2021.
LibreCat
 

2021 | Dissertation | LibreCat-ID: 21628
Feldmann, Michael. Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks, 2021. https://doi.org/10.17619/UNIPB/1-1113.
LibreCat | Files available | DOI
 

2021 | Conference Paper | LibreCat-ID: 30217
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 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, edited by Quentin Bramas, Vincent Gramoli, and Alessia Milani, 217:11:1–11:23. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.OPODIS.2021.11.
LibreCat | DOI
 

2020 | Mastersthesis | LibreCat-ID: 20221
Yeole, Paresh Kishor. Plurality Consensus in Hybrid Networks, 2020.
LibreCat
 

2020 | Conference (Editor) | LibreCat-ID: 17836
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.
LibreCat | DOI
 

2020 | Conference (Editor) | LibreCat-ID: 17839
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.
LibreCat | DOI
 

2020 | Mastersthesis | LibreCat-ID: 20495
Jochmaring, Moritz. A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks, 2020.
LibreCat
 

2020 | Conference Paper | LibreCat-ID: 20755
Feldmann, Michael, Kristian Hinnenthal, and Christian Scheideler. “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.” In Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2020.31.
LibreCat | Files available | DOI | arXiv
 

2020 | Bachelorsthesis | LibreCat-ID: 18066
Skowronek, Michael. Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks. Universität Paderborn, 2020.
LibreCat
 

2020 | Dissertation | LibreCat-ID: 18520
Setzer, Alexander. Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks. Universität Paderborn, 2020. https://doi.org/10.17619/UNIPB/1-1026.
LibreCat | DOI
 

2020 | Bachelorsthesis | LibreCat-ID: 18648
Guggenmos, Andreas. Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen. Universität Paderborn, 2020.
LibreCat
 

2020 | Journal Article | LibreCat-ID: 16902
Feldmann, Michael, Christian Scheideler, and Stefan Schmid. “Survey on Algorithms for Self-Stabilizing Overlay Networks.” ACM Computing Surveys, 2020. https://doi.org/10.1145/3397190.
LibreCat | DOI
 

2020 | Conference Paper | LibreCat-ID: 16903
Feldmann, Michael, Ardalan Khazraei, and Christian Scheideler. “Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model.” In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM, 2020. https://doi.org/10.1145/3350755.3400246.
LibreCat | DOI | arXiv
 

2020 | Mastersthesis | LibreCat-ID: 15770
Warner, Daniel. On the Complexity of Local Transformations in SDN Overlays. Universität Paderborn, 2020.
LibreCat
 

Filters and Search Terms

(department=79)

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed