A. Guggenmos, Algorithmen für selbststabilisierende Skip+-Delaunaygraphen. Universität Paderborn, 2020.
LibreCat: /record/18648

M. Feldmann, C. Scheideler, and S. Schmid, “Survey on Algorithms for Self-Stabilizing Overlay Networks,” ACM Computing Surveys, 2020.
LibreCat: /record/16902
DOI: 10.1145/3397190

M. Feldmann, A. Khazraei, and C. Scheideler, “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), 2020.
LibreCat: /record/16903
DOI: 10.1145/3350755.3400246
arXiv: 2005.07388

D. Warner, On the complexity of local transformations in SDN overlays. Universität Paderborn, 2020.
LibreCat: /record/15770

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: /record/15169

N. N., Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems. 2019.
LibreCat: /record/17809

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: /record/8534
DOI: 10.1145/3323165.3323193
arXiv: 1805.03472

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: /record/8871
DOI: 10.1145/3323165.3323195

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: /record/6976

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: /record/10586
DOI: 10.4230/LIPICS.ICALP.2019.150