Thim Strothmann

TL;DR: In this article, the authors study the problem of uniformly coating objects of arbitrary shape in the context of self-organizing programmable matter, i.e., programmable materials which can establish and release bonds and can actively move in a self-organized way.

TL;DR: Simulation results show that the competitive ratio of the universal coating algorithm may be better than linear in practice, and a linear lower bound on the competitive gap between fully local coating algorithms and coating algorithms that rely on global information is shown.

TL;DR: Based on the geometric model, an efficient local-control algorithms for leader election and line formation requiring only particles with constant size memory are presented and the limitations of solving these problems within the general amoebot model are discussed.

TL;DR: In this paper, an efficient local-control algorithm was proposed to solve the leader election problem in O(n) asynchronous rounds with high probability, where n is the number of particles in the system.