Global synchronization and consensus using beeps in a fault-prone multiple access channel
From MaRDI portal
Publication:2285154
DOI10.1016/j.tcs.2019.09.020zbMath1436.68043OpenAlexW2974488648MaRDI QIDQ2285154
Andrzej Pelc, Avery Miller, Kokouvi Hounkanli
Publication date: 16 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.09.020
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Operating systems. An advanced course
- Analysis of fully distributed splitting and naming probabilistic procedures and applications
- Consensus and collision detectors in radio networks
- Beeping a maximal independent set
- The Wakeup Problem in Synchronous Broadcast Systems
- Deploying Wireless Networks with Beeps
- Scalable Quantum Consensus for Crash Failures
- Consensus and Mutual Exclusion in a Multiple Access Channel
- Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
- A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
- Reaching Agreement in the Presence of Faults
- Principles of Robust Medium Access and an Application to Leader Election
- Time is not a healer
- Broadcasting algorithms in radio networks with unknown topology
- A better wake-up in radio networks
- Automata, Languages and Programming
- Near Optimal Leader Election in Multi-Hop Radio Networks
This page was built for publication: Global synchronization and consensus using beeps in a fault-prone multiple access channel
