Pages that link to "Item:Q868959"
From MaRDI portal
The following pages link to Feasibility and complexity of broadcasting with random transmission failures (Q868959):
Displaying 7 items.
- \(f\)-sensitivity distance oracles and routing schemes (Q692635) (← links)
- Reliability versus cost: Design of a probabilistic broadcast algorithm (Q1331788) (← links)
- On linear-time data dissemination in dynamic rooted trees (Q1727754) (← links)
- The complexity of finding a broadcast center (Q2151362) (← links)
- Optimal gossiping in geometric radio networks in the presence of dynamical faults (Q2894246) (← links)
- (Q4390825) (← links)
- Feasibility and complexity of broadcasting with random transmission failures (Q5177256) (← links)