Deterministic self-stabilising leader election for programmable matter with constant memory
From MaRDI portal
Cites work
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
- CADbots: algorithmic aspects of manipulating programmable matter with finite automata
- Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative
- Deterministic Leader Election in Programmable Matter
- Deterministic, constant space, self-stabilizing leader election on uniform rings
- Distributed leader election and computation of local identifiers for programmable matter
- Efficient Deterministic Leader Election for Programmable Matter
- How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
- scientific article; zbMATH DE number 2036573 (Why is no real title available?)
- Leader election and shape formation with self-organizing programmable matter
- Memory requirements for silent stabilization
- Memory-efficient and self-stabilizing network RESET (extended abstract)
- Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms
- Proof labeling schemes
- Self-stabilization
- Self-stabilizing leader election in optimal space under an arbitrary scheduler
- Self-stabilizing systems in spite of distributed control
- Shape formation by programmable particles
- Stationary and deterministic leader election in self-organizing particle systems
- The canonical amoebot model: algorithms and concurrency control
- The computational power of population protocols
- Theory of self-reproducing automata. Edited and completed by Arthur W. Burks
- Universal dynamic synchronous self-stabilization
This page was built for publication: Deterministic self-stabilising leader election for programmable matter with constant memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6871600)
