@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}}, } @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}}, } @inproceedings{25105, author = {{Dolev, Shlomi and Prasadh Narayanan, Ram and Scheideler, Christian and Schindelhauer, Christian}}, booktitle = {{NANOCOM '21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021}}, editor = {{Galluccio, Laura and Mitra, Urbashi and Magarini, Maurizio and Abada, Sergi and Taynnan Barros, Michael and Krishnaswamy, Bhuvana}}, pages = {{30:1--30:2}}, publisher = {{ACM}}, title = {{{Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization}}}, doi = {{10.1145/3477206.3477471}}, 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}}, } @inproceedings{27048, author = {{Dolev, Shlomi and Prasadh Narayanan, Ram and Scheideler, Christian and Schindelhauer, Christian}}, booktitle = {{NANOCOM '21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021}}, editor = {{Galluccio, Laura and Mitra, Urbashi and Magarini, Maurizio and Abada, Sergi and Taynnan Barros, Michael and Krishnaswamy, Bhuvana}}, pages = {{30:1--30:2}}, publisher = {{ACM}}, title = {{{Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization}}}, doi = {{10.1145/3477206.3477471}}, year = {{2021}}, } @inproceedings{27050, author = {{J. Daymude, Joshua and W. Richa, Andrea and Scheideler, Christian}}, booktitle = {{35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference)}}, editor = {{Gilbert, Seth}}, pages = {{20:1--20:19}}, publisher = {{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}}, title = {{{The Canonical Amoebot Model: Algorithms and Concurrency Control}}}, doi = {{10.4230/LIPIcs.DISC.2021.20}}, volume = {{209}}, year = {{2021}}, } @inproceedings{22283, abstract = {{ We show how to construct an overlay network of constant degree and diameter $O(\log n)$ in time $O(\log n)$ starting from an arbitrary weakly connected graph. We assume a synchronous communication network in which nodes can send messages to nodes they know the identifier of and establish new connections by sending node identifiers. If the initial network's graph is weakly connected and has constant degree, then our algorithm constructs the desired topology with each node sending and receiving only $O(\log n)$ messages in each round in time $O(\log n)$, w.h.p., which beats the currently best $O(\log^{3/2} n)$ time algorithm of [Götte et al., SIROCCO'19]. Since the problem cannot be solved faster than by using pointer jumping for $O(\log n)$ rounds (which would even require each node to communicate $\Omega(n)$ bits), our algorithm is asymptotically optimal. We achieve this speedup by using short random walks to repeatedly establish random connections between the nodes that quickly reduce the conductance of the graph using an observation of [Kwok and Lau, APPROX'14]. Additionally, we show how our algorithm can be used to efficiently solve graph problems in \emph{hybrid networks} [Augustine et al., SODA'20]. Motivated by the idea that nodes possess two different modes of communication, we assume that communication of the \emph{initial} edges is unrestricted. In contrast, only polylogarithmically many messages can be communicated over edges that have been established throughout an algorithm's execution. For an (undirected) graph $G$ with arbitrary degree, we show how to compute connected components, a spanning tree, and biconnected components in time $O(\log n)$, w.h.p. Furthermore, we show how to compute an MIS in time $O(\log d + \log \log n)$, w.h.p., where $d$ is the initial degree of $G$.}}, author = {{Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian and Werthmann, Julian}}, booktitle = {{Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC '21)}}, editor = {{Censor-Hillel, Keren}}, location = {{Virtual}}, publisher = {{ACM}}, title = {{{Time-Optimal Construction of Overlays}}}, doi = {{10.1145/3465084.3467932}}, 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}}, }