Randomized O (log log n)-Round Leader Election Protocols in Packet Radio Networks
暂无分享,去创建一个
[1] Joseph JáJá,et al. An Introduction to Parallel Algorithms , 1992 .
[2] Dan E. Willard,et al. Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel , 1986, SIAM J. Comput..
[3] Gordon Bell,et al. Ethernet: Distributed Packet Switching for Local Computer Networks , 1976 .
[4] Andrew Chi-Chih Yao,et al. An Almost Optimal Algorithm for Unbounded Searching , 1976, Inf. Process. Lett..
[5] Rajeev Motwani,et al. Randomized algorithms , 1996, CSUR.
[6] Dimitri P. Bertsekas,et al. Data Networks , 1986 .
[7] John Capetanakis,et al. Tree algorithms for packet broadcast channels , 1979, IEEE Trans. Inf. Theory.
[8] Imrich Chlamtac,et al. Tree-Based Broadcasting in Multihop Radio Networks , 1987, IEEE Transactions on Computers.