The canonical amoebot model: algorithms and concurrency control
From MaRDI portal
Publication:6099032
DOI10.1007/S00446-023-00443-3arXiv2105.02420MaRDI QIDQ6099032
Andréa W. Richa, Christian Scheideler, Joshua J. Daymude
Publication date: 19 June 2023
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.02420
Related Items (1)
Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach
Cites Work
- Unnamed Item
- An introduction to tile-based self-assembly and a survey of recent results
- Mutual visibility by luminous robots without collisions
- Universal coating for programmable matter
- Autonomous mobile robots with lights
- Freezing simulates non-freezing tile automata
- A stochastic approach to shortcut bridging in programmable matter
- Line reconfiguration by programmable particles maintaining connectivity
- Shape formation by programmable particles
- Computation in networks of passively mobile finite-state sensors
- On the Runtime of Universal Coating for Programmable Matter
- Leader Election and Shape Formation with Self-organizing Programmable Matter
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
- Tree algorithms for packet broadcast channels
- Improved Leader Election for Self-organizing Programmable Matter
- Deterministic Leader Election in Programmable Matter
- A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems
- Introduction to Distributed Self-Stabilizing Algorithms
- Simple and efficient local codes for distributed stable network construction
- Rendezvous with constant memory
- Distributed leader election and computation of local identifiers for programmable matter
This page was built for publication: The canonical amoebot model: algorithms and concurrency control
