@inproceedings{32603,
  author       = {{Kostitsyna, Irina and Scheideler, Christian and Warner, Daniel}},
  booktitle    = {{28th International Conference on DNA Computing and Molecular Programming (DNA 28)}},
  editor       = {{Ouldridge, Thomas E. and Wickham, Shelley F. J.}},
  isbn         = {{978-3-95977-253-2}},
  issn         = {{1868-8969}},
  pages        = {{9:1–9:22}},
  publisher    = {{Schloss Dagstuhl – Leibniz-Zentrum für Informatik}},
  title        = {{{Fault-Tolerant Shape Formation in the Amoebot Model}}},
  doi          = {{10.4230/LIPIcs.DNA.28.9}},
  volume       = {{238}},
  year         = {{2022}},
}

@inproceedings{33230,
  author       = {{Daymude, Joshua J. and Richa, Andréa W. and Scheideler, Christian}},
  booktitle    = {{1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference}},
  editor       = {{Aspnes, James and Michail, Othon}},
  pages        = {{12:1–12:19}},
  publisher    = {{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}},
  title        = {{{Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems}}},
  doi          = {{10.4230/LIPIcs.SAND.2022.12}},
  volume       = {{221}},
  year         = {{2022}},
}

@inproceedings{33240,
  author       = {{Götte, Thorsten and Scheideler, Christian}},
  booktitle    = {{SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022}},
  editor       = {{Agrawal, Kunal and Lee, I-Ting Angelina}},
  pages        = {{99–101}},
  publisher    = {{ACM}},
  title        = {{{Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion}}},
  doi          = {{10.1145/3490148.3538556}},
  year         = {{2022}},
}

@inproceedings{30987,
  author       = {{Kostitsyna, Irina and Scheideler, Christian and Warner, Daniel}},
  booktitle    = {{1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}},
  editor       = {{Aspnes, James and Michail, Othon}},
  isbn         = {{978-3-95977-224-2}},
  issn         = {{1868-8969}},
  pages        = {{23:1–23:3}},
  publisher    = {{Schloss Dagstuhl – Leibniz-Zentrum für Informatik}},
  title        = {{{Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model}}},
  doi          = {{10.4230/LIPIcs.SAND.2022.23}},
  volume       = {{221}},
  year         = {{2022}},
}

@inproceedings{33967,
  author       = {{Aguiliera, Marcos and Richa, Andréa W. and Schwarzmann, Alexander A. and Panconesi, Alessandro and Scheideler, Christian and Woelfel, Philipp}},
  booktitle    = {{PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022}},
  editor       = {{Milani, Alessia and Woelfel, Philipp}},
  pages        = {{1}},
  publisher    = {{ACM}},
  title        = {{{2022 Edsger W. Dijkstra Prize in Distributed Computing}}},
  doi          = {{10.1145/3519270.3538411}},
  year         = {{2022}},
}

@proceedings{33968,
  editor       = {{Scheideler, Christian}},
  isbn         = {{978-3-95977-255-6}},
  publisher    = {{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}},
  title        = {{{36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA}}},
  volume       = {{246}},
  year         = {{2022}},
}

@phdthesis{30239,
  author       = {{Kolb, Christina}},
  title        = {{{Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks}}},
  doi          = {{10.17619/UNIPB/1-1673 }},
  year         = {{2022}},
}

@article{21096,
  abstract     = {{While many research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures. However, when peers in peer-to-peer networks crash, a distributed data structure may not remain intact. We present a self-stabilizing protocol for a distributed data structure called the Hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys. The data structure has many applications while offering low overhead and efficient operations when embedded on top of a Distributed Hash Table. Especially, longest prefix matching for x can be done in O(log |x|) hash table read accesses. We show how to maintain the structure in a self-stabilizing way, while assuring a low overhead in a legal state and an asymptotically optimal memory demand of O(d) bits, where d is the number of bits needed for storing all keys.}},
  author       = {{Knollmann, Till and Scheideler, Christian}},
  issn         = {{0890-5401}},
  journal      = {{Information and Computation}},
  title        = {{{A self-stabilizing Hashed Patricia Trie}}},
  doi          = {{10.1016/j.ic.2021.104697}},
  year         = {{2022}},
}

@phdthesis{24887,
  author       = {{Hinnenthal, Kristian}},
  title        = {{{Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter}}},
  doi          = {{10.17619/UNIPB/1-1169 }},
  year         = {{2021}},
}

@misc{25126,
  abstract     = {{Motivated by the prospect of computing agents that explore unknown environments and construct convex hulls on the nanoscale, we investigate the capabilities and limitations of a single deterministic finite automaton robot in the three-dimensional hybrid model for programmable matter. In this model, active robots move on a set of passive tiles, called configuration, with the geometric shape of rhombic dodecahedra on the adjacency graph of the face-centered cubic sphere-packing. We show that the exploration problem is equally hard in the hybrid model and in three-dimensional mazes, in which tiles have the shape of cubes and are positioned at the vertices of $\mathbb{Z}^3$. Thereby, a single robot with a constant number of pebbles cannot solve this problem in the hybrid model on arbitrary configurations. We provide algorithms for a robot with two pebbles that solve the exploration problem in the subclass of compact configurations of size $n$ in $\O(n^3)$ rounds. Further, we investigate the robot's capabilities of detection and hull construction in terms of restricted orientation convexity. We show that a robot without any pebble can detect strong $\O$-convexity in $\O(n)$ rounds, but cannot detect weak $\O$-convexity, not even if provided with a single pebble. Assuming that a robot can construct tiles from scratch and deconstruct previously constructed tiles, we show that the strong $\O$-hull of any given configuration of size $n$ can be constructed in $\O(n^4)$ rounds, even if the robot cannot distinguish constructed from native tiles.}},
  author       = {{Liedtke, David Jan}},
  keywords     = {{Robot Exploration, Finite Automaton, Hybrid Model for Programmable Matter, Convex Hull}},
  title        = {{{Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model}}},
  year         = {{2021}},
}

@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}},
}