Deterministic blind radio networks
From MaRDI portal
Publication:5090905
Recommendations
Cites work
- scientific article; zbMATH DE number 1670865 (Why is no real title available?)
- scientific article; zbMATH DE number 2119730 (Why is no real title available?)
- A Faster Distributed Radio Broadcast Primitive
- A better wake-up in radio networks
- A lower bound for radio broadcast
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Automata, Languages and Programming
- Broadcasting in undirected ad hoc radio networks
- Deterministic broadcasting in ad hoc radio networks
- Deterministic communication in radio networks
- Distributed broadcast in radio networks of unknown topology.
- Distributed broadcast in unknown radio networks
- Exploiting spontaneous transmissions for broadcasting and leader election in radio networks
- Fast broadcasting and gossiping in radio networks
- Faster Deterministic Broadcasting in Ad Hoc Radio Networks
- Faster broadcasting in unknown radio networks
- Faster deterministic wakeup in multiple access channels
- Fundamentals of Computation Theory
- Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
- On selection problem in radio networks
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Probabilistic algorithms for the wake-up problem in single-hop radio networks
- Randomized broadcast in radio networks with collision detection
- The Wake‐Up Problem in MultiHop Radio Networks
- The wakeup problem in synchronous broadcast systems
Cited in
(3)
This page was built for publication: Deterministic blind radio networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090905)