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.
301 Publications
2024 | Bachelorsthesis | LibreCat-ID: 52318
S. Dorociak, Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung. 2024.
LibreCat
2024 | Mastersthesis | LibreCat-ID: 53374
C. De Groote, A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes. 2024.
LibreCat
2024 | Mastersthesis | LibreCat-ID: 53373
R. Doddegowda, Optimal Drone Strategies For Packet Delivery. 2024.
LibreCat
2023 | Journal Article | LibreCat-ID: 43109
T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-and-Sleep: Message and Energy Efficient Set Cover,” Theor. Comput. Sci., vol. 950, p. 113756, 2023, doi: 10.1016/j.tcs.2023.113756.
LibreCat
| DOI
2023 | Mastersthesis | LibreCat-ID: 44735
J. Schweichhart, Minimum Edge Cuts in Overlay Networks. 2023.
LibreCat
2023 | Conference Paper | LibreCat-ID: 45188
J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, and P. Schneider, “Routing Schemes for Hybrid Communication Networks,” 2023, doi: 10.48550/ARXIV.2210.05333.
LibreCat
| DOI
2023 | Bachelorsthesis | LibreCat-ID: 46053
F. Schneider, Utilizing Redundancy in Distributed Heterogeneous Storage. 2023.
LibreCat
| Files available
2023 | Mastersthesis | LibreCat-ID: 46087
A. Ranade, Graph Neural Network-based Anomaly Detection in Smart Grid Energy Consumption. 2023.
LibreCat
2023 | Mastersthesis | LibreCat-ID: 46086
O. Ali, Highly accurate deep compressed facial recognition. 2023.
LibreCat
2023 | Mastersthesis | LibreCat-ID: 46110
N. Ashri, Virtual On-Demand Volunteer System Based on Delaunay Triangulation. 2023.
LibreCat
2023 | Mastersthesis | LibreCat-ID: 46221
N. N., Improving the End-of-Line Test of Custom-Built Geared Motors using Clustering based on Neural Networks. 2023.
LibreCat
2023 | Bachelorsthesis | LibreCat-ID: 48430
L. Decking, Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite. 2023.
LibreCat
2023 | Bachelorsthesis | LibreCat-ID: 49494
A. Nickel, Entwicklung und Analyse von Formeln zur Abschätzung der Renderingzeit eines Frames. 2023.
LibreCat
2023 | Mastersthesis | LibreCat-ID: 49493
V. Telaprolu, Reconstruction of 3D Surfels from Neural Radiance Fields. 2023.
LibreCat
2023 | Mastersthesis | LibreCat-ID: 49492
J. Friemel, Shape Reconfiguration by Hybrid Programmable Matter. 2023.
LibreCat
2023 | Mastersthesis | LibreCat-ID: 52317
B. Beckendorf, Self-Stabilizing Skip-Graph with Growth-bounded Metric. 2023.
LibreCat
2022 | Mastersthesis | LibreCat-ID: 30152
R. Roopa, Evaluation of Algorithms for the Node Capacitated Clique. 2022.
LibreCat
2022 | Bachelorsthesis | LibreCat-ID: 30198
S. Korzeczek, Aufarbeitung und lmplementierung von DAG-Rider. 2022.
LibreCat
2022 | Mastersthesis | LibreCat-ID: 30199
M. Nachtigall, Hybrid Routing in Three Dimensions. 2022.
LibreCat
2022 | Journal Article | LibreCat-ID: 31060
M. Feldmann, A. Padalkin, C. Scheideler, and S. Dolev, “Coordinating Amoebots via Reconfigurable Circuits,” J. Comput. Biol., vol. 29, no. 4, pp. 317–343, 2022, doi: 10.1089/cmb.2021.0363.
LibreCat
| DOI
2022 | Bachelorsthesis | LibreCat-ID: 31947
H. Hillebrandt, Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen. 2022.
LibreCat
| Files available
2022 | Conference Paper | LibreCat-ID: 32602
A. Padalkin, C. Scheideler, and D. Warner, “The Structural Power of Reconfigurable Circuits in the Amoebot Model,” 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
| DOI
2022 | Conference Paper | LibreCat-ID: 32603
I. Kostitsyna, C. Scheideler, and D. Warner, “Fault-Tolerant Shape Formation in the Amoebot Model,” 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
| DOI
2022 | Conference Paper | LibreCat-ID: 33230
J. J. Daymude, A. W. Richa, and C. Scheideler, “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems,” 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
| DOI
2022 | Conference Paper | LibreCat-ID: 33240
T. Götte and C. Scheideler, “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion,” 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
| DOI
2022 | Conference Paper | LibreCat-ID: 30987
I. Kostitsyna, C. Scheideler, and D. Warner, “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model,” 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
| DOI
2022 | Conference Paper | LibreCat-ID: 33967
M. Aguiliera, A. W. Richa, A. A. Schwarzmann, A. Panconesi, C. Scheideler, and P. Woelfel, “2022 Edsger W. Dijkstra Prize in Distributed Computing,” 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
| DOI
2022 | Conference (Editor) | LibreCat-ID: 33968
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
2022 | Journal Article | LibreCat-ID: 21096
T. Knollmann and C. Scheideler, “A self-stabilizing Hashed Patricia Trie,” Information and Computation, Art. no. 104697, 2022, doi: 10.1016/j.ic.2021.104697.
LibreCat
| DOI
2021 | Mastersthesis | LibreCat-ID: 25126
D. J. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model. 2021.
LibreCat
| Files available
2021 | Conference Paper | LibreCat-ID: 28917
M. Feldmann, A. Padalkin, C. Scheideler, and S. 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, 2021, vol. 13046, pp. 484–488, doi: 10.1007/978-3-030-91081-5\_34.
LibreCat
| DOI
2021 | Bachelorsthesis | LibreCat-ID: 28998
D. Suermann, Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers. 2021.
LibreCat
2021 | Bachelorsthesis | LibreCat-ID: 27053
L. Everling, Selbststabilisierender Bakery Algorithmus für verteilte Systeme. 2021.
LibreCat
2021 | Mastersthesis | LibreCat-ID: 27072
V. Adsul, Peer-to-Peer Matching for Distributed Systems. 2021.
LibreCat
2021 | Mastersthesis | LibreCat-ID: 21084
J. Werthmann, Derandomization and Local Graph Problems in the Node-Capacitated Clique. 2021.
LibreCat
2021 | Bachelorsthesis | LibreCat-ID: 21197
M. Mengshi, Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter. 2021.
LibreCat
2021 | Mastersthesis | LibreCat-ID: 21627
D. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model. 2021.
LibreCat
2021 | Dissertation | LibreCat-ID: 21628
M. Feldmann, Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks. 2021.
LibreCat
| Files available
| DOI
2021 | Conference Paper | LibreCat-ID: 30217
S. Coy et al., “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, 2021, vol. 217, p. 11:1–11:23, doi: 10.4230/LIPIcs.OPODIS.2021.11.
LibreCat
| DOI
2020 | Mastersthesis | LibreCat-ID: 20221
P. K. Yeole, Plurality Consensus in Hybrid Networks. 2020.
LibreCat
2020 | Mastersthesis | LibreCat-ID: 20495
M. Jochmaring, A self stabilizing protocol for well-formed trees in hybrid networks. 2020.
LibreCat
2020 | Conference Paper | LibreCat-ID: 20755
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
| Files available
| DOI
| arXiv
2020 | Bachelorsthesis | LibreCat-ID: 18066
M. Skowronek, Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks. Universität Paderborn, 2020.
LibreCat