Pages that link to "Item:Q4014613"
From MaRDI portal
The following pages link to Tighter time bounds on fault-tolerant broadcasting and gossiping (Q4014613):
Displaying 17 items.
- Binary linear programming models for robust broadcasting in communication networks (Q266832) (← links)
- Stochastic and deterministic fault detection for randomized gossip algorithms (Q518288) (← links)
- Broadcasting in complete networks with faulty nodes using unreliable calls (Q1183465) (← links)
- Communication complexity of fault-tolerant information diffusion (Q1274923) (← links)
- Efficient broadcasting with linearly bounded faults (Q1281388) (← links)
- Fast gossiping with short unreliable messages (Q1339876) (← links)
- Reliable broadcasting (Q1339885) (← links)
- Minimum time broadcast in faulty star networks (Q1392530) (← links)
- Broadcasting with linearly bounded transmission faults (Q1392531) (← links)
- A note on optimal time broadcast in faulty hypercubes (Q1892869) (← links)
- Reliable broadcasting in hypercubes with random link and node failures (Q2785368) (← links)
- FAST BROADCASTING WITH BYZANTINE FAULTS (Q3421854) (← links)
- Sparse networks supporting efficient reliable broadcasting (Q4630277) (← links)
- Token transfer in a faulty network (Q4858837) (← links)
- Communication complexity of gossiping by packets (Q5054816) (← links)
- Fault-tolerant broadcasting and gossiping in communication networks (Q5689809) (← links)
- Time-relaxed 1-fault tolerant broadcast networks (Q6483537) (← links)