Pages that link to "Item:Q1988528"
From MaRDI portal
The following pages link to The complexity of leader election in diameter-two networks (Q1988528):
Displaying 8 items.
- Deterministic leader election in \(O(D+\log n)\) time with messages of size \(O(1)\) (Q1660914) (← links)
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
- Dimension of k-leaders (Q1819410) (← links)
- Configuration symmetry and performance upper bound of one-dimensional cellular automata for the leader election problem (Q2814746) (← links)
- The Bit Complexity of Randomized Leader Election on a Ring (Q3829068) (← links)
- Exponential Separations in the Energy Complexity of Leader Election (Q4973045) (← links)
- Leader Election in Well-Connected Graphs (Q5197688) (← links)
- On the Complexity of Universal Leader Election (Q5501952) (← links)