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

DOI10.1016/j.tcs.2006.08.019zbMath1140.68006OpenAlexW1978261113MaRDI QIDQ861286

Wei-Mei Chen

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.08.019

zbMATH Keywords

leader electionincreasing binary treesrecursive treesextrema findingin situ permutationleft-to-right minimamaxima finding

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14)

Cites Work

• A simple, efficient algorithm for maximum finding on rings
• Symmetry breaking in distributed networks
• A heuristic to accelerate in-situ permutation algorithms
• Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
• Limiting Distributions for Path Lengths in Recursive Trees
• Decentralized extrema-finding in circular configurations of processors
• An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
• An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
• An improved algorithm for decentralized extrema-finding in circular configurations of processes
• Total Path Length for Random Recursive Trees
• Permuting in place: analysis of two stopping rules
• Introduction to Distributed Algorithms
• Permuting in Place
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cost distribution of the Chang-Roberts leader election algorithm and related problems