A probabilistic analysis of a leader election algorithm

Details A probabilistic analysis of a leader election algorithm A probabilistic analysis of a leader election algorithm

2007-02-09

arxiv.org/abs/cs/0702056v1

Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities (2006) 225-236

Computer Science

Data Structures and Algorithms

Scientific paper

A {\em leader election} algorithm is an elimination process that divides recursively into tow subgroups an initial group of n items, eliminates one subgroup and continues the procedure until a subgroup is of size 1. In this paper the biased case is analyzed. We are interested in the {\em cost} of the algorithm, i.e. the number of operations needed until the algorithm stops. Using a probabilistic approach, the asymptotic behavior of the algorithm is shown to be related to the behavior of a hitting time of two random sequences on [0,1].

Affiliated with

Also associated with

No associations

Rating

A probabilistic analysis of a leader election algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A probabilistic analysis of a leader election algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A probabilistic analysis of a leader election algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-8129