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
D. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model. 2021.
LibreCat
 

2021 | Dissertation | LibreCat-ID: 21628
M. Feldmann, Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks. 2021.
LibreCat | Files available | DOI
 

2021 | Conference Paper | LibreCat-ID: 30217
S. Coy et al., “Near-Shortest Path Routing in Hybrid Communication Networks,” in 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, 2021, vol. 217, p. 11:1–11:23, doi: 10.4230/LIPIcs.OPODIS.2021.11.
LibreCat | DOI
 

2020 | Mastersthesis | LibreCat-ID: 20221
P. K. Yeole, Plurality Consensus in Hybrid Networks. 2020.
LibreCat
 

2020 | Conference (Editor) | LibreCat-ID: 17836
A. Werneck Richa and C. Scheideler, Eds., Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings, vol. 12156. Springer, 2020.
LibreCat | DOI
 

2020 | Conference (Editor) | LibreCat-ID: 17839
C. Scheideler and M. Spear, Eds., SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM, 2020.
LibreCat | DOI
 

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 | Dissertation | LibreCat-ID: 18520
A. Setzer, Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks. Universität Paderborn, 2020.
LibreCat | DOI
 

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

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

2020 | Conference Paper | LibreCat-ID: 16903
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 | DOI | arXiv
 

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
 

Filters and Search Terms

department=79

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed