The amoebot model abstracts active programmable matter as a collection of simple
computational elements called amoebots that interact locally to collectively achieve tasks of …

We consider an extension to the geometric amoebot model that allows amoebots to form so-
called circuits. Given a connected amoebot structure, a circuit is a subgraph formed by the …

We study models and algorithms for Programmable Matter (PM), that is matter with the ability
to change its physical properties (eg, shape or optical properties) in a programmable …

It was suggested that a programmable matter system (composed of multiple computationally
weak mobile particles) should remain connected at all times since otherwise, reconnection …

We propose the first stationary and deterministic protocol for the leader election problem for
non-simply connected particle systems in the geometric Amoebot model in which particles …

We study models and algorithms for Programmable Matter (PM, shortly), that is matter with
the ability to change its physical properties (eg, shape or optical properties) in a …

Modular robots are autonomous systems with variable morphology, composed of
independent connected computational elements, called particles or modules. Due to critical …

The amoebot model is a distributed computing model of programmable matter. It envisions
programmable matter as a collection of computational units called amoebots or particles that …

In this article, we present two deterministic leader election algorithms for programmable
matter on the face‐centered cubic grid. The face‐centered cubic grid is a three‐dimensional …

The problem of electing a unique leader is central to all distributed systems, including
programmable matter systems where particles have constant size memory. In this paper, we …