TY - JOUR AU - Götte, Thorsten AU - Kolb, Christina AU - Scheideler, Christian AU - Werthmann, Julian ID - 43109 JF - Theor. Comput. Sci. TI - Beep-and-Sleep: Message and Energy Efficient Set Cover VL - 950 ER - TY - CONF AU - Werthmann, Julian AU - Scheideler, Christian AU - Coy, Sam AU - Czumaj, Artur AU - Schneider, Philipp ID - 45188 TI - Routing Schemes for Hybrid Communication Networks ER - TY - CONF AU - Dou, Jinfeng AU - Götte, Thorsten AU - Hillebrandt, Henning AU - Scheideler, Christian AU - Werthmann, Julian ID - 45193 T2 - Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC '23) TI - Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs ER - TY - JOUR AU - Götte, Thorsten AU - Hinnenthal, Kristian AU - Scheideler, Christian AU - Werthmann, Julian ID - 45192 JF - Distributed Computing TI - Time-Optimal Construction of Overlays ER - TY - CHAP AU - Götte, Thorsten AU - Knollmann, Till AU - Meyer auf der Heide, Friedhelm AU - Scheideler, Christian AU - Werthmann, Julian ED - Haake, Claus-Jochen ED - Meyer auf der Heide, Friedhelm ED - Platzner, Marco ED - Wachsmuth, Henning ED - Wehrheim, Heike ID - 45875 T2 - On-The-Fly Computing -- Individualized IT-services in dynamic markets TI - Capabilities and Limitations of Local Strategies in Dynamic Networks VL - 412 ER - TY - CHAP AU - Blömer, Johannes AU - Eidens, Fabian AU - Jager, Tibor AU - Niehues, David AU - Scheideler, Christian ED - Haake, Claus-Jochen ED - Meyer auf der Heide, Friedhelm ED - Platzner, Marco ED - Wachsmuth, Henning ED - Wehrheim, Heike ID - 45891 T2 - On-The-Fly Computing -- Individualized IT-services in dynamic markets TI - Robustness and Security VL - 412 ER - TY - JOUR AU - Feldmann, Michael AU - Padalkin, Andreas AU - Scheideler, Christian AU - Dolev, Shlomi ID - 31060 IS - 4 JF - J. Comput. Biol. TI - Coordinating Amoebots via Reconfigurable Circuits VL - 29 ER - TY - CONF AU - Padalkin, Andreas AU - Scheideler, Christian AU - Warner, Daniel ED - Ouldridge, Thomas E. ED - Wickham, Shelley F. J. ID - 32602 SN - 1868-8969 T2 - 28th International Conference on DNA Computing and Molecular Programming (DNA 28) TI - The Structural Power of Reconfigurable Circuits in the Amoebot Model VL - 238 ER - TY - CONF AU - Kostitsyna, Irina AU - Scheideler, Christian AU - Warner, Daniel ED - Ouldridge, Thomas E. ED - Wickham, Shelley F. J. ID - 32603 SN - 1868-8969 T2 - 28th International Conference on DNA Computing and Molecular Programming (DNA 28) TI - Fault-Tolerant Shape Formation in the Amoebot Model VL - 238 ER - TY - CONF AU - Daymude, Joshua J. AU - Richa, Andréa W. AU - Scheideler, Christian ED - Aspnes, James ED - Michail, Othon ID - 33230 T2 - 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference TI - Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems VL - 221 ER - TY - CONF AU - Götte, Thorsten AU - Scheideler, Christian ED - Agrawal, Kunal ED - Lee, I-Ting Angelina ID - 33240 T2 - SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022 TI - Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion ER - TY - CONF AU - Kostitsyna, Irina AU - Scheideler, Christian AU - Warner, Daniel ED - Aspnes, James ED - Michail, Othon ID - 30987 SN - 1868-8969 T2 - 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022) TI - Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model VL - 221 ER - TY - CONF AU - Aguiliera, Marcos AU - Richa, Andréa W. AU - Schwarzmann, Alexander A. AU - Panconesi, Alessandro AU - Scheideler, Christian AU - Woelfel, Philipp ED - Milani, Alessia ED - Woelfel, Philipp ID - 33967 T2 - PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022 TI - 2022 Edsger W. Dijkstra Prize in Distributed Computing ER - TY - JOUR AB - 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. AU - Knollmann, Till AU - Scheideler, Christian ID - 21096 JF - Information and Computation SN - 0890-5401 TI - A self-stabilizing Hashed Patricia Trie ER - TY - CONF AU - Dolev, Shlomi AU - Prasadh Narayanan, Ram AU - Scheideler, Christian AU - Schindelhauer, Christian ED - Galluccio, Laura ED - Mitra, Urbashi ED - Magarini, Maurizio ED - Abada, Sergi ED - Taynnan Barros, Michael ED - Krishnaswamy, Bhuvana ID - 25105 T2 - NANOCOM '21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021 TI - Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization ER - TY - CONF AU - Feldmann, Michael AU - Padalkin, Andreas AU - Scheideler, Christian AU - Dolev, Shlomi ED - Johnen, Colette ED - Michael Schiller, Elad ED - Schmid, Stefan ID - 28917 T2 - Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings TI - Coordinating Amoebots via Reconfigurable Circuits VL - 13046 ER - TY - CONF AU - Dolev, Shlomi AU - Prasadh Narayanan, Ram AU - Scheideler, Christian AU - Schindelhauer, Christian ED - Galluccio, Laura ED - Mitra, Urbashi ED - Magarini, Maurizio ED - Abada, Sergi ED - Taynnan Barros, Michael ED - Krishnaswamy, Bhuvana ID - 27048 T2 - NANOCOM '21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021 TI - Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization ER - TY - CONF AU - J. Daymude, Joshua AU - W. Richa, Andrea AU - Scheideler, Christian ED - Gilbert, Seth ID - 27050 T2 - 35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference) TI - The Canonical Amoebot Model: Algorithms and Concurrency Control VL - 209 ER - TY - CONF AB - 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$. AU - Götte, Thorsten AU - Hinnenthal, Kristian AU - Scheideler, Christian AU - Werthmann, Julian ED - Censor-Hillel, Keren ID - 22283 T2 - Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC '21) TI - Time-Optimal Construction of Overlays ER - TY - CONF AU - Coy, Sam AU - Czumaj, Artur AU - Feldmann, Michael AU - Hinnenthal, Kristian AU - Kuhn, Fabian AU - Scheideler, Christian AU - Schneider, Philipp AU - Struijs, Martijn ED - Bramas, Quentin ED - Gramoli, Vincent ED - Milani, Alessia ID - 30217 T2 - 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France TI - Near-Shortest Path Routing in Hybrid Communication Networks VL - 217 ER -