Virtual On-Demand Volunteer System Based on Delaunay Triangulation
N. Ashri, Virtual On-Demand Volunteer System Based on Delaunay Triangulation, 2023.

Improving the End-of-Line Test of Custom-Built Geared Motors using Clustering based on Neural Networks
N. N., Improving the End-of-Line Test of Custom-Built Geared Motors Using Clustering Based on Neural Networks, 2023.

Routing in Hypergraphs
V. Deppe, Routing in Hypergraphs, 2023.

Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite
L. Decking, Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen Gewichteten Bandbreite, 2023.

Entwicklung und Analyse von Formeln zur Abschätzung der Renderingzeit eines Frames
A. Nickel, Entwicklung Und Analyse von Formeln Zur Abschätzung Der Renderingzeit Eines Frames, 2023.

Reconstruction of 3D Surfels from Neural Radiance Fields
V. Telaprolu, Reconstruction of 3D Surfels from Neural Radiance Fields, 2023.

Shape Reconfiguration by Hybrid Programmable Matter
J. Friemel, Shape Reconfiguration by Hybrid Programmable Matter, 2023.

Self-Stabilizing Skip-Graph with Growth-bounded Metric
B. Beckendorf, Self-Stabilizing Skip-Graph with Growth-Bounded Metric, 2023.

Evaluation of Algorithms for the Node Capacitated Clique
R. Roopa, Evaluation of Algorithms for the Node Capacitated Clique, 2022.

Aufarbeitung und lmplementierung von DAG-Rider
S. Korzeczek, Aufarbeitung Und Lmplementierung von DAG-Rider, 2022.

Hybrid Routing in Three Dimensions
M. Nachtigall, Hybrid Routing in Three Dimensions, 2022.

Coordinating Amoebots via Reconfigurable Circuits
M. Feldmann, A. Padalkin, C. Scheideler, S. Dolev, J. Comput. Biol. 29 (2022) 317–343.

Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen
H. Hillebrandt, Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen, 2022.

The Structural Power of Reconfigurable Circuits in the Amoebot Model
A. Padalkin, C. Scheideler, D. Warner, in: T.E. Ouldridge, S.F.J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 8:1–8:22.

Fault-Tolerant Shape Formation in the Amoebot Model
I. Kostitsyna, C. Scheideler, D. Warner, in: T.E. Ouldridge, S.F.J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 9:1–9:22.

Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems
J.J. Daymude, A.W. Richa, C. Scheideler, in: J. Aspnes, O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 12:1–12:19.

Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion
T. Götte, C. Scheideler, in: K. Agrawal, I.-T.A. Lee (Eds.), SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, ACM, 2022, pp. 99–101.

Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model
I. Kostitsyna, C. Scheideler, D. Warner, in: J. Aspnes, O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 23:1–23:3.

2022 Edsger W. Dijkstra Prize in Distributed Computing
M. Aguiliera, A.W. Richa, A.A. Schwarzmann, A. Panconesi, C. Scheideler, P. Woelfel, in: A. Milani, P. Woelfel (Eds.), PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, ACM, 2022, p. 1.

36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA
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.

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.

A self-stabilizing Hashed Patricia Trie
T. Knollmann, C. Scheideler, Information and Computation (2022).

Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter
K. Hinnenthal, Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter, 2021.

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.

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.

Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers
D. Suermann, Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers, 2021.

Selbststabilisierender Bakery Algorithmus für verteilte Systeme
L. Everling, Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme, 2021.

Peer-to-Peer Matching for Distributed Systems
V. Adsul, Peer-to-Peer Matching for Distributed Systems, 2021.

Derandomization and Local Graph Problems in the Node-Capacitated Clique
J. Werthmann, Derandomization and Local Graph Problems in the Node-Capacitated Clique, 2021.

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.

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.

Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks
M. Feldmann, Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks, 2021.

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.

Plurality Consensus in Hybrid Networks
P.K. Yeole, Plurality Consensus in Hybrid Networks, 2020.

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.

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.

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.

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.

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.

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.

Algorithmen für selbststabilisierende Skip+-Delaunaygraphen
A. Guggenmos, Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen, Universität Paderborn, 2020.

Survey on Algorithms for Self-Stabilizing Overlay Networks
M. Feldmann, C. Scheideler, S. Schmid, ACM Computing Surveys (2020).

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.

On the complexity of local transformations in SDN overlays
D. Warner, On the Complexity of Local Transformations in SDN Overlays, Universität Paderborn, 2020.

A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM, n.d.

Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems
N. N., Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems, 2019.

Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities
M. Feldmann, C. Scheideler, in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2019, pp. 287--296.

Distributed Computation in Node-Capacitated Networks
J. Augustine, M. Ghaffari, R. Gmyr, K. Hinnenthal, F. Kuhn, J. Li, C. Scheideler, in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM, 2019, pp. 69--79.

Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary
T. Götte, V.R. Vijayalakshmi, C. Scheideler, in: Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19), IEEE, n.d.

On the Complexity of Local Graph Transformations
C. Scheideler, A. Setzer, in: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Dagstuhl Publishing, 2019, pp. 150:1--150:14.