Fast radio broadcasting with advice
From MaRDI portal
Publication:962160
DOI10.1016/j.tcs.2010.01.004zbMath1191.68040OpenAlexW1983693678MaRDI QIDQ962160
David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc
Publication date: 6 April 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.01.004
Related Items (11)
Finding the size and the diameter of a radio network using short labels ⋮ Labeling schemes for deterministic radio multi-broadcast ⋮ Deterministic size discovery and topology recognition in radio networks with short labels ⋮ Four shades of deterministic leader election in anonymous networks ⋮ Fast rendezvous with advice ⋮ Drawing maps with advice ⋮ Beeping a maximal independent set ⋮ Impact of knowledge on election time in anonymous networks ⋮ Short labeling schemes for topology recognition in wireless tree networks ⋮ Advice complexity of maximum independent set in sparse and bipartite graphs ⋮ Topology recognition with advice
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Local MST computation with short advice
- Broadcasting in geometric radio networks
- Tree exploration with advice
- A lower bound for radio broadcast
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Broadcasting on \([0,L\)]
- 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
- Broadcasting in undirected ad hoc radio networks
This page was built for publication: Fast radio broadcasting with advice
