79 Publications

2023 | Mastersthesis | LibreCat-ID: 44735
Schweichhart, J. (2023). Minimum Edge Cuts in Overlay Networks.
LibreCat
 
2023 | Dissertation | LibreCat-ID: 45580
Castenow, J. (2023). Local Protocols for Contracting and Expanding Robot Formation Problems. https://doi.org/10.17619/UNIPB/1-1750
LibreCat | DOI
 
2023 | Dissertation | LibreCat-ID: 45579
Knollmann, T. (2023). Online Algorithms for Allocating Heterogeneous Resources. https://doi.org/10.17619/UNIPB/1-1751
LibreCat | DOI
 
2023 | Mastersthesis | LibreCat-ID: 46110
Ashri, N. (2023). Virtual On-Demand Volunteer System Based on Delaunay Triangulation.
LibreCat
 
2023 | Bachelorsthesis | LibreCat-ID: 47134
Deppe, V. (2023). Routing in Hypergraphs.
LibreCat
 
2022 | Mastersthesis | LibreCat-ID: 30152
Roopa, R. (2022). Evaluation of Algorithms for the Node Capacitated Clique.
LibreCat
 
2022 | Mastersthesis | LibreCat-ID: 30199
Nachtigall, M. (2022). Hybrid Routing in Three Dimensions.
LibreCat
 
2022 | Bachelorsthesis | LibreCat-ID: 31947
Hillebrandt, H. (2022). Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen.
LibreCat | Files available
 
2022 | Dissertation | LibreCat-ID: 30239
Kolb, C. (2022). Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks. https://doi.org/10.17619/UNIPB/1-1673
LibreCat | DOI
 
2021 | Dissertation | LibreCat-ID: 24887
Hinnenthal, K. (2021). Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter. https://doi.org/10.17619/UNIPB/1-1169
LibreCat | DOI
 
2021 | Bachelorsthesis | LibreCat-ID: 27053
Everling, L. (2021). Selbststabilisierender Bakery Algorithmus für verteilte Systeme.
LibreCat
 
2021 | Mastersthesis | LibreCat-ID: 27072
Adsul, V. (2021). Peer-to-Peer Matching for Distributed Systems.
LibreCat
 
2021 | Mastersthesis | LibreCat-ID: 21084
Werthmann, J. (2021). Derandomization and Local Graph Problems in the Node-Capacitated Clique.
LibreCat
 
2021 | Bachelorsthesis | LibreCat-ID: 21197
Mengshi, M. (2021). Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter.
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 | Bachelorsthesis | LibreCat-ID: 44234
Berger, T. F. (2021). Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource Allocation.
LibreCat
 
2021 | Bachelorsthesis | LibreCat-ID: 44233
Pranger, S. (2021). Online k-Facility Reallocation using k-Server Algorithms.
LibreCat
 
2020 | Mastersthesis | LibreCat-ID: 20221
Yeole, P. K. (2020). Plurality Consensus in Hybrid Networks.
LibreCat
 
2020 | Mastersthesis | LibreCat-ID: 20495
Jochmaring, M. (2020). A self stabilizing protocol for well-formed trees in hybrid networks.
LibreCat
 
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 | Bachelorsthesis | LibreCat-ID: 18648
Guggenmos, A. (2020). Algorithmen für selbststabilisierende Skip+-Delaunaygraphen. Universität Paderborn.
LibreCat
 
2020 | Dissertation | LibreCat-ID: 15631
Feldkord, B. (2020). Mobile Resource Allocation. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-869
LibreCat | Files available | DOI
 
2020 | Mastersthesis | LibreCat-ID: 15770
Warner, D. (2020). On the complexity of local transformations in SDN overlays. Universität Paderborn.
LibreCat
 
2018 | Dissertation | LibreCat-ID: 1138
Gmyr, R. (2018). Distributed Algorithms for Overlay Networks and Programmable Matter. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-265
LibreCat | DOI
 
2018 | Bachelorsthesis | LibreCat-ID: 18030
N., N. (2018). Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten. Universität Paderborn.
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
 
2018 | Bachelorsthesis | LibreCat-ID: 5403
Geromel, M. (2018). Mobile Facility Leasing. Universität Paderborn.
LibreCat
 
2018 | Bachelorsthesis | LibreCat-ID: 5404
Kolpaczki, P. I. (2018). Online Algorithmen für das k-Page Migration Problem. Universität Paderborn.
LibreCat
 
2018 | Dissertation | LibreCat-ID: 1209
Jung, D. (2018). Local Strategies for Swarm Formations on a Grid. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-271
LibreCat | Files available | DOI
 
2017 | Bachelorsthesis | LibreCat-ID: 18026
Burkhardt, M. (2017). Untersuchungen zum Cone-Hashing. 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
 
2017 | Mastersthesis | LibreCat-ID: 700
Knollmann, T. (2017). A Self-Stabilizing Protocol for Graphs of Diameter Two. Universität Paderborn.
LibreCat
 
2017 | Mastersthesis | LibreCat-ID: 701
Götte, T. (2017). Self-Stabilizing Spanners for Tree Metrics. Universität Paderborn.
LibreCat
 
2017 | Bachelorsthesis | LibreCat-ID: 696
Wachowiak, L. (2017). Das Mobile Server Problem in Netzwerken. Universität Paderborn.
LibreCat
 
2017 | Bachelorsthesis | LibreCat-ID: 697
Burkhardt, M. (2017). Untersuchungen zum Cone-Hashing. Universität Paderborn.
LibreCat
 
2017 | Bachelorsthesis | LibreCat-ID: 1048
Schenk, A. (2017). Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen. Universität Paderborn.
LibreCat
 
2017 | Bachelorsthesis | LibreCat-ID: 1049
Beckendorfer, B. (2017). Visualisierung zu Algorithmen verteilter Netzwerksysteme. Universität Paderborn.
LibreCat
 
2016 | Mastersthesis | LibreCat-ID: 688
Kutzias, D. (2016). Friendship Processes in Network Creation Games. Universität Paderborn.
LibreCat
 
2016 | Mastersthesis | LibreCat-ID: 689
Schaefer, J. S. (2016). Routing Algorithms on Delayed Networks for Disaster Management Support. Universität Paderborn.
LibreCat
 
2016 | Dissertation | LibreCat-ID: 154
Cord-Landwehr, A. (2016). Selfish Network Creation - On Variants of Network Creation Games (Vol. 353). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat | Files available
 
2015 | Mastersthesis | LibreCat-ID: 281
Rojahn, T. (2015). Load Balancing for Range Queries in a Dimension Invariant Peer-to-Peer Network. Universität Paderborn.
LibreCat
 
2015 | Dissertation | LibreCat-ID: 304
Koutsopoulos, A. (2015). Dynamics and Efficiency in Topological Self-Stabilization. Universität Paderborn.
LibreCat | Files available
 
2015 | Dissertation | LibreCat-ID: 305
Kniesburges, S. (2015). Distributed Data Structures and the Power of topological Self-Stabilization. Universität Paderborn.
LibreCat | Files available
 
2015 | Dissertation | LibreCat-ID: 270
Abshoff, S. (2015). On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks. Universität Paderborn.
LibreCat | Files available
 
2015 | Mastersthesis | LibreCat-ID: 276
Hohenberger, T. (2015). Network Creation Games with Interest Groups. Universität Paderborn.
LibreCat
 
2015 | Mastersthesis | LibreCat-ID: 278
Feldmann, M. (2015). Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs. Universität Paderborn.
LibreCat
 
2015 | Bachelorsthesis | LibreCat-ID: 18003
Götte, T. (2015). Covering and Bridging im selbstorganisierenden Partikelsystem Amoebabot. Universität Paderborn.
LibreCat
 
2015 | Bachelorsthesis | LibreCat-ID: 18005
Korfmacher, C. (2015). Implementierung und Analyse von Cone-DHT. Universität Paderborn.
LibreCat
 
2015 | Bachelorsthesis | LibreCat-ID: 18006
Sundermeier, J. (2015). Implementierung eines selbststabilisierenden verteilten Stacks. Universität Paderborn.
LibreCat
 
2015 | Bachelorsthesis | LibreCat-ID: 18024
Knollmann, T. (2015). Implementierung einer selbststabilisierenden Datenstruktur für das längste gemeinsame Präfix. Universität Paderborn.
LibreCat
 
2015 | Bachelorsthesis | LibreCat-ID: 694
Stilow, G. (2015). Mobile Agenten in Netzwerken: Analyse von Hotspots. Universität Paderborn.
LibreCat
 
2014 | Mastersthesis | LibreCat-ID: 391
Feldkord, B. (2014). On Variants of the Page Migration Problem. Universität Paderborn.
LibreCat
 
2014 | Bachelorsthesis | LibreCat-ID: 434
Luo, L. (2014). Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen. Universität Paderborn.
LibreCat
 
2013 | Bachelorsthesis | LibreCat-ID: 18000
Blumentritt, F. (2013). Cliquenbildung in verteilten Systemen. Universität Paderborn.
LibreCat
 
2013 | Bachelorsthesis | LibreCat-ID: 503
Blix, A. (2013). Optimale und adaptive binäre Bäume in Netzwerken. Universität Paderborn.
LibreCat
 
2013 | Mastersthesis | LibreCat-ID: 510
Jayesh Parekh, C. (2013). Meta-data based Search in Structured Peer-to-Peer Networks. Universität Paderborn.
LibreCat
 
2013 | Dissertation | LibreCat-ID: 514
Pietrzyk, P. (2013). Local and Online Algorithms for Facility Location. Universität Paderborn.
LibreCat | Files available
 
2013 | Mastersthesis | LibreCat-ID: 522
Feldotto, M. (2013). HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. Universität Paderborn.
LibreCat
 
2013 | Mastersthesis | LibreCat-ID: 526
Mäcker, A. (2013). Greedy Network Creation With Heavy And Light Edges. Universität Paderborn.
LibreCat
 
2013 | Mastersthesis | LibreCat-ID: 537
Heindorf, S. (2013). Dispersion of Multi-Robot Teams. Universität Paderborn.
LibreCat
 
2013 | Bachelorsthesis | LibreCat-ID: 545
Blumentritt, F. (2013). Cliquenbildung in verteilten Systemen. Universität Paderborn.
LibreCat
 
2013 | Mastersthesis | LibreCat-ID: 555
Setzer, A. (2013). Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs. Universität Paderborn.
LibreCat
 
2012 | Mastersthesis | LibreCat-ID: 575
Bremer, L. (2012). Symbiotic Coupling of Peer-to-Peer and Cloud Systems. Universität Paderborn.
LibreCat
 
2012 | Mastersthesis | LibreCat-ID: 582
Strothmann, T. F. (2012). Self-Optimizing Binary Search Trees - A Game Theoretic Approach. Universität Paderborn.
LibreCat
 
2012 | Mastersthesis | LibreCat-ID: 594
Klerx, T. (2012). Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen. Universität Paderborn.
LibreCat
 
2012 | Bachelorsthesis | LibreCat-ID: 600
Feldkord, B. (2012). Lokale Swaps und überholte Informationen in Basic Network Creation Games. Universität Paderborn.
LibreCat
 
2012 | Dissertation | LibreCat-ID: 601
Kempkes, B. (2012). Local strategies for robot formation problems (Vol. 302). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
LibreCat | Files available
 
2012 | Mastersthesis | LibreCat-ID: 618
Kurras, S. (2012). Distributed Sampling of Regular Graphs. Universität Paderborn.
LibreCat
 
2012 | Bachelorsthesis | LibreCat-ID: 638
Eidens, F. (2012). Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken. Universität Paderborn.
LibreCat
 
2012 | Mastersthesis | LibreCat-ID: 641
Schluessler, J. (2012). A Forensic Framework for Automatic Information Retrieval in Distributed Systems. Universität Paderborn.
LibreCat
 
2011 | Bachelorsthesis | LibreCat-ID: 17997
Setzer, A. (2011). Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk. Universität Paderborn.
LibreCat
 
2011 | Mastersthesis | LibreCat-ID: 648
Brandes, P. (2011). Robust Distributed Computation in Dynamic Networks. Universität Paderborn.
LibreCat
 
2011 | Mastersthesis | LibreCat-ID: 663
Swierkot, K. (2011). Complexity Classes for Local Computation. Universität Paderborn.
LibreCat
 
2011 | Mastersthesis | LibreCat-ID: 665
Wette, P. (2011). Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord. Universität Paderborn.
LibreCat
 

Filters and Search Terms

project=5

(type=bachelorsthesis OR type=mastersthesis OR type=dissertation)

Search

Filter Publications

Display / Sort

Citation Style: APA

Export