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.
72 Publications
2018 | Bachelorsthesis | LibreCat-ID: 18032
N., N. (2018). Decontaminating Planar Regions with Finite Automaton Robots and Tiles.
LibreCat
2018 | Bachelorsthesis | LibreCat-ID: 18033
Wulfes, R. (2018). Load-Balanced Routing in Hybriden Kommunikationsnetzwerken. Universität Paderborn.
LibreCat
2018 | Bachelorsthesis | LibreCat-ID: 5368
Jochmaring, M. (2018). Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten. Universität Paderborn.
LibreCat
2017 | Bachelorsthesis | LibreCat-ID: 18026
Burkhardt, M. (2017). Untersuchungen zum Cone-Hashing. Universität Paderborn.
LibreCat
2017 | Bachelorsthesis | LibreCat-ID: 18027
Banh, N. C. (2017). An Asynchronous Adaption of a Churn-resistant Overlay Network. Universität Paderborn.
LibreCat
2017 | Bachelorsthesis | LibreCat-ID: 18028
Schenk, A. (2017). Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen. Universität Paderborn.
LibreCat
2017 | Bachelorsthesis | LibreCat-ID: 18029
Beckendorf, B. (2017). Visualisierung zu Algorithmen verteilter Netzwerksysteme. Universität Paderborn.
LibreCat
2017 | Mastersthesis | LibreCat-ID: 81
Luo, L. (2017). MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained. Universität Paderborn.
LibreCat
2017 | Dissertation | LibreCat-ID: 61
Strothmann, T. F. (2017). Self-* Algorithms for Distributed Systems. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-150
LibreCat
| DOI
2017 | Mastersthesis | LibreCat-ID: 699
Sundermeier, J. (2017). Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions. Universität Paderborn.
LibreCat