3 papers
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.DS2026
Sublinear-Time Reconfiguration of Programmable Matter with Joint Movements
Manish Kumar, Othon Michail, Andreas Padalkin +1
We study centralized reconfiguration problems for geometric amoebot structures. A set of amoebots occupy nodes on the triangular grid and can reconfigure via expansion and cont…
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…