Fast Radio Broadcasting with Advice
From MaRDI portal
Publication:3511406
DOI10.1007/978-3-540-69355-0_24zbMath1143.68326OpenAlexW2173579249MaRDI QIDQ3511406
Andrzej Pelc, David Ilcinkas, Dariusz R. Kowalski
Publication date: 10 July 2008
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69355-0_24
Related Items (2)
Trade-offs between the size of advice and broadcasting time in trees ⋮ Communication algorithms with advice
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Local MST computation with short advice
- Broadcasting in geometric radio networks
- A lower bound for radio broadcast
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
- The impact of information on broadcasting time in linear radio networks.
- Optimal deterministic broadcasting in known topology radio networks
- The Wakeup Problem in Synchronous Broadcast Systems
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Centralized broadcast in multihop radio networks
- Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
- Lower bounds for the broadcast problem in mobile radio networks
- Deterministic broadcasting in ad hoc radio networks
- Faster communication in known topology radio networks
- Oracle size
- STACS 2004
- Broadcasting in udg radio networks with unknown topology
- Graph Searching with Advice
- Distributed Computing with Advice: Information Sensitivity of Graph Coloring
- Broadcasting algorithms in radio networks with unknown topology
- Tree Exploration with an Oracle
- Broadcasting in undirected ad hoc radio networks
This page was built for publication: Fast Radio Broadcasting with Advice
