On the Complexity of Universal Leader Election

Journal of the ACM - United States
doi 10.1145/2699440
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computing Machinery (ACM)

Related search

Leader Election Using Loneliness Detection

Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureComputational TheoryMathematicsTheoretical Computer Science
2012English

Perpetuities in Fair Leader Election Algorithms

2013English

Uniform Dynamic Self-Stabilizing Leader Election

English

Leader Election Using Modified Heap Tree Method

International Journal of Computer Applications
2012English

Uniform Leader Election Protocols for Radio Networks

IEEE Transactions on Parallel and Distributed Systems
HardwareComputational TheorySignal ProcessingArchitectureMathematics
2002English

An O(1) RMRs Leader Election Algorithm

2006English

Uniform Leader Election Protocols for Radio Networks

2001English

Leader Complexity and Leadership Style

1970English

Leader Election for Replicated Services Using Application Scores

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy