Perfect Information Leader Election in log*n+O(1) Rounds
- 31 December 2001
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 63 (4) , 612-626
- https://doi.org/10.1006/jcss.2001.1776
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Extracting randomness: how and why. A surveyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Perfect-Information Leader Election with Optimal ResilienceSIAM Journal on Computing, 2000
- An Optimal Probabilistic Protocol for Synchronous Byzantine AgreementSIAM Journal on Computing, 1997
- Efficient construction of a small hitting set for combinatorial rectangles in high dimensionCombinatorica, 1997
- Fast perfect-information leader-election protocols with linear immunityCombinatorica, 1995
- The influence of large coalitionsCombinatorica, 1993
- Coin-Flipping Games Immune against Linear-Sized CoalitionsSIAM Journal on Computing, 1993
- A Robust Noncryptographic Protocol for Collective Coin FlippingSIAM Journal on Discrete Mathematics, 1989
- Weighted sums of certain dependent random variablesTohoku Mathematical Journal, 1967
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963