Deterministic blind radio networks
From MaRDI portal
Publication:5090905
DOI10.4230/LIPICS.DISC.2018.15zbMATH Open1497.68039arXiv1805.04838MaRDI QIDQ5090905FDOQ5090905
Authors: P. Davies, Artur Czumaj 
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1805.04838
Recommendations
Distributed algorithms (68W15) Communication networks in operations research (90B18) Distributed systems (68M14)
Cites Work
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- On selection problem in radio networks
- A lower bound for radio broadcast
- Broadcasting in undirected ad hoc radio networks
- Probabilistic algorithms for the wake-up problem in single-hop radio networks
- The wakeup problem in synchronous broadcast systems
- Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Title not available (Why is that?)
- Distributed broadcast in radio networks of unknown topology.
- Faster broadcasting in unknown radio networks
- Title not available (Why is that?)
- Distributed broadcast in unknown radio networks
- Fast broadcasting and gossiping in radio networks
- Deterministic broadcasting in ad hoc radio networks
- Automata, Languages and Programming
- Faster Deterministic Broadcasting in Ad Hoc Radio Networks
- The Wake‐Up Problem in MultiHop Radio Networks
- A better wake-up in radio networks
- Fundamentals of Computation Theory
- Faster deterministic wakeup in multiple access channels
- Deterministic Communication in Radio Networks
- Randomized broadcast in radio networks with collision detection
- Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks
- A Faster Distributed Radio Broadcast Primitive
Cited In (2)
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)
