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
Coordinating Amoebots via Reconfigurable Circuits
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.
LibreCat | DOI
 

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

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

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

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

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

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

2021 | Dissertation | LibreCat-ID: 21628
Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks
M. Feldmann, Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks, 2021.
LibreCat | Files available | DOI
 

2021 | Conference Paper | LibreCat-ID: 30217
Near-Shortest Path Routing in Hybrid Communication Networks
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.
LibreCat | DOI
 

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

2020 | Conference (Editor) | LibreCat-ID: 17836
Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings
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.
LibreCat | DOI
 

2020 | Conference (Editor) | LibreCat-ID: 17839
SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020
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.
LibreCat | DOI
 

2020 | Mastersthesis | LibreCat-ID: 20495
A self stabilizing protocol for well-formed trees in hybrid networks
M. Jochmaring, A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks, 2020.
LibreCat
 

2020 | Conference Paper | LibreCat-ID: 20755
Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
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.
LibreCat | Files available | DOI | arXiv
 

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

2020 | Dissertation | LibreCat-ID: 18520
Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks
A. Setzer, Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks, Universität Paderborn, 2020.
LibreCat | DOI
 

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

2020 | Journal Article | LibreCat-ID: 16902
Survey on Algorithms for Self-Stabilizing Overlay Networks
M. Feldmann, C. Scheideler, S. Schmid, ACM Computing Surveys (2020).
LibreCat | DOI
 

2020 | Conference Paper | LibreCat-ID: 16903
Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model
M. Feldmann, A. Khazraei, C. Scheideler, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2020.
LibreCat | DOI | arXiv
 

2020 | Mastersthesis | LibreCat-ID: 15770
On the complexity of local transformations in SDN overlays
D. Warner, 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

Export / Embed