On a leader election algorithm: Truncated geometric case study
Recent work of Kalpathy and Mahmoud (in press) gives very general results for a broad class of fair leader election algorithms. They study the duration of contestants, i.e., the number of rounds a randomly selected contestant stays in the competition and another parameter for the associated tree str...
Saved in:
| Published in: | Statistics & probability letters Vol. 87; pp. 40 - 47 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
01.04.2014
|
| Subjects: | |
| ISSN: | 0167-7152, 1879-2103 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!