On the complexity of universal leader election

Keyphrases

• Randomized Algorithms 100%
• Leader Election 100%
• Distributed Network 66%
• Monte Carlo Algorithm 66%
• Adaptation 33%
• Tight 33%
• Network Diameter 33%
• Number of Edges 33%
• Time Complexity 33%
• Lower Bound Techniques 33%
• Node number 33%
• Time Algorithm 33%
• Deterministic Algorithm 33%
• Complexity Bounds 33%
• Algorithm Comparison 33%
• Distributed Computing 33%
• Leader Algorithm 33%
• Broadcast Algorithm 33%
• Message Complexity 33%
• Universal Algorithm 33%
• Complete Network 33%
• Elected Leaders 33%
• Randomized Setting 33%
• Node Identity 33%

Computer Science

• Randomized Algorithm 100%
• Distributed Network 66%
• Time Complexity 33%
• Distributed Computing 33%
• Election Algorithm 33%
• Implicit Version 33%
• Fundamental Problem 33%