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. (2021). Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model.
LibreCat
2021 | Dissertation | LibreCat-ID: 21628
Feldmann, M. (2021). Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks. https://doi.org/10.17619/UNIPB/1-1113
LibreCat
| Files available
| DOI
2021 | Conference Paper | LibreCat-ID: 30217
Coy, S., Czumaj, A., Feldmann, M., Hinnenthal, K., Kuhn, F., Scheideler, C., Schneider, P., & Struijs, M. (2021). Near-Shortest Path Routing in Hybrid Communication Networks. In Q. Bramas, V. Gramoli, & A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France (Vol. 217, p. 11:1–11:23). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2021.11
LibreCat
| DOI
2020 | Mastersthesis | LibreCat-ID: 20221
Yeole, P. K. (2020). Plurality Consensus in Hybrid Networks.
LibreCat
2020 | Conference (Editor) | LibreCat-ID: 17836
Werneck Richa, A., & Scheideler, C. (Eds.). (2020). Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings (Vol. 12156). Springer. https://doi.org/10.1007/978-3-030-54921-3
LibreCat
| DOI
2020 | Conference (Editor) | LibreCat-ID: 17839
Scheideler, C., & Spear, M. (Eds.). (2020). SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM. https://doi.org/10.1145/3350755
LibreCat
| DOI
2020 | Mastersthesis | LibreCat-ID: 20495
Jochmaring, M. (2020). A self stabilizing protocol for well-formed trees in hybrid networks.
LibreCat
2020 | Conference Paper | LibreCat-ID: 20755
Feldmann, M., Hinnenthal, K., & Scheideler, C. (2020). 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. https://doi.org/10.4230/LIPIcs.OPODIS.2020.31
LibreCat
| Files available
| DOI
| arXiv
2020 | Bachelorsthesis | LibreCat-ID: 18066
Skowronek, M. (2020). Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks. Universität Paderborn.
LibreCat
2020 | Dissertation | LibreCat-ID: 18520
Setzer, A. (2020). Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-1026
LibreCat
| DOI