Stationary and deterministic leader election in self-organizing particle systems
From MaRDI portal
Publication:6536324
Recommendations
- Improved Leader Election for Self-organizing Programmable Matter
- Deterministic Leader Election in Programmable Matter
- Leader election and shape formation with self-organizing programmable matter
- Efficient Deterministic Leader Election for Programmable Matter
- Deterministic, constant space, self-stabilizing leader election on uniform rings
Cites work
- A Markov chain algorithm for compression in self-organizing particle systems
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Deterministic Leader Election in Programmable Matter
- Distributed leader election and computation of local identifiers for programmable matter
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- Improved Leader Election for Self-organizing Programmable Matter
- Leader election and shape formation with self-organizing programmable matter
- Near optimal leader election in multi-hop radio networks
- Shape formation by programmable particles
- Symmetry breaking in distributed networks
- Universal coating for programmable matter
Cited in
(3)
This page was built for publication: Stationary and deterministic leader election in self-organizing particle systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536324)