The following pages link to (Q5090924):
Displaying 13 items.
- Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model (Q1981632) (← links)
- Latency, capacity, and distributed minimum spanning trees (Q2119398) (← links)
- Low-congestion shortcut and graph parameters (Q2241301) (← links)
- Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks (Q3210138) (← links)
- Constant space and non-constant time in distributed computing (Q3300833) (← links)
- Efficient distributed algorithms by using the archimedean time assumption (Q3816977) (← links)
- Ability to Count Messages Is Worth Θ(Δ) Rounds in Distributed Computing (Q4635891) (← links)
- Interval approximations of message causality in distributed executions (Q5096795) (← links)
- New classes of distributed time complexity (Q5230383) (← links)
- Beep-and-sleep: message and energy efficient set cover (Q5918712) (← links)
- Beep-and-sleep: message and energy efficient set cover (Q5925658) (← links)
- Communication costs in a geometric communication network (Q6052702) (← links)
- Singularly optimal randomized leader election (Q6535020) (← links)
