Pages that link to "Item:Q5197688"

The following pages link to Leader Election in Well-Connected Graphs (Q5197688):

Displaying 3 items.

• Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
• The complexity of leader election in diameter-two networks (Q1988528) (← links)
• Leader election in well-connected graphs (Q2696279) (← links)