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


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
 

2020 | Bachelorsthesis | LibreCat-ID: 18648
Guggenmos A. Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen. Universität Paderborn; 2020.
LibreCat
 

2020 | Journal Article | LibreCat-ID: 16902
Feldmann M, Scheideler C, Schmid S. Survey on Algorithms for Self-Stabilizing Overlay Networks. ACM Computing Surveys. 2020. doi:10.1145/3397190
LibreCat | DOI
 

2020 | Conference Paper | LibreCat-ID: 16903
Feldmann M, Khazraei A, Scheideler C. Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM; 2020. doi:10.1145/3350755.3400246
LibreCat | DOI | arXiv
 

2020 | Mastersthesis | LibreCat-ID: 15770
Warner D. On the Complexity of Local Transformations in SDN Overlays. Universität Paderborn; 2020.
LibreCat
 

2020 | Conference Paper | LibreCat-ID: 15169
Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN). ACM.
LibreCat
 

2019 | Mastersthesis | LibreCat-ID: 17809
N. N. Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems.; 2019.
LibreCat
 

2019 | Conference Paper | LibreCat-ID: 8534
Feldmann M, Scheideler C. Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities. In: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM; 2019:287--296. doi:10.1145/3323165.3323193
LibreCat | Files available | DOI | arXiv
 

2019 | Conference Paper | LibreCat-ID: 8871
Augustine J, Ghaffari M, Gmyr R, et al. Distributed Computation in Node-Capacitated Networks. In: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures. ACM; 2019:69--79. doi:10.1145/3323165.3323195
LibreCat | Files available | DOI
 

2019 | Conference Paper | LibreCat-ID: 6976
Götte T, Vijayalakshmi VR, Scheideler C. Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary. In: Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19). IEEE.
LibreCat | Files available
 

2019 | Conference Paper | LibreCat-ID: 10586
Scheideler C, Setzer A. On the Complexity of Local Graph Transformations. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming. Vol 132. LIPIcs. Dagstuhl Publishing; 2019:150:1--150:14. doi:10.4230/LIPICS.ICALP.2019.150
LibreCat | Files available | DOI
 

2019 | Conference (Editor) | LibreCat-ID: 14829
Scheideler C, Berenbrink P, eds. The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019. ACM; 2019. doi:10.1145/3323165
LibreCat | DOI
 

2019 | Journal Article | LibreCat-ID: 14830
Gmyr R, Lefevre J, Scheideler C. Self-Stabilizing Metric Graphs. Theory Comput Syst. 2019;63(2):177-199. doi:10.1007/s00224-017-9823-4
LibreCat | DOI
 

2019 | Conference Paper | LibreCat-ID: 14539
Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO). ; 2019:345-348. doi:10.1007/978-3-030-24922-9\_26
LibreCat | DOI
 

2019 | Conference Paper | LibreCat-ID: 13182
Feldmann M, Götte T, Scheideler C. A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory. In: Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Lecture Notes in Computer Science. Springer, Cham; 2019:149-164. doi:https://doi.org/10.1007/978-3-030-34992-9_13
LibreCat | Files available | DOI | arXiv
 

2019 | Mastersthesis | LibreCat-ID: 10271
N. N. Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves. Universität Paderborn; 2019.
LibreCat
 

2019 | Conference Paper | LibreCat-ID: 13652
Hinnenthal K, Scheideler C, Struijs M. Fast Distributed Algorithms for LP-Type Problems of Low Dimension. In: 33rd International Symposium on Distributed Computing (DISC 2019). ; 2019. doi:10.4230/LIPICS.DISC.2019.23
LibreCat | DOI
 

2018 | Conference Paper | LibreCat-ID: 3422
Robinson P, Scheideler C, Setzer A. Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. In: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). doi:10.1145/3210377.3210399
LibreCat | Files available | DOI
 

2018 | Conference (Editor) | LibreCat-ID: 3874
Scheideler C, Fineman JT, eds. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures. ACM; 2018.
LibreCat
 

2018 | Dissertation | LibreCat-ID: 1138
Gmyr R. Distributed Algorithms for Overlay Networks and Programmable Matter. Universität Paderborn; 2018. doi:10.17619/UNIPB/1-265
LibreCat | DOI
 

2018 | Conference Paper | LibreCat-ID: 1163
Feldmann M, Kolb C, Scheideler C, Strothmann TF. Self-Stabilizing Supervised Publish-Subscribe Systems. In: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE; 2018. doi:10.1109/IPDPS.2018.00114
LibreCat | Files available | DOI | arXiv
 

Filters and Search Terms

department=79

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed