Pages that link to "Item:Q2719169"
From MaRDI portal
The following pages link to On the optimality of general lower bounds for broadcasting and gossiping (Q2719169):
Displaying 12 items.
- Messy broadcasting - decentralized broadcast schemes with limited knowledge (Q628314) (← links)
- Broadcasting in butterfly and deBruijn networks (Q1339890) (← links)
- Optimal algorithms for broadcast and gossip in the edge-disjoint modes (Q1357008) (← links)
- Lower bounds on systolic gossip (Q1763428) (← links)
- On the monotonicity of the broadcast function (Q1868844) (← links)
- Optimal memory-aware sensor network gossiping (or how to break the broadcast lower bound) (Q1939254) (← links)
- Move-optimal gossiping among mobile agents (Q2481955) (← links)
- Minimum average broadcast time in a graph of bounded degree. (Q2716013) (← links)
- Bounds for algebraic gossip on graphs (Q2925522) (← links)
- Lower Bounds for the Noisy Broadcast Problem (Q3549324) (← links)
- Algorithms - ESA 2003 (Q5897261) (← links)
- Optimal Broadcast with Partial Knowledge (Q6062521) (← links)