Pages that link to "Item:Q5501952"
From MaRDI portal
The following pages link to On the Complexity of Universal Leader Election (Q5501952):
Displaying 18 items.
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
- Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model (Q1981632) (← links)
- The complexity of leader election in diameter-two networks (Q1988528) (← links)
- Near-optimal knowledge-free resilient leader election (Q2097737) (← links)
- Latency, capacity, and distributed minimum spanning trees (Q2119398) (← links)
- Message lower bounds via efficient network synchronization (Q2292919) (← links)
- Leader election in well-connected graphs (Q2696279) (← links)
- Message Lower Bounds via Efficient Network Synchronization (Q2835018) (← links)
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree (Q5012805) (← links)
- (Q5090922) (← links)
- (Q5090924) (← links)
- (Q5090930) (← links)
- Communication costs in a geometric communication network (Q6052702) (← links)
- Transmitting once to elect a leader on wireless networks (Q6077889) (← links)
- Distributed computation of exact average degree and network size in finite time under quantized communication (Q6092455) (← links)
- Termination of amnesiac flooding (Q6099033) (← links)
- Singularly optimal randomized leader election (Q6535020) (← links)
- The topology of randomized symmetry-breaking distributed computing (Q6645915) (← links)
