Pages that link to "Item:Q477103"
From MaRDI portal
The following pages link to Sublinear bounds for randomized leader election (Q477103):
Displaying 10 items.
- Tight bounds for distributed minimum-weight spanning tree verification (Q372968) (← links)
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
- The complexity of leader election in diameter-two networks (Q1988528) (← 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)
- Performance and robustness of discrete and finite time average consensus algorithms (Q5027790) (← links)
- On the Complexity of Universal Leader Election (Q5501952) (← links)
- (Q5507408) (redirect page) (← links)
- Termination of amnesiac flooding (Q6099033) (← links)
