@misc{48430, abstract = {{Bei dem betrachteten Speicherproblem werden Daten mit verschiedenen Zugriffswahrscheinlichkeiten auf Speicher mit verschiedenen Bandbreiten und Kapazitäten aufgeteilt, dabei sind Replikate erlaubt. Es wird die nach Zugriffswahrscheinlichkeit gewichtete kleinste Bandbreite der Daten maximiert. Wir zeigen, dass sowohl das diskrete Speicherproblem, bei dem die Bandbreite der Speicher jeweils gleichmäßig auf die dort abgelegten Daten aufgeteilt wird, als auch das kontinuierliche Speicherproblem, bei dem die Bandbreite der Speicher beliebig auf abgelegte Daten verteilt werden darf, NP-schwer ist. Es können also, wenn P ̸ = NP, keine effizienten Algorithmen für eine optimale Lösung existieren. Stattdessen zeigen wir jeweils einen 1/2-Approximationsalgorithmus.}}, author = {{Decking, Leo}}, title = {{{Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite}}}, year = {{2023}}, } @misc{49494, author = {{Nickel, Alexander}}, title = {{{Entwicklung und Analyse von Formeln zur Abschätzung der Renderingzeit eines Frames}}}, year = {{2023}}, } @misc{49493, author = {{Telaprolu, Vipasyan}}, title = {{{Reconstruction of 3D Surfels from Neural Radiance Fields}}}, year = {{2023}}, } @misc{49492, author = {{Friemel, Jonas}}, title = {{{Shape Reconfiguration by Hybrid Programmable Matter}}}, year = {{2023}}, } @misc{52317, author = {{Beckendorf, Björn}}, title = {{{Self-Stabilizing Skip-Graph with Growth-bounded Metric}}}, year = {{2023}}, } @misc{30152, author = {{Roopa, Rajanna}}, title = {{{Evaluation of Algorithms for the Node Capacitated Clique}}}, year = {{2022}}, } @misc{30198, author = {{Korzeczek, Sebastian}}, title = {{{Aufarbeitung und lmplementierung von DAG-Rider}}}, year = {{2022}}, } @misc{30199, author = {{Nachtigall, Marcel}}, title = {{{Hybrid Routing in Three Dimensions}}}, year = {{2022}}, } @article{31060, author = {{Feldmann, Michael and Padalkin, Andreas and Scheideler, Christian and Dolev, Shlomi}}, journal = {{J. Comput. Biol.}}, number = {{4}}, pages = {{317–343}}, title = {{{Coordinating Amoebots via Reconfigurable Circuits}}}, doi = {{10.1089/cmb.2021.0363}}, volume = {{29}}, year = {{2022}}, } @misc{31947, author = {{Hillebrandt, Henning}}, title = {{{Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen}}}, year = {{2022}}, } @inproceedings{32602, author = {{Padalkin, Andreas 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 = {{8:1–8:22}}, publisher = {{Schloss Dagstuhl – Leibniz-Zentrum für Informatik}}, title = {{{The Structural Power of Reconfigurable Circuits in the Amoebot Model}}}, doi = {{10.4230/LIPIcs.DNA.28.8}}, volume = {{238}}, year = {{2022}}, } @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}}, } @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}}, } @inproceedings{15169, author = {{Castenow, Jannik and Kolb, Christina and Scheideler, Christian}}, booktitle = {{Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)}}, location = {{Kolkata, Indien}}, publisher = {{ACM}}, title = {{{A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}}}, year = {{2020}}, } @misc{17809, author = {{N., N.}}, title = {{{Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems}}}, year = {{2019}}, } @inproceedings{8534, abstract = {{We propose two protocols for distributed priority queues (denoted by 'heap' for simplicity in this paper) called SKEAP and SEAP. SKEAP realizes a distributed heap for a constant amount of priorities and SEAP one for an arbitrary amount. Both protocols build on an overlay, which induces an aggregation tree on which heap operations are aggregated in batches, ensuring that our protocols scale even for a high rate of incoming requests. As part of SEAP we provide a novel distributed protocol for the k-selection problem that runs in time O(log n) w.h.p. SKEAP guarantees sequential consistency for its heap operations, while SEAP guarantees serializability. SKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations. SKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations with SEAP having to use only O(log n) bit messages.}}, author = {{Feldmann, Michael and Scheideler, Christian}}, booktitle = {{Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}}, pages = {{287----296}}, publisher = {{ACM}}, title = {{{Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities}}}, doi = {{10.1145/3323165.3323193}}, year = {{2019}}, } @inproceedings{8871, author = {{Augustine, John and Ghaffari, Mohsen and Gmyr, Robert and Hinnenthal, Kristian and Kuhn, Fabian and Li, Jason and Scheideler, Christian}}, booktitle = {{Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures}}, pages = {{69----79}}, publisher = {{ACM}}, title = {{{Distributed Computation in Node-Capacitated Networks}}}, doi = {{10.1145/3323165.3323195}}, year = {{2019}}, } @inproceedings{6976, abstract = {{We investigate the maintenance of overlay networks under massive churn, i.e. nodes joining and leaving the network. We assume an adversary that may churn a constant fraction $\alpha n$ of nodes over the course of $\mathcal{O}(\log n)$ rounds. In particular, the adversary has an almost up-to-date information of the network topology as it can observe an only slightly outdated topology that is at least $2$ rounds old. Other than that, we only have the provably minimal restriction that new nodes can only join the network via nodes that have taken part in the network for at least one round. Our contributions are as follows: First, we show that it is impossible to maintain a connected topology if adversary has up-to-date information about the nodes' connections. Further, we show that our restriction concerning the join is also necessary. As our main result present an algorithm that constructs a new overlay- completely independent of all previous overlays - every $2$ rounds. Furthermore, each node sends and receives only $\mathcal{O}(\log^3 n)$ messages each round. As part of our solution we propose the Linearized DeBruijn Swarm (LDS), a highly churn resistant overlay, which will be maintained by the algorithm. However, our approaches can be transferred to a variety of classical P2P Topologies where nodes are mapped into the $[0,1)$-interval.}}, author = {{Götte, Thorsten and Vijayalakshmi, Vipin Ravindran and Scheideler, Christian}}, booktitle = {{Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19)}}, location = {{Rio de Janeiro, Brazil}}, publisher = {{IEEE}}, title = {{{Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary}}}, year = {{2019}}, } @inproceedings{10586, abstract = {{We consider the problem of transforming a given graph G_s into a desired graph G_t by applying a minimum number of primitives from a particular set of local graph transformation primitives. These primitives are local in the sense that each node can apply them based on local knowledge and by affecting only its 1-neighborhood. Although the specific set of primitives we consider makes it possible to transform any (weakly) connected graph into any other (weakly) connected graph consisting of the same nodes, they cannot disconnect the graph or introduce new nodes into the graph, making them ideal in the context of supervised overlay network transformations. We prove that computing a minimum sequence of primitive applications (even centralized) for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set of local graph transformation primitives satisfying the aforementioned properties. On the other hand, we show that this problem admits a polynomial time algorithm with a constant approximation ratio.}}, author = {{Scheideler, Christian and Setzer, Alexander}}, booktitle = {{Proceedings of the 46th International Colloquium on Automata, Languages, and Programming}}, keywords = {{Graphs transformations, NP-hardness, approximation algorithms}}, location = {{Patras, Greece}}, pages = {{150:1----150:14}}, publisher = {{Dagstuhl Publishing}}, title = {{{On the Complexity of Local Graph Transformations}}}, doi = {{10.4230/LIPICS.ICALP.2019.150}}, volume = {{132}}, year = {{2019}}, } @proceedings{14829, editor = {{Scheideler, Christian and Berenbrink, Petra}}, isbn = {{978-1-4503-6184-2}}, publisher = {{ACM}}, title = {{{The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019}}}, doi = {{10.1145/3323165}}, year = {{2019}}, } @article{14830, author = {{Gmyr, Robert and Lefevre, Jonas and Scheideler, Christian}}, journal = {{Theory Comput. Syst.}}, number = {{2}}, pages = {{177--199}}, title = {{{Self-Stabilizing Metric Graphs}}}, doi = {{10.1007/s00224-017-9823-4}}, volume = {{63}}, year = {{2019}}, } @inproceedings{14539, author = {{Castenow, Jannik and Kolb, Christina and Scheideler, Christian}}, booktitle = {{Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)}}, location = {{L'Aquila, Italy}}, pages = {{345--348}}, title = {{{A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}}}, doi = {{10.1007/978-3-030-24922-9\_26}}, year = {{2019}}, }