The following pages link to Fast Gossiping by Short Messages (Q4210076):
Displayed 9 items.
- A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem (Q932651) (← links)
- On the hamiltonicity of the Cartesian product (Q1044703) (← links)
- Optimal gathering protocols on paths under interference constraints (Q1045041) (← links)
- Communication complexity of fault-tolerant information diffusion (Q1274923) (← links)
- On the communication complexity of polling (Q1350916) (← links)
- Optimal gossiping in paths and cycles (Q1827271) (← links)
- Optimal gossiping in square 2D meshes (Q2382678) (← links)
- GATHERING RADIO MESSAGES IN THE PATH (Q4928335) (← links)
- Concurrent multicast in weighted networks (Q5941285) (← links)