Deterministic Leader Election in Programmable Matter

DOI10.4230/LIPIcs.ICALP.2019.140zbMath1503.68071arXiv1905.00580OpenAlexW2977330334MaRDI QIDQ5092343

Ron Lavi, Shay Kutten, Yuval Emek, William K. jun. Moses

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1905.00580

zbMATH Keywords

leader electionprogrammable mattergeometric amoebot model

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) Other nonclassical models of computation (68Q09)

Related Items (1)

The canonical amoebot model: algorithms and concurrency control

Cites Work

• Unnamed Item
• Universal coating for programmable matter
• Leader Election and Shape Formation with Self-organizing Programmable Matter
• Shape formation by programmable particles
• Distributed network protocols
• Improved Leader Election for Self-organizing Programmable Matter
• A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems

This page was built for publication: Deterministic Leader Election in Programmable Matter