scientific article; zbMATH DE number 7561267
From MaRDI portal
Publication:5090905
DOI10.4230/LIPIcs.DISC.2018.15zbMath1497.68039arXiv1805.04838MaRDI QIDQ5090905
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1805.04838
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Communication networks in operations research (90B18) Distributed systems (68M14) Distributed algorithms (68W15)
Cites Work
- Unnamed Item
- Unnamed Item
- Faster deterministic wakeup in multiple access channels
- A lower bound for radio broadcast
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Distributed broadcast in radio networks of unknown topology.
- Faster broadcasting in unknown radio networks
- Probabilistic algorithms for the wake-up problem in single-hop radio networks
- The Wakeup Problem in Synchronous Broadcast Systems
- Distributed Broadcast in Unknown Radio Networks
- Fast broadcasting and gossiping in radio networks
- Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Deterministic Communication in Radio Networks
- Faster Deterministic Broadcasting in Ad Hoc Radio Networks
- Deterministic broadcasting in ad hoc radio networks
- Randomized broadcast in radio networks with collision detection
- On selection problem in radio networks
- A Faster Distributed Radio Broadcast Primitive
- Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks
- The Wake‐Up Problem in MultiHop Radio Networks
- Fundamentals of Computation Theory
- A better wake-up in radio networks
- Automata, Languages and Programming
- Broadcasting in undirected ad hoc radio networks
This page was built for publication:
