Global synchronization and consensus using beeps in a fault-prone multiple access channel
From MaRDI portal
Publication:2285154
Recommendations
Cites work
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 6297761 (Why is no real title available?)
- A better wake-up in radio networks
- A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
- Analysis of fully distributed splitting and naming probabilistic procedures and applications
- Automata, Languages and Programming
- Broadcasting algorithms in radio networks with unknown topology
- Consensus and Mutual Exclusion in a Multiple Access Channel
- Consensus and collision detectors in radio networks
- Deploying wireless networks with beeps
- Deterministic recurrent communication and synchronization in restricted sensor networks
- Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
- Near optimal leader election in multi-hop radio networks
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Operating systems. An advanced course
- Principles of robust medium access and an application to leader election
- Reaching Agreement in the Presence of Faults
- Scalable Quantum Consensus for Crash Failures
- Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
- The wake-up problem in multi-hop radio networks
- The wakeup problem in synchronous broadcast systems
- Time is not a healer (preliminary version)
This page was built for publication: Global synchronization and consensus using beeps in a fault-prone multiple access channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2285154)