Pages that link to "Item:Q4012443"
From MaRDI portal
The following pages link to Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults (Q4012443):
Displaying 9 items.
- Binary linear programming models for robust broadcasting in communication networks (Q266832) (← links)
- Communication complexity of fault-tolerant information diffusion (Q1274923) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- Reliable broadcasting (Q1339885) (← links)
- Minimum congestion redundant assignments to tolerate random faults (Q1348940) (← links)
- Minimum time broadcast in faulty star networks (Q1392530) (← links)
- Broadcasting with linearly bounded transmission faults (Q1392531) (← links)
- Broadcasting in hypercubes with randomly distributed Byzantine faults (Q6084558) (← links)
- Time-relaxed 1-fault tolerant broadcast networks (Q6483537) (← links)