4 citations · 9 across the 11 of their papers we have counts for
4 papers · 2 filters
Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems
Joshua J. Daymude, Andréa W. Richa, Christian Scheideler
Mutual exclusion is a classical problem in distributed computing that provides isolation among concurrent action executions that may require access to the same shared resources. In…
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…
The Canonical Amoebot Model: Algorithms and Concurrency Control
Joshua J. Daymude, Andréa W. Richa, Christian Scheideler
The amoebot model abstracts active programmable matter as a collection of simple computational elements called amoebots that interact locally to collectively achieve tasks of coord…