Pages that link to "Item:Q1660914"

The following pages link to Deterministic leader election in \(O(D+\log n)\) time with messages of size \(O(1)\) (Q1660914):

Displaying 4 items.

• Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
• Impact of knowledge on election time in anonymous networks (Q1755789) (← links)
• Near-optimal knowledge-free resilient leader election (Q2097737) (← links)
• (Q5090911) (← links)