4 citations · 7 across the 6 of their papers we have counts for
22 papers · 1 filter
The Structural Power of Reconfigurable Circuits in the Amoebot Model
Andreas Padalkin, Christian Scheideler, Daniel Warner
The amoebot model [Derakhshandeh et al., 2014] has been proposed as a model for programmable matter consisting of tiny, robotic elements called amoebots. We consider the reconfigur…
Near-Shortest Path Routing in Hybrid Communication Networks
Sam Coy, Artur Czumaj, Michael Feldmann +5
Hybrid networks, i.e., networks that leverage different means of communication, become ever more widespread. To allow theoretical study of such networks, [Augustine et al., SODA'20…
Beep-And-Sleep: Message and Energy Efficient Set Cover
Thorsten Götte, Christina Kolb, Christian Scheideler +1
We observe message-efficient distributed algorithms for the Set Cover problem. Given a ground set of elements and subsets of , we aim to find the minimal number of t…
Accelerating Amoebots via Reconfigurable Circuits
Michael Feldmann, Andreas Padalkin, Christian Scheideler +1
We consider an extension to the geometric amoebot model that allows amoebots to form so-called \emph{circuits}. Given a connected amoebot structure, a circuit is a subgraph formed…
Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
Michael Feldmann, Kristian Hinnenthal, Christian Scheideler
We consider the problem of computing shortest paths in hybrid networks, in which nodes can make use of different communication modes. For example, mobile phones may use ad-hoc conn…
Time- and Space-Optimal Clock Synchronization in the Beeping Model
Michael Feldmann, Ardalan Khazraei, Christian Scheideler
We consider the clock synchronization problem in the (discrete) beeping model: Given a network of nodes with each node having a clock value , the goa…