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 C. 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 T, Scheideler C. A self-stabilizing Hashed Patricia Trie. Information and Computation. Published online 2022. doi:10.1016/j.ic.2021.104697
LibreCat
| DOI
2021 | Dissertation | LibreCat-ID: 24887
Hinnenthal K. 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 L. Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme.; 2021.
LibreCat
2021 | Mastersthesis | LibreCat-ID: 27072
Adsul V. Peer-to-Peer Matching for Distributed Systems.; 2021.
LibreCat
2021 | Mastersthesis | LibreCat-ID: 21084
Werthmann J. Derandomization and Local Graph Problems in the Node-Capacitated Clique.; 2021.
LibreCat
2021 | Bachelorsthesis | LibreCat-ID: 21197
Mengshi M. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter.; 2021.
LibreCat
2021 | Dissertation | LibreCat-ID: 21628
Feldmann M. 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 B, Knollmann T, Malatyali M, Meyer auf der Heide F. Managing Multiple Mobile Resources. Theory of Computing Systems. 2021;65:943–984. doi:10.1007/s00224-020-10023-8
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 20817
Bienkowski M, Feldkord B, Schmidt P. A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. In: Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS). ; 2021:14:1-14:17. doi:10.4230/LIPIcs.STACS.2021.14
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 22283
Götte T, Hinnenthal K, Scheideler C, Werthmann J. Time-Optimal Construction of Overlays. In: Censor-Hillel K, ed. Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21). New York: ACM. doi:10.1145/3465084.3467932
LibreCat
| Files available
| DOI
2021 | Book Chapter | LibreCat-ID: 26888
Götte T, Kolb C, Scheideler C, Werthmann J. Beep-And-Sleep: Message and Energy Efficient Set Cover. In: Algorithms for Sensor Systems (ALGOSENSORS ’21). ; 2021. doi:10.1007/978-3-030-89240-1_7
LibreCat
| DOI
2021 | Bachelorsthesis | LibreCat-ID: 44234
Berger TF. Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation.; 2021.
LibreCat
2021 | Bachelorsthesis | LibreCat-ID: 44233
Pranger S. Online K-Facility Reallocation Using k-Server Algorithms.; 2021.
LibreCat
2020 | Mastersthesis | LibreCat-ID: 20221
Yeole PK. Plurality Consensus in Hybrid Networks.; 2020.
LibreCat
2020 | Conference Paper | LibreCat-ID: 17370
Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The Online Multi-Commodity Facility Location Problem. In: 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 A, Scheideler C, eds. 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 C, Spear M, eds. 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 M. A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks.; 2020.
LibreCat
2020 | Conference Paper | LibreCat-ID: 20755
Feldmann M, Hinnenthal K, Scheideler C. 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; 2020. doi:10.4230/LIPIcs.OPODIS.2020.31
LibreCat
| Files available
| DOI
| arXiv