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.

193 Publications


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 | 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 | Dissertation | LibreCat-ID: 15631
B. Feldkord, Mobile Resource Allocation. Universität Paderborn, 2020.
LibreCat | Files available | DOI
 

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
 

2020 | Journal Article | LibreCat-ID: 13770
H. Karl, D. Kundisch, F. Meyer auf der Heide, and H. Wehrheim, “A Case for a New IT Ecosystem: On-The-Fly Computing,” Business & Information Systems Engineering, vol. 62, no. 6, pp. 467–481, 2020, doi: 10.1007/s12599-019-00627-x.
LibreCat | Files available | DOI
 

2019 | Conference Paper | LibreCat-ID: 7636
L. Luo, C. Scheideler, and T. F. Strothmann, “MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability,” in Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), Rio de Janeiro, Brazil, 2019.
LibreCat | Files available
 

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: 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: 12870
B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing Multiple Mobile Resources,” in Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), 2019, pp. 120–137.
LibreCat | DOI | arXiv
 

2019 | Conference Paper | LibreCat-ID: 15627
J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, and P. Schneider, “Shortest Paths in a Hybrid Network Model,” in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, pp. 1280–1299.
LibreCat | DOI
 

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

2019 | Journal Article | LibreCat-ID: 13873
B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” ACM Transactions on Parallel Computing (TOPC), vol. 6, no. 3, 2019.
LibreCat | Files available | DOI
 

2019 | Conference Paper | LibreCat-ID: 13942
C. Markarian and F. Meyer auf der Heide, “Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location,” in Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, 2019, pp. 315–321.
LibreCat | DOI
 

2019 | Journal Article | LibreCat-ID: 13946
F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “Efficient parallel algorithms for parameterized problems,” Theoretical Computer Science, vol. 786, pp. 2–12, 2019.
LibreCat | 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
 

2019 | Conference Paper | LibreCat-ID: 13652
K. Hinnenthal, C. Scheideler, and M. Struijs, “Fast Distributed Algorithms for LP-Type Problems of Low Dimension,” in 33rd International Symposium on Distributed Computing (DISC 2019), 2019.
LibreCat | DOI
 

Filters and Search Terms

(project=5)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed