论文信息 - On Lotteries with Unique Winners

On Lotteries with Unique Winners

Lotteries with the unique maximum property and the unique winner property are considered. Tight lower bounds are proven on the domain size of such lotteries.

Eyal Kushilevitz | Yishay Mansour | Michael O. Rabin

[1] Eyal Kushilevitz,et al. An Ω(D log(N/D)) lower bound for broadcast in radio networks , 1993, PODC '93.

[2] Michael O. Rabin,et al. N-Process Mutual Exclusion with Bounded Waiting by 4 Log_2 N-Valued Shared Variable , 1982, J. Comput. Syst. Sci..

[3] Eyal Kushilevitz,et al. Randomized mutual exclusion algorithms revisited , 1992, PODC '92.

[4] Uzi Vishkin,et al. Towards a theory of nearly constant time parallel algorithms , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[5] Reuven Bar-Yehuda,et al. On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization , 1992, J. Comput. Syst. Sci..

[6] Yossi Matias,et al. Simple and Efficient Election Algorithms for Anonymous Networks , 1989, WDAG.

[7] Eyal Kushilevitz,et al. Lower bounds for randomized mutual exclusion , 1993, SIAM J. Comput..