Showing cs.DCShow all
3 papers · 1 filter
cs.DC2026
Logarithmic-Time Geodesically Convex Decomposition in Programmable Matter
Henning Hillebrandt, Andreas Padalkin, Christian Scheideler +2
The decomposition of complex structures into simpler substructures is a powerful technique with a wide range of applications. We study the computation of decompositions in the cont…
cs.DC2025
Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits
Nada Almalki, Siddharth Gupta, Othon Michail +1
Autonomous reconfiguration of agent-based systems is a key challenge in the study of programmable matter, distributed robotics, and molecular self-assembly. While substantial prior…
cs.DC2025
On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits
Matthias Artmann, Andreas Padalkin, Christian Scheideler
In programmable matter, we consider a large number of tiny, primitive computational entities called particles that run distributed algorithms to control global properties of the pa…