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
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