Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks
C. Kolb, Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks, 2022.
LibreCat: /record/30239
DOI: 10.17619/UNIPB/1-1673 

A self-stabilizing Hashed Patricia Trie
T. Knollmann, C. Scheideler, Information and Computation (2022).
LibreCat: /record/21096
DOI: 10.1016/j.ic.2021.104697

Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter
K. Hinnenthal, Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter, 2021.
LibreCat: /record/24887
DOI: 10.17619/UNIPB/1-1169 

Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model
D.J. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model, 2021.
LibreCat: /record/25126

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: /record/28917
DOI: 10.1007/978-3-030-91081-5‑34

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

Selbststabilisierender Bakery Algorithmus für verteilte Systeme
L. Everling, Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme, 2021.
LibreCat: /record/27053

Peer-to-Peer Matching for Distributed Systems
V. Adsul, Peer-to-Peer Matching for Distributed Systems, 2021.
LibreCat: /record/27072

Derandomization and Local Graph Problems in the Node-Capacitated Clique
J. Werthmann, Derandomization and Local Graph Problems in the Node-Capacitated Clique, 2021.
LibreCat: /record/21084

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: /record/21197

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: /record/21627

Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks
M. Feldmann, Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks, 2021.
LibreCat: /record/21628
DOI: 10.17619/UNIPB/1-1113

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: /record/30217
DOI: 10.4230/LIPIcs.OPODIS.2021.11

Plurality Consensus in Hybrid Networks
P.K. Yeole, Plurality Consensus in Hybrid Networks, 2020.
LibreCat: /record/20221

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: /record/17836
DOI: 10.1007/978-3-030-54921-3

SPAA : 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: /record/17839
DOI: 10.1145/3350755

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: /record/20495

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: /record/20755
DOI: 10.4230/LIPIcs.OPODIS.2020.31
arXiv: 2007.01191

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: /record/18066

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: /record/18520
DOI: 10.17619/UNIPB/1-1026