The following pages link to (Q5090922):
Displaying 8 items.
- Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model (Q1981632) (← links)
- Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits (Q2002052) (← links)
- Latency, capacity, and distributed minimum spanning trees (Q2119398) (← links)
- Low-congestion shortcut and graph parameters (Q2241301) (← links)
- On further reducing the cost of parallel pipelined message broadcasts (Q3423749) (← links)
- Fast gossiping on mesh-bus computers (Q4420815) (← links)
- Communication costs in a geometric communication network (Q6052702) (← links)
- Communication efficient self-stabilizing leader election (Q6535008) (← links)
