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
2022 | Dissertation | LibreCat-ID: 30239
Kolb, Christina. Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks. 2022, doi:10.17619/UNIPB/1-1673 .
LibreCat
| DOI
2022 | Journal Article | LibreCat-ID: 21096
Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” Information and Computation, 104697, 2022, doi:10.1016/j.ic.2021.104697.
LibreCat
| DOI
2021 | Dissertation | LibreCat-ID: 24887
Hinnenthal, Kristian. Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter. 2021, doi:10.17619/UNIPB/1-1169 .
LibreCat
| DOI
2021 | Bachelorsthesis | LibreCat-ID: 27053
Everling, Leon. Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme. 2021.
LibreCat
2021 | Mastersthesis | LibreCat-ID: 27072
Adsul, Vaibhav. Peer-to-Peer Matching for Distributed Systems. 2021.
LibreCat
2021 | Mastersthesis | LibreCat-ID: 21084
Werthmann, Julian. Derandomization and Local Graph Problems in the Node-Capacitated Clique. 2021.
LibreCat
2021 | Bachelorsthesis | LibreCat-ID: 21197
Mengshi, Ma. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter. 2021.
LibreCat
2021 | Dissertation | LibreCat-ID: 21628
Feldmann, Michael. Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks. 2021, doi:10.17619/UNIPB/1-1113.
LibreCat
| Files available
| DOI
2021 | Journal Article | LibreCat-ID: 20683
Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” Theory of Computing Systems, vol. 65, 2021, pp. 943–984, doi:10.1007/s00224-020-10023-8.
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 20817
Bienkowski, Marcin, et al. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.” Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17, doi:10.4230/LIPIcs.STACS.2021.14.
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 22283
Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), edited by Keren Censor-Hillel, ACM, doi:10.1145/3465084.3467932.
LibreCat
| Files available
| DOI
2021 | Book Chapter | LibreCat-ID: 26888
Götte, Thorsten, et al. “Beep-And-Sleep: Message and Energy Efficient Set Cover.” Algorithms for Sensor Systems (ALGOSENSORS ’21), 2021, doi:10.1007/978-3-030-89240-1_7.
LibreCat
| DOI
2021 | Bachelorsthesis | LibreCat-ID: 44234
Berger, Thilo Frederik. Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation. 2021.
LibreCat
2021 | Bachelorsthesis | LibreCat-ID: 44233
Pranger, Sebastian. Online K-Facility Reallocation Using k-Server Algorithms. 2021.
LibreCat
2020 | Mastersthesis | LibreCat-ID: 20221
Yeole, Paresh Kishor. Plurality Consensus in Hybrid Networks. 2020.
LibreCat
2020 | Conference Paper | LibreCat-ID: 17370
Castenow, Jannik, et al. “The Online Multi-Commodity Facility Location Problem.” Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020, doi:10.1145/3350755.3400281.
LibreCat
| Files available
| DOI
| arXiv
2020 | Conference (Editor) | LibreCat-ID: 17836
Werneck Richa, Andrea, and Christian Scheideler, editors. Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings. Vol. 12156, Springer, 2020, doi:10.1007/978-3-030-54921-3.
LibreCat
| DOI
2020 | Conference (Editor) | LibreCat-ID: 17839
Scheideler, Christian, and Michael Spear, editors. SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM, 2020, doi:10.1145/3350755.
LibreCat
| DOI
2020 | Mastersthesis | LibreCat-ID: 20495
Jochmaring, Moritz. A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks. 2020.
LibreCat
2020 | Conference Paper | LibreCat-ID: 20755
Feldmann, Michael, et al. “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.” Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.OPODIS.2020.31.
LibreCat
| Files available
| DOI
| arXiv