S. Dorociak, Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung. 2024.
LibreCat: /record/52318

C. De Groote, A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes. 2024.
LibreCat: /record/53374

R. Doddegowda, Optimal Drone Strategies For Packet Delivery. 2024.
LibreCat: /record/53373

H. Thakur, Evaluating the Implications. 2024.
LibreCat: /record/53372

T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-and-Sleep: Message and Energy Efficient Set Cover,”10.1016/j.tcs.2023.113756__Theor. Comput. Sci., vol. 950, p. 113756, 2023, doi:10.1016/j.tcs.2023.113756 .
LibreCat: /record/43109
DOI: 10.1016/j.tcs.2023.113756

J. Schweichhart, Minimum Edge Cuts in Overlay Networks. 2023.
LibreCat: /record/44735

J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, and P. Schneider, “Routing Schemes for Hybrid Communication Networks,”10.48550/ARXIV.2210.05333__2023, doi:10.48550/ARXIV.2210.05333 .
LibreCat: /record/45188
DOI: 10.48550/ARXIV.2210.05333

F. Schneider, Utilizing Redundancy in Distributed Heterogeneous Storage. 2023.
LibreCat: /record/46053

A. Ranade, Graph Neural Network-based Anomaly Detection in  Smart Grid Energy Consumption. 2023.
LibreCat: /record/46087

O. Ali, Highly accurate deep compressed facial recognition. 2023.
LibreCat: /record/46086

N. Ashri, Virtual On-Demand Volunteer System Based on Delaunay Triangulation. 2023.
LibreCat: /record/46110

N. N., Improving the End-of-Line Test of Custom-Built Geared Motors using Clustering based on Neural Networks. 2023.
LibreCat: /record/46221

V. Deppe, Routing in Hypergraphs. 2023.
LibreCat: /record/47134

L. Decking, Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite. 2023.
LibreCat: /record/48430

A. Nickel, Entwicklung und Analyse von Formeln zur Abschätzung der Renderingzeit eines Frames. 2023.
LibreCat: /record/49494

V. Telaprolu, Reconstruction of 3D Surfels from Neural Radiance Fields. 2023.
LibreCat: /record/49493

J. Friemel, Shape Reconfiguration by Hybrid Programmable Matter. 2023.
LibreCat: /record/49492

B. Beckendorf, Self-Stabilizing Skip-Graph with Growth-bounded Metric. 2023.
LibreCat: /record/52317

R. Roopa, Evaluation of Algorithms for the Node Capacitated Clique. 2022.
LibreCat: /record/30152

S. Korzeczek, Aufarbeitung und lmplementierung von DAG-Rider. 2022.
LibreCat: /record/30198

M. Nachtigall, Hybrid Routing in Three Dimensions. 2022.
LibreCat: /record/30199

M. Feldmann, A. Padalkin, C. Scheideler, and S. Dolev, “Coordinating Amoebots via Reconfigurable Circuits,”10.1089/cmb.2021.0363__J. Comput. Biol., vol. 29, no. 4, pp. 317–343, 2022, doi:10.1089/cmb.2021.0363 .
LibreCat: /record/31060
DOI: 10.1089/cmb.2021.0363

H. Hillebrandt, Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen. 2022.
LibreCat: /record/31947

A. Padalkin, C. Scheideler, and D. Warner, “The Structural Power of Reconfigurable Circuits in the Amoebot Model,”10.4230/LIPIcs.DNA.28.8__in 28th International Conference on DNA Computing and Molecular Programming (DNA 28), 2022, vol. 238, p. 8:1–8:22, doi:10.4230/LIPIcs.DNA.28.8 .
LibreCat: /record/32602
DOI: 10.4230/LIPIcs.DNA.28.8

I. Kostitsyna, C. Scheideler, and D. Warner, “Fault-Tolerant Shape Formation in the Amoebot Model,”10.4230/LIPIcs.DNA.28.9__in 28th International Conference on DNA Computing and Molecular Programming (DNA 28), 2022, vol. 238, p. 9:1–9:22, doi:10.4230/LIPIcs.DNA.28.9 .
LibreCat: /record/32603
DOI: 10.4230/LIPIcs.DNA.28.9

J. J. Daymude, A. W. Richa, and C. Scheideler, “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems,”10.4230/LIPIcs.SAND.2022.12__in 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, 2022, vol. 221, p. 12:1–12:19, doi:10.4230/LIPIcs.SAND.2022.12 .
LibreCat: /record/33230
DOI: 10.4230/LIPIcs.SAND.2022.12

T. Götte and C. Scheideler, “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion,”10.1145/3490148.3538556__in SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, 2022, pp. 99–101, doi:10.1145/3490148.3538556 .
LibreCat: /record/33240
DOI: 10.1145/3490148.3538556

I. Kostitsyna, C. Scheideler, and D. Warner, “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model,”10.4230/LIPIcs.SAND.2022.23__in 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), 2022, vol. 221, p. 23:1–23:3, doi:10.4230/LIPIcs.SAND.2022.23 .
LibreCat: /record/30987
DOI: 10.4230/LIPIcs.SAND.2022.23

M. Aguiliera, A. W. Richa, A. A. Schwarzmann, A. Panconesi, C. Scheideler, and P. Woelfel, “Edsger W. Dijkstra Prize in Distributed Computing,”10.1145/3519270.3538411__in PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, 2022, p. 1, doi:10.1145/3519270.3538411 .
LibreCat: /record/33967
DOI: 10.1145/3519270.3538411

C. Scheideler, Ed., 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA, vol. 246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
LibreCat: /record/33968

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 

T. Knollmann and C. Scheideler, “A self-stabilizing Hashed Patricia Trie,”10.1016/j.ic.2021.104697__Information and Computation, Art. no. 104697, 2022, doi:10.1016/j.ic.2021.104697 .
LibreCat: /record/21096
DOI: 10.1016/j.ic.2021.104697

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

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

M. Feldmann, A. Padalkin, C. Scheideler, and S. Dolev, “Coordinating Amoebots via Reconfigurable Circuits,”10.1007/978-3-030-91081-5‑34__in Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, 2021, vol. 13046, pp. 484–488, doi:10.1007/978-3-030-91081-5‑34 .
LibreCat: /record/28917
DOI: 10.1007/978-3-030-91081-5‑34

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

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

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

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

M. Mengshi, Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter. 2021.
LibreCat: /record/21197

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

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

S. Coy et al., “Near-Shortest Path Routing in Hybrid Communication Networks,”10.4230/LIPIcs.OPODIS.2021.11__in 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, 2021, vol. 217, p. 11:1–11:23, doi:10.4230/LIPIcs.OPODIS.2021.11 .
LibreCat: /record/30217
DOI: 10.4230/LIPIcs.OPODIS.2021.11

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

A. Werneck Richa and C. Scheideler, Eds., Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings, vol. 12156. Springer, 2020.
LibreCat: /record/17836
DOI: 10.1007/978-3-030-54921-3

C. Scheideler and 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

M. Jochmaring, A self stabilizing protocol for well-formed trees in hybrid networks. 2020.
LibreCat: /record/20495

M. Feldmann, K. Hinnenthal, and C. Scheideler, “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs,” in Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), 2020.
LibreCat: /record/20755
DOI: 10.4230/LIPIcs.OPODIS.2020.31
arXiv: 2007.01191

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

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