scientific article; zbMATH DE number 7561256
From MaRDI portal
Publication:5090892
DOI10.4230/LIPIcs.DISC.2018.4zbMath1497.68031arXiv1805.05660MaRDI QIDQ5090892
Noa Kolikant, Yehuda Afek, Yuval Emek
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1805.05660
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
leader electionasynchronous schedulerbeeping communication schemek-leader selectionrandomized finite state machinesstone age model
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14)
Cites Work
- Unnamed Item
- Unnamed Item
- Mediated population protocols
- Symmetry breaking in distributed networks
- Elections in anonymous networks
- Calling names on nameless networks
- Dynamic networks of finite state machines
- Computation in networks of passively mobile finite-state sensors
- Beeping a maximal independent set
- On the Runtime of Universal Coating for Programmable Matter
- Leader Election and Shape Formation with Self-organizing Programmable Matter
- Deploying Wireless Networks with Beeps
- Complexity of network synchronization
- Impossibility of distributed consensus with one faulty process
- Electing a leader in a synchronous ring
- Computing on an anonymous ring
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- Distributed Computing: A Locality-Sensitive Approach
- Stone age distributed computing
- A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems
- Timing in chemical reaction networks
- Weak models of distributed computing, with connections to modal logic
This page was built for publication:
