Forschungsschwerpunkte des Lehrstuhls
- Verteilte Algorithmen und Datenstrukturen
- Sicherheit in verteilten Systemen
- Netzwerktheorie (insbesondere Peer-to-Peer Systeme, mobile ad-hoc Netzwerke und Sensor-Netzwerke)
- Spieltheorie
Aktuelle Forschungsprojekte
Abgeschlossene Foschungsprojekte
Open-Source-Software
Promotionen der Fachgruppe
2026
- David Liedtke: Local Reconfiguration Algorithms for Geometric Modular Systems, 08.07.2026
2025
- Jonas Harbig: Forming Large Patterns from Widespread Swarms of Oblivious Robots with Limited Visibility, 31.07.2025
- Thorsten Götte: Distributed algorithms for modern communication networks, 25.03.2025
2022
- Christina Kolb: Competitive routing in hybrid communication networks and message efficient SetCover in Ad Hoc networks, 09.03.2022
2021
- Kristian Hinnenthal: Models and algorithms for hybrid networks and hybrid programmable matter, 21.06.2021
- Michael Feldmann: Algorithms for distributed data structures and self-stabilizing overlay networks, 29.03.2021
2020
- Alexander Setzer: Local graph transformation primitives for some basic problems in Overlay networks, 27.08.2020
2018
- Robert Gmyr: Distributed Algorithms for Overlay Networks and Programmable Matter, 25.01.2018
2017
- Thim Frederik Strothmann: Self-* Algorithms for Distributed Systems, 18.07.2017
2016
- Martina Eikel: Insider-resistent Distributed Storage Systems, 16.02.2016
2015
- Andreas Koutsopoulos: Dynamics and Efficiency in Topological Self-Stabilization, 16.12.2015
- Sebastian Kniesburges: Distributed Data Structures and the Power of topological Self-Stabilization, 21.05.2015
2014
- Adrian Ogierman: Epidemic spreading and information dissemination in technological and social systems, 24.10.2014
Publikationen
2026
Comparing Existing Methods to Efficiently Place Drones to Connect Isolated Communication Clusters
T. Berger, Comparing Existing Methods to Efficiently Place Drones to Connect Isolated Communication Clusters, 2026.
Polylogarithmic time algorithms for shortest path forests in programmable matter
A. Padalkin, C. Scheideler, Distributed Computing 39 (2026).
Fast Distributed Computation of Compact Routing Schemes
J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, J. Werthmann, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2026.
Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers
J. Augustine, H. Hillebrandt, M. Kumar, C. Scheideler, J. Werthmann, in: Proceedings of the ACM Symposium on Principles of Distributed Computing, ACM, 2026.
2025
Enhancing Blockchain Efficiency via Median Rule
M.J.B. Showmik, Enhancing Blockchain Efficiency via Median Rule, 2025.
Alle Publikationen anzeigen