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.
307 Publications
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
2020 | Bachelorsthesis | LibreCat-ID: 18648
A. Guggenmos, Algorithmen für selbststabilisierende Skip+-Delaunaygraphen. Universität Paderborn, 2020.
LibreCat
2020 | Mastersthesis | LibreCat-ID: 15770
D. Warner, On the complexity of local transformations in SDN overlays. Universität Paderborn, 2020.
LibreCat
2020 | Conference Paper | LibreCat-ID: 15169
J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), Kolkata, Indien.
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
M. Feldmann and C. Scheideler, “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), 2019, pp. 287--296.
LibreCat
| Files available
| DOI
| arXiv
2019 | Conference Paper | LibreCat-ID: 8871
J. Augustine et al., “Distributed Computation in Node-Capacitated Networks,” in Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, 2019, pp. 69--79.
LibreCat
| Files available
| DOI
2019 | Conference Paper | LibreCat-ID: 6976
T. Götte, V. R. Vijayalakshmi, and C. Scheideler, “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), Rio de Janeiro, Brazil.
LibreCat
| Files available
2019 | Conference Paper | LibreCat-ID: 10586
C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,” in Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14.
LibreCat
| Files available
| DOI
2019 | Conference Paper | LibreCat-ID: 14539
J. Castenow, C. Kolb, and C. Scheideler, “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), L’Aquila, Italy, 2019, pp. 345–348.
LibreCat
| DOI
2019 | Conference Paper | LibreCat-ID: 13182
M. Feldmann, T. Götte, and C. Scheideler, “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), 2019, pp. 149–164.
LibreCat
| Files available
| DOI
| arXiv