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
Dorociak S. Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung.; 2024.
LibreCat
2024 | Mastersthesis | LibreCat-ID: 53374
De Groote C. A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes.; 2024.
LibreCat
2024 | Mastersthesis | LibreCat-ID: 53373
Doddegowda R. Optimal Drone Strategies For Packet Delivery.; 2024.
LibreCat
2023 | Journal Article | LibreCat-ID: 43109
Götte T, Kolb C, Scheideler C, Werthmann J. Beep-and-Sleep: Message and Energy Efficient Set Cover. Theor Comput Sci. 2023;950:113756. doi:10.1016/j.tcs.2023.113756
LibreCat
| DOI
2023 | Mastersthesis | LibreCat-ID: 44735
Schweichhart J. Minimum Edge Cuts in Overlay Networks.; 2023.
LibreCat
2023 | Conference Paper | LibreCat-ID: 45188
Werthmann J, Scheideler C, Coy S, Czumaj A, Schneider P. Routing Schemes for Hybrid Communication Networks. In: ; 2023. doi:10.48550/ARXIV.2210.05333
LibreCat
| DOI
2023 | Bachelorsthesis | LibreCat-ID: 46053
Schneider F. Utilizing Redundancy in Distributed Heterogeneous Storage.; 2023.
LibreCat
| Files available
2023 | Mastersthesis | LibreCat-ID: 46087
Ranade A. Graph Neural Network-Based Anomaly Detection in Smart Grid Energy Consumption.; 2023.
LibreCat
2023 | Mastersthesis | LibreCat-ID: 46086
Ali O. Highly Accurate Deep Compressed Facial Recognition.; 2023.
LibreCat
2023 | Mastersthesis | LibreCat-ID: 46110
Ashri N. 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
Decking L. Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen Gewichteten Bandbreite.; 2023.
LibreCat
2023 | Bachelorsthesis | LibreCat-ID: 49494
Nickel A. Entwicklung Und Analyse von Formeln Zur Abschätzung Der Renderingzeit Eines Frames.; 2023.
LibreCat
2023 | Mastersthesis | LibreCat-ID: 49493
Telaprolu V. Reconstruction of 3D Surfels from Neural Radiance Fields.; 2023.
LibreCat
2023 | Mastersthesis | LibreCat-ID: 49492
Friemel J. Shape Reconfiguration by Hybrid Programmable Matter.; 2023.
LibreCat
2023 | Mastersthesis | LibreCat-ID: 52317
Beckendorf B. Self-Stabilizing Skip-Graph with Growth-Bounded Metric.; 2023.
LibreCat
2022 | Mastersthesis | LibreCat-ID: 30152
Roopa R. Evaluation of Algorithms for the Node Capacitated Clique.; 2022.
LibreCat
2022 | Bachelorsthesis | LibreCat-ID: 30198
Korzeczek S. Aufarbeitung Und Lmplementierung von DAG-Rider.; 2022.
LibreCat
2022 | Mastersthesis | LibreCat-ID: 30199
Nachtigall M. Hybrid Routing in Three Dimensions.; 2022.
LibreCat
2022 | Journal Article | LibreCat-ID: 31060
Feldmann M, Padalkin A, Scheideler C, Dolev S. Coordinating Amoebots via Reconfigurable Circuits. J Comput Biol. 2022;29(4):317–343. doi:10.1089/cmb.2021.0363
LibreCat
| DOI
2022 | Bachelorsthesis | LibreCat-ID: 31947
Hillebrandt H. Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen.; 2022.
LibreCat
| Files available
2022 | Conference Paper | LibreCat-ID: 32602
Padalkin A, Scheideler C, Warner D. The Structural Power of Reconfigurable Circuits in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. 28th International Conference on DNA Computing and Molecular Programming (DNA 28). Vol 238. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:8:1–8:22. doi:10.4230/LIPIcs.DNA.28.8
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 32603
Kostitsyna I, Scheideler C, Warner D. Fault-Tolerant Shape Formation in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. 28th International Conference on DNA Computing and Molecular Programming (DNA 28). Vol 238. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:9:1–9:22. doi:10.4230/LIPIcs.DNA.28.9
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 33230
Daymude JJ, Richa AW, Scheideler C. Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems. In: Aspnes J, Michail O, eds. 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference. Vol 221. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:12:1–12:19. doi:10.4230/LIPIcs.SAND.2022.12
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 33240
Götte T, Scheideler C. Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion. In: Agrawal K, Lee I-TA, eds. SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022. ACM; 2022:99–101. doi:10.1145/3490148.3538556
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 30987
Kostitsyna I, Scheideler C, Warner D. Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. In: Aspnes J, Michail O, eds. 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). Vol 221. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:23:1–23:3. doi:10.4230/LIPIcs.SAND.2022.23
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 33967
Aguiliera M, Richa AW, Schwarzmann AA, Panconesi A, Scheideler C, Woelfel P. 2022 Edsger W. Dijkstra Prize in Distributed Computing. In: Milani A, Woelfel P, eds. PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022. ACM; 2022:1. doi:10.1145/3519270.3538411
LibreCat
| DOI
2022 | Conference (Editor) | LibreCat-ID: 33968
Scheideler C, 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 | Dissertation | LibreCat-ID: 30239
Kolb C. Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks.; 2022. doi:10.17619/UNIPB/1-1673
LibreCat
| DOI
2022 | Journal Article | LibreCat-ID: 21096
Knollmann T, Scheideler C. A self-stabilizing Hashed Patricia Trie. Information and Computation. Published online 2022. doi:10.1016/j.ic.2021.104697
LibreCat
| DOI
2021 | Dissertation | LibreCat-ID: 24887
Hinnenthal K. Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter.; 2021. doi:10.17619/UNIPB/1-1169
LibreCat
| DOI
2021 | Mastersthesis | LibreCat-ID: 25126
Liedtke DJ. Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model.; 2021.
LibreCat
| Files available
2021 | Conference Paper | LibreCat-ID: 28917
Feldmann M, Padalkin A, Scheideler C, Dolev S. Coordinating Amoebots via Reconfigurable Circuits. In: Johnen C, Michael Schiller E, Schmid S, eds. Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings. Vol 13046. Lecture Notes in Computer Science. Springer; 2021:484-488. doi:10.1007/978-3-030-91081-5\_34
LibreCat
| DOI
2021 | Bachelorsthesis | LibreCat-ID: 28998
Suermann D. Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers.; 2021.
LibreCat
2021 | Bachelorsthesis | LibreCat-ID: 27053
Everling L. Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme.; 2021.
LibreCat
2021 | Mastersthesis | LibreCat-ID: 27072
Adsul V. Peer-to-Peer Matching for Distributed Systems.; 2021.
LibreCat
2021 | Mastersthesis | LibreCat-ID: 21084
Werthmann J. Derandomization and Local Graph Problems in the Node-Capacitated Clique.; 2021.
LibreCat
2021 | Bachelorsthesis | LibreCat-ID: 21197
Mengshi M. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter.; 2021.
LibreCat
2021 | Mastersthesis | LibreCat-ID: 21627
Liedtke D. Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model.; 2021.
LibreCat
2021 | Dissertation | LibreCat-ID: 21628
Feldmann M. Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks.; 2021. doi:10.17619/UNIPB/1-1113
LibreCat
| Files available
| DOI
2021 | Conference Paper | LibreCat-ID: 30217
Coy S, Czumaj A, Feldmann M, et al. Near-Shortest Path Routing in Hybrid Communication Networks. In: Bramas Q, Gramoli V, Milani A, eds. 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France. Vol 217. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021:11:1–11:23. doi:10.4230/LIPIcs.OPODIS.2021.11
LibreCat
| DOI
2020 | Mastersthesis | LibreCat-ID: 20221
Yeole PK. Plurality Consensus in Hybrid Networks.; 2020.
LibreCat
2020 | Conference (Editor) | LibreCat-ID: 17836
Werneck Richa A, Scheideler C, eds. Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings. Vol 12156. Springer; 2020. doi:10.1007/978-3-030-54921-3
LibreCat
| DOI
2020 | Conference (Editor) | LibreCat-ID: 17839
Scheideler C, Spear M, eds. SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM; 2020. doi:10.1145/3350755
LibreCat
| DOI
2020 | Mastersthesis | LibreCat-ID: 20495
Jochmaring M. A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks.; 2020.
LibreCat
2020 | Conference Paper | LibreCat-ID: 20755
Feldmann M, Hinnenthal K, Scheideler C. Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs. In: Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.OPODIS.2020.31
LibreCat
| Files available
| DOI
| arXiv
2020 | Bachelorsthesis | LibreCat-ID: 18066
Skowronek M. Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks. Universität Paderborn; 2020.
LibreCat
2020 | Dissertation | LibreCat-ID: 18520
Setzer A. Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks. Universität Paderborn; 2020. doi:10.17619/UNIPB/1-1026
LibreCat
| DOI