Cost distribution of the Chang-Roberts leader election algorithm and related problems

Authors:
Wei-Mei Chen
Affiliations:
Department of Electronic Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan
Venue:
Theoretical Computer Science
Year:
2006

Citing 14
Cited 0

Enumerative combinatorics

Enumerative combinatorics
Symmetry breaking in distributed networks

Information and Computation
Permuting In Place

SIAM Journal on Computing
A simple, efficient algorithm for maximum finding on rings

Information Processing Letters
An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Decentralized extrema-finding in circular configurations of processors

Communications of the ACM
An improved algorithm for decentralized extrema-finding in circular configurations of processes

Communications of the ACM
Introduction to Distributed Algorithms

Introduction to Distributed Algorithms
Distributed Algorithms

Distributed Algorithms
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions

SIAM Journal on Computing
A heuristic to accelerate in-situ permutation algorithms

Information Processing Letters
Varieties of Increasing Trees

CAAP '92 Proceedings of the 17th Colloquium on Trees in Algebra and Programming
Total Path Length for Random Recursive Trees

Combinatorics, Probability and Computing
Permuting in place: analysis of two stopping rules

Journal of Algorithms

Quantified Score

Hi-index	5.23

Visualization

Abstract

A detailed probabilistic analysis is proposed of the total number of messages of the Chang-Roberts leader election algorithm. The cost is shown to be closely related to the total path length in random recursive trees, the total left-path length in increasing binary trees and the major cost of an in situ permutation algorithm.