Deterministic broadcasting time with partial knowledge of the network.
From MaRDI portal
Publication:1401209
DOI10.1016/S0304-3975(02)00073-7zbMath1044.68019MaRDI QIDQ1401209
Gianluca De Marco, Andrzej Pelc
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new distributed depth-first-search algorithm
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Gossips and telegraphs
- Methods and problems of communication in usual networks
- Faster broadcasting in unknown radio networks
- Efficient communication in unknown networks
- Randomized broadcast in networks
- A trade-off between information and communication in broadcast protocols
- A survey of gossiping and broadcasting in communication networks
- Gossiping in Minimal Time
- Locality in Distributed Graph Algorithms
- Fast Gossiping for the Hypercube
- Distributed Online Frequency Assignment in Cellular Networks
- Exploring Unknown Undirected Graphs
- Assigning labels in an unknown anonymous network with a leader
- Fault-local distributed mending (extended abstract)
This page was built for publication: Deterministic broadcasting time with partial knowledge of the network.
