Pages that link to "Item:Q2796243"
From MaRDI portal
The following pages link to Construction and impromptu repair of an MST in a distributed network with \(o(m)\) communication (Q2796243):
Displaying 11 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)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- Sample(x)=(a*x<=t) Is a Distinguisher with Probability 1/8 (Q4562282) (← links)
- (Q5090922) (← links)
- (Q5090924) (← links)
- (Q5090930) (← links)
- Beep-and-sleep: message and energy efficient set cover (Q5925658) (← links)
- Communication costs in a geometric communication network (Q6052702) (← links)
- Communication efficient self-stabilizing leader election (Q6535008) (← links)
- Near-optimal distributed computation of small vertex cuts (Q6579850) (← links)