@inproceedings{28917,
  author       = {{Feldmann, Michael and Padalkin, Andreas and Scheideler, Christian and Dolev, Shlomi}},
  booktitle    = {{Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings}},
  editor       = {{Johnen, Colette and Michael Schiller, Elad and Schmid, Stefan}},
  pages        = {{484--488}},
  publisher    = {{Springer}},
  title        = {{{Coordinating Amoebots via Reconfigurable Circuits}}},
  doi          = {{10.1007/978-3-030-91081-5\_34}},
  volume       = {{13046}},
  year         = {{2021}},
}

@misc{28998,
  author       = {{Suermann, Dennis}},
  title        = {{{Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers}}},
  year         = {{2021}},
}

@misc{27053,
  author       = {{Everling, Leon}},
  title        = {{{Selbststabilisierender Bakery Algorithmus für verteilte Systeme}}},
  year         = {{2021}},
}

@misc{27072,
  author       = {{Adsul, Vaibhav}},
  title        = {{{Peer-to-Peer Matching for Distributed Systems}}},
  year         = {{2021}},
}

@misc{21084,
  author       = {{Werthmann, Julian}},
  title        = {{{Derandomization and Local Graph Problems in the Node-Capacitated Clique}}},
  year         = {{2021}},
}

@misc{21197,
  author       = {{Mengshi, Ma}},
  title        = {{{Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter}}},
  year         = {{2021}},
}

@misc{21627,
  author       = {{Liedtke, David}},
  title        = {{{Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model}}},
  year         = {{2021}},
}

@phdthesis{21628,
  abstract     = {{This thesis considers the realization of distributed data structures and the construction of distributed protocols for self-stabilizing overlay networks.

In the first part of this thesis, we provide distributed protocols for queues, stacks and priority queues that serve the insertion and deletion of elements within a logarithmic amount of rounds.
Our protocols respect semantic constraints such as sequential consistency or serializability and the individual semantic constraints given by the type (queue, stack, priority queue) of the data structure.
We furthermore provide a protocol that handles joining and leaving nodes.
As an important side product, we present a novel protocol solving the distributed $k$-selection problem in a logarithmic amount of rounds, that is, to find the $k$-smallest elements among a polynomial number of elements spread among $n$ nodes.
	
The second part of this thesis is devoted to the construction of protocols for self-stabilizing overlay networks, i.e., distributed protocols that transform an overlay network from any initial (potentially illegitimate) state into a legitimate state in finite time.
We present protocols for self-stabilizing generalized De Bruijn graphs, self-stabilizing quadtrees and self-stabilizing supervised skip rings.
Each of those protocols comes with unique properties that makes it interesting for certain distributed applications.
Generalized De Bruijn networks provide routing within a constant amount of hops, thus serving the interest in networks that require a low latency for requests.
The protocol for the quadtree guarantees monotonic searchability as well as a geometric variant of monotonic searchability, making it interesting for wireless networks or applications needed in the area of computational geometry.
The supervised skip ring can be used to construct a self-stabilizing publish-subscribe system.
}},
  author       = {{Feldmann, Michael}},
  title        = {{{Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks}}},
  doi          = {{10.17619/UNIPB/1-1113}},
  year         = {{2021}},
}

@inproceedings{30217,
  author       = {{Coy, Sam and Czumaj, Artur and Feldmann, Michael and Hinnenthal, Kristian and Kuhn, Fabian and Scheideler, Christian and Schneider, Philipp and Struijs, Martijn}},
  booktitle    = {{25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France}},
  editor       = {{Bramas, Quentin and Gramoli, Vincent and Milani, Alessia}},
  pages        = {{11:1–11:23}},
  publisher    = {{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}},
  title        = {{{Near-Shortest Path Routing in Hybrid Communication Networks}}},
  doi          = {{10.4230/LIPIcs.OPODIS.2021.11}},
  volume       = {{217}},
  year         = {{2021}},
}

@misc{20221,
  author       = {{Yeole, Paresh Kishor}},
  title        = {{{Plurality Consensus in Hybrid Networks}}},
  year         = {{2020}},
}

@proceedings{17836,
  editor       = {{Werneck Richa, Andrea and Scheideler, Christian}},
  isbn         = {{978-3-030-54920-6}},
  publisher    = {{Springer}},
  title        = {{{Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings}}},
  doi          = {{10.1007/978-3-030-54921-3}},
  volume       = {{12156}},
  year         = {{2020}},
}

@proceedings{17839,
  editor       = {{Scheideler, Christian and Spear, Michael}},
  isbn         = {{978-1-4503-6935-0}},
  publisher    = {{ACM}},
  title        = {{{SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020}}},
  doi          = {{10.1145/3350755}},
  year         = {{2020}},
}

@misc{20495,
  author       = {{Jochmaring, Moritz}},
  title        = {{{A self stabilizing protocol for well-formed trees in hybrid networks}}},
  year         = {{2020}},
}

@inproceedings{20755,
  abstract     = {{We consider the problem of computing shortest paths in \emph{hybrid networks}, in which nodes can make use of different communication modes. For example, mobile phones may use ad-hoc connections via Bluetooth or Wi-Fi in addition to the cellular network to solve tasks more efficiently. Like in this case, the different communication modes may differ considerably in range, bandwidth, and flexibility. We build upon the model of Augustine et al. [SODA '20], which captures these differences by a \emph{local} and a \emph{global} mode. Specifically, the local edges model a fixed communication network in which $O(1)$ messages of size $O(\log n)$ can be sent over every edge in each synchronous round. The global edges form a clique, but nodes are only allowed to send and receive a total of at most $O(\log n)$ messages over global edges, which restricts the nodes to use these edges only very sparsely.

We demonstrate the power of hybrid networks by presenting algorithms to compute Single-Source Shortest Paths and the diameter very efficiently in \emph{sparse graphs}. Specifically, we present exact $O(\log n)$ time algorithms for cactus graphs (i.e., graphs in which each edge is contained in at most one cycle), and $3$-approximations for graphs that have at most $n + O(n^{1/3})$ edges and arboricity $O(\log n)$. For these graph classes, our algorithms provide exponentially faster solutions than the best known algorithms for general graphs in this model.
Beyond shortest paths, we also provide a variety of useful tools and techniques for hybrid networks, which may be of independent interest.
}},
  author       = {{Feldmann, Michael and Hinnenthal, Kristian and Scheideler, Christian}},
  booktitle    = {{Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)}},
  publisher    = {{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}},
  title        = {{{Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs}}},
  doi          = {{10.4230/LIPIcs.OPODIS.2020.31}},
  year         = {{2020}},
}

@misc{18066,
  author       = {{Skowronek, Michael}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks}}},
  year         = {{2020}},
}

@phdthesis{18520,
  author       = {{Setzer, Alexander}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks}}},
  doi          = {{10.17619/UNIPB/1-1026}},
  year         = {{2020}},
}

@misc{18648,
  author       = {{Guggenmos, Andreas}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Algorithmen für selbststabilisierende Skip+-Delaunaygraphen}}},
  year         = {{2020}},
}

@article{16902,
  abstract     = {{The maintenance of efficient and robust overlay networks is one
of the most fundamental and reoccurring themes in networking.
This paper presents a survey of state-of-the-art 
algorithms to design and repair overlay networks in a distributed
manner. In particular, we discuss basic algorithmic primitives
to preserve connectivity, review algorithms for the fundamental
problem of graph linearization, and then survey self-stabilizing
algorithms for metric and scalable topologies. 
We also identify open problems and avenues for future research.
}},
  author       = {{Feldmann, Michael and Scheideler, Christian and Schmid, Stefan}},
  journal      = {{ACM Computing Surveys}},
  publisher    = {{ACM}},
  title        = {{{Survey on Algorithms for Self-Stabilizing Overlay Networks}}},
  doi          = {{10.1145/3397190}},
  year         = {{2020}},
}

@inproceedings{16903,
  abstract     = {{We consider the clock synchronization problem in the (discrete) beeping model: Given a network of $n$ nodes with each node having a clock value $\delta(v) \in \{0,\ldots T-1\}$, the goal is to synchronize the clock values of all nodes such that they have the same value in any round.
As is standard in clock synchronization, we assume \emph{arbitrary activations} for all nodes, i.e., the nodes start their protocol at an arbitrary round (not limited to $\{0,\ldots,T-1\}$).
We give an asymptotically optimal algorithm that runs in $4D + \Bigl\lfloor \frac{D}{\lfloor T/4 \rfloor} \Bigr \rfloor \cdot (T \mod 4) = O(D)$ rounds, where $D$ is the diameter of the network.
Once all nodes are in sync, they beep at the same round every $T$ rounds.
The algorithm drastically improves on the $O(T D)$-bound of \cite{firefly_sync} (where $T$ is required to be at least $4n$, so the bound is no better than $O(nD)$).
Our algorithm is very simple as nodes only have to maintain $3$ bits in addition to the $\lceil \log T \rceil$ bits needed to maintain the clock.
Furthermore we investigate the complexity of \emph{self-stabilizing} solutions for the clock synchronization problem: We first show lower bounds of $\Omega(\max\{T,n\})$ rounds on the runtime and $\Omega(\log(\max\{T,n\}))$ bits of memory required for any such protocol.
Afterwards we present a protocol that runs in $O(\max\{T,n\})$ rounds using at most $O(\log(\max\{T,n\}))$ bits at each node, which is asymptotically optimal with regards to both, runtime and memory requirements.}},
  author       = {{Feldmann, Michael and Khazraei, Ardalan and Scheideler, Christian}},
  booktitle    = {{Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}},
  publisher    = {{ACM}},
  title        = {{{Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model}}},
  doi          = {{10.1145/3350755.3400246}},
  year         = {{2020}},
}

@misc{15770,
  author       = {{Warner, Daniel}},
  publisher    = {{Universität Paderborn}},
  title        = {{{On the complexity of local transformations in SDN overlays}}},
  year         = {{2020}},
}