Pages that link to "Item:Q4291562"
From MaRDI portal
The following pages link to Parallel Information Dissemination by Packets (Q4291562):
Displayed 11 items.
- Optimal sequential gossiping by short messages (Q1270817) (← links)
- Communication complexity of fault-tolerant information diffusion (Q1274923) (← links)
- On the communication complexity of polling (Q1350916) (← links)
- Gossiping and broadcasting versus computing functions in networks. (Q1427193) (← links)
- Optimal gossiping in paths and cycles (Q1827271) (← links)
- Optimal gossiping in square 2D meshes (Q2382678) (← links)
- Fast gossiping by short messages (Q4645173) (← links)
- Communication complexity of gossiping by packets (Q5054816) (← links)
- Concurrent multicast in weighted networks (Q5054855) (← links)
- ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS (Q5249000) (← links)
- Concurrent multicast in weighted networks (Q5941285) (← links)