Stationary and deterministic leader election in self-organizing particle systems
From MaRDI portal
Publication:6536324
DOI10.1007/978-3-030-34992-9_3zbMATH Open1543.68128MaRDI QIDQ6536324
Joseph L. Briones, Rida A. Bazzi
Publication date: 19 April 2024
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) Distributed algorithms (68W15) Other nonclassical models of computation (68Q09)
Cites Work
- Unnamed Item
- Universal coating for programmable matter
- Symmetry breaking in distributed networks
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- On the Runtime of Universal Coating for Programmable Matter
- Leader Election and Shape Formation with Self-organizing Programmable Matter
- Shape formation by programmable particles
- 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
- Near Optimal Leader Election in Multi-Hop Radio Networks
- Distributed leader election and computation of local identifiers for programmable matter
This page was built for publication: Stationary and deterministic leader election in self-organizing particle systems
