R. Ostrovsky, S. Rajagopalan, U. Vazirani, "Simple and e#cient leader election in the full information model", Proc. 26th Annual ACM Symp. Theory of Computing, 1994, pp. 234-242. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Probabilistically Correct Leader Election Protocol for .. - Gupta, van Renesse.. (2000) (3 citations) (Correct)
....by practical considerations of scaling in a real network where failures can be characterized by probabilities. The spirit of our approach is close to that of [1] and [24] Our protocol s probabilistic guarantees are similar to those of leader election algorithms for the perfect information model [14, 25], while our guarantee on the number of messages resembles that of [11] which presents an election protocol for anonymous rings. To the best of our knowledge, ours is the first protocol that trades correctness of the leader election problem for better scalability. The analysis and simulation of ....
R. Ostrovsky, S. Rajagopalan, U. Vazirani, "Simple and e#cient leader election in the full information model", Proc. 26th Annual ACM Symp. Theory of Computing, 1994, pp. 234-242.
A Probabilistically Correct Leader Election Protocol for .. - Gupta, van Renesse.. (3 citations) (Correct)
....by practical considerations of scaling in a real network where failures can be characterized by probabilities. The spirit of our approach is close to that of [3] and [30] Our protocol s probabilistic guarantees are similar to those of leader election algorithms for the perfect information model [18, 32], while our guarantee on the number of messages resembles that of [14] which presents an election protocol for anonymous rings. To the best of our knowledge, ours is the first protocol that trades correctness of the leader election problem for better scalability. The rest of the paper is ....
R. Ostrovsky, S. Rajagopalan, U. Vazirani, "Simple and e#cient leader election in the full information model", Proc. 26th Annual ACM Symp. Theory of Computing, 1994, pp. 234-242.
Impossibility of Black-Box Reduction from Non-Adaptively to.. - Dodis (2000) (1 citation) (Correct)
....This result showed that the optimal resilience of static coin ipping (and leader election) is n=2. From this point on, the research in statically secure coin ipping and leader election was focusing on making constructive and or more ecient leader election and coin ipping protocols [ORV94, RZ98, F99]. This culminated in a recent paper of Feige [F99] who gave constructive, extremely simple and ecient ( 1 2 )n resilient coin ipping and leader election protocol taking log n O(1= rounds with each player sending O(log n) bits per round (improving and simplifying previous protocols of ....
....restricting each player to send at most 1 bit seems like a huge limitation. We saw that it was very limiting even for statically secure protocols (recall, no function can be more than O(n= log n) resilient by the result of [KKL89] and there are general n=2 resilient statically secure protocols [BN, ORV94, RZ98, F99]) For adaptively secure protocols, sending at most one bit seems particularly restrictive since last players typically have much more in uence in this case, and it seems quite conceivable that this unproportional in uence can be mitigated by having players send many bits (e.g. in many ....
[Article contains additional citation context not shown here]
R. Ostrovsky, S. Rajagopalan, U. Vazirani. Simple and Ecient Leader Election in the Full Information Model. In Proc. of 26th STOC, pp. 234-242, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC