Pages that link to "Item:Q1660914"
From MaRDI portal
The following pages link to Deterministic leader election in \(O(D+\log n)\) time with messages of size \(O(1)\) (Q1660914):
Displaying 7 items.
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
- Impact of knowledge on election time in anonymous networks (Q1755789) (← links)
- The complexity of leader election in diameter-two networks (Q1988528) (← links)
- Near-optimal knowledge-free resilient leader election (Q2097737) (← links)
- Time vs. Information Tradeoffs for Leader Election in Anonymous Trees (Q4575621) (← links)
- (Q5090911) (← links)
- Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election (Q6052028) (← links)