Pages that link to "Item:Q5197688"
From MaRDI portal
The following pages link to Leader Election in Well-Connected Graphs (Q5197688):
Displaying 8 items.
- Sublinear bounds for randomized leader election (Q477103) (← links)
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
- Dimension of k-leaders (Q1819410) (← links)
- The complexity of leader election in diameter-two networks (Q1988528) (← links)
- Leader election in well-connected graphs (Q2696279) (← links)
- Survivors in Leader Election Algorithms (Q5194763) (← links)
- Leader election in complete networks (Q5348850) (← links)
- Smoothed Analysis of Leader Election in Distributed Networks (Q6487906) (← links)