Lost in self-stabilization: a local process that aligns connected cells
From MaRDI portal
Publication:1643133
DOI10.1016/J.TCS.2018.02.015zbMath1395.68126OpenAlexW2789515578WikidataQ130155074 ScholiaQ130155074MaRDI QIDQ1643133
Publication date: 18 June 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.02.015
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cellular automata (computational aspects) (68Q80)
Related Items (3)
Gathering a Euclidean closed chain of robots in linear time ⋮ Remarks on the cellular automaton global synchronisation problem: deterministic versus stochastic models ⋮ Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stochastic cellular automata solutions to the density classification problem. When randomness helps computing
- Optimal strategies for maintaining a chain of relays between an explorer and a base camp
- Fully asynchronous behavior of double-quiescent elementary cellular automata
- Density Classification on Infinite Lattices and Trees
- Lost in Self-Stabilization
- Conway's Tiling Groups
- A constrained Potts antiferromagnet model with an interface representation
- Stochastic Flips on Two-letter Words
This page was built for publication: Lost in self-stabilization: a local process that aligns connected cells