Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung
S. Dorociak, Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung, 2024.

A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes
C. De Groote, A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes, 2024.

Optimal Drone Strategies For Packet Delivery
R. Doddegowda, Optimal Drone Strategies For Packet Delivery, 2024.

Evaluating the Implications
H. Thakur, Evaluating the Implications, 2024.

Minimum Edge Cuts in Overlay Networks
J. Schweichhart, Minimum Edge Cuts in Overlay Networks, 2023.

Utilizing Redundancy in Distributed Heterogeneous Storage
F. Schneider, Utilizing Redundancy in Distributed Heterogeneous Storage, 2023.

Graph Neural Network-based Anomaly Detection in  Smart Grid Energy Consumption
A. Ranade, Graph Neural Network-Based Anomaly Detection in  Smart Grid Energy Consumption, 2023.

Highly accurate deep compressed facial recognition
O. Ali, Highly Accurate Deep Compressed Facial Recognition, 2023.

Virtual On-Demand Volunteer System Based on Delaunay Triangulation
N. Ashri, Virtual On-Demand Volunteer System Based on Delaunay Triangulation, 2023.

Improving the End-of-Line Test of Custom-Built Geared Motors using Clustering based on Neural Networks
N. N., Improving the End-of-Line Test of Custom-Built Geared Motors Using Clustering Based on Neural Networks, 2023.

Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite
L. Decking, Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen Gewichteten Bandbreite, 2023.

Entwicklung und Analyse von Formeln zur Abschätzung der Renderingzeit eines Frames
A. Nickel, Entwicklung Und Analyse von Formeln Zur Abschätzung Der Renderingzeit Eines Frames, 2023.

Reconstruction of 3D Surfels from Neural Radiance Fields
V. Telaprolu, Reconstruction of 3D Surfels from Neural Radiance Fields, 2023.

Shape Reconfiguration by Hybrid Programmable Matter
J. Friemel, Shape Reconfiguration by Hybrid Programmable Matter, 2023.

Self-Stabilizing Skip-Graph with Growth-bounded Metric
B. Beckendorf, Self-Stabilizing Skip-Graph with Growth-Bounded Metric, 2023.

Evaluation of Algorithms for the Node Capacitated Clique
R. Roopa, Evaluation of Algorithms for the Node Capacitated Clique, 2022.

Aufarbeitung und lmplementierung von DAG-Rider
S. Korzeczek, Aufarbeitung Und Lmplementierung von DAG-Rider, 2022.

Hybrid Routing in Three Dimensions
M. Nachtigall, Hybrid Routing in Three Dimensions, 2022.

Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen
H. Hillebrandt, Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen, 2022.

Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks
C. Kolb, Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks, 2022.

Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter
K. Hinnenthal, Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter, 2021.

Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model
D.J. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model, 2021.

Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers
D. Suermann, Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers, 2021.

Selbststabilisierender Bakery Algorithmus für verteilte Systeme
L. Everling, Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme, 2021.

Peer-to-Peer Matching for Distributed Systems
V. Adsul, Peer-to-Peer Matching for Distributed Systems, 2021.

Derandomization and Local Graph Problems in the Node-Capacitated Clique
J. Werthmann, Derandomization and Local Graph Problems in the Node-Capacitated Clique, 2021.

Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter
M. Mengshi, Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter, 2021.

Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model
D. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model, 2021.

Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks
M. Feldmann, Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks, 2021.

Plurality Consensus in Hybrid Networks
P.K. Yeole, Plurality Consensus in Hybrid Networks, 2020.

A self stabilizing protocol for well-formed trees in hybrid networks
M. Jochmaring, A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks, 2020.

Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks
M. Skowronek, Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks, Universität Paderborn, 2020.

Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks
A. Setzer, Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks, Universität Paderborn, 2020.

Algorithmen für selbststabilisierende Skip+-Delaunaygraphen
A. Guggenmos, Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen, Universität Paderborn, 2020.

On the complexity of local transformations in SDN overlays
D. Warner, On the Complexity of Local Transformations in SDN Overlays, Universität Paderborn, 2020.

Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems
N. N., Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems, 2019.

Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves
N. N., Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves, Universität Paderborn, 2019.

Distributed Algorithms for Overlay Networks and Programmable Matter
R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter, Universität Paderborn, 2018.

Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten
N. N., Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn, 2018.

Gathering Strategien für mobile Roboterschwärme im Gitternetz
N. N., Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz, 2018.

Decontaminating Planar Regions with Finite Automaton Robots and Tiles
N. N., Decontaminating Planar Regions with Finite Automaton Robots and Tiles, 2018.

Load-Balanced Routing in Hybriden Kommunikationsnetzwerken
R. Wulfes, Load-Balanced Routing in Hybriden Kommunikationsnetzwerken, Universität Paderborn, 2018.

Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten
M. Jochmaring, Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn, 2018.

Untersuchungen zum Cone-Hashing
M. Burkhardt, Untersuchungen Zum Cone-Hashing, Universität Paderborn, 2017.

An Asynchronous Adaption of a Churn-resistant Overlay Network
N.C. Banh, An Asynchronous Adaption of a Churn-Resistant Overlay Network, Universität Paderborn, 2017.

Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen
A. Schenk, Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen, Universität Paderborn, 2017.

Visualisierung zu Algorithmen verteilter Netzwerksysteme
B. Beckendorf, Visualisierung Zu Algorithmen Verteilter Netzwerksysteme, Universität Paderborn, 2017.

MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained
L. Luo, MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained, Universität Paderborn, 2017.

Self-* Algorithms for Distributed Systems
T.F. Strothmann, Self-* Algorithms for Distributed Systems, Universität Paderborn, 2017.

Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions
J. Sundermeier, Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions, Universität Paderborn, 2017.