The following pages link to Fast Gossiping by Short Messages (Q4210076):
Displaying 20 items.
- Bounded information dissemination in multi-channel wireless networks (Q266016) (← links)
- 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)
- The unit acquisition number of binomial random graphs (Q2048570) (← links)
- An inclusion hierarchy of irreversible dynamos (Q2355698) (← links)
- Optimal gossiping in square 2D meshes (Q2382678) (← links)
- The total acquisition number of random geometric graphs (Q2401413) (← links)
- The total acquisition number of random graphs (Q2629497) (← links)
- Multi-level dynamo and opinion spreading (Q2971065) (← links)
- Quick Gossiping by Conference Calls (Q3032285) (← links)
- Gossiping in Minimal Time (Q3990105) (← links)
- (Q4535804) (← links)
- Fast gossiping by short messages (Q4645173) (← links)
- GATHERING RADIO MESSAGES IN THE PATH (Q4928335) (← links)
- Concurrent multicast in weighted networks (Q5941285) (← links)
- Gossiping with interference in radio ring networks (Q6599790) (← links)
