Perfect information leader election in log* n+O(1) rounds

Journal of Computer and System Sciences

Volumn 63, Issue 4, 2001, Pages 612-626

  Russell, Alexander ^a   Zuckerman, David ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; SAMPLING; SET THEORY;

INFORMATION MODEL; LEADER ELECTION PROBLEM;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0035733591     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2001.1776     Document Type: Article

References (20)

1. The influence of large coalition
2. Coin-flipping games immune against linear-sized coalitions
3. The probabilistic methods
4. Weighted sums of certain dependent random variables
5. Collective coin flipping
6. Perfect-information leader election with optimal resilience
7. Fast perfect-information leader-election protocols with linear immunity
8. Noncryptographic selection protocols
9. An optimal probabilistic protocol for synchronous Byzantine agreement
10. Fault-tolerant computation in the full information model (extended abstract)
11. Probability inequalities for sums of bounded random variables
12. Remote electronic gambling
13. The influence of variables on Boolean functions (extended abstract)
14. Efficient construction of a small hitting set for combinatorial rectangles in high dimension
15. Extracting randomness: How and why - A survey
16. Simple and efficient leader election in the full information model
17. A robust noncryptographic protocol for collective coin flipping
18. Collected works
19. Various techniques used in connection with random digits
20. Randomness-optimal oblivious sampling