On Computing Ad-hoc Selective Families
暂无分享,去创建一个
[1] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[2] Robert G. Gallager,et al. A perspective on multiaccess channels , 1984, IEEE Trans. Inf. Theory.
[3] Imrich Chlamtac,et al. On Broadcasting in Radio Networks - Problem Analysis and Protocol Design , 1985, IEEE Transactions on Communications.
[4] Anna Pagh,et al. Deterministic Radio Broadcasting , 2000, ICALP.
[5] Noga Alon,et al. A Lower Bound for Radio Broadcast , 1991, J. Comput. Syst. Sci..
[6] Wojciech Rytter,et al. Fast broadcasting and gossiping in radio networks , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[7] Lawrence G. Roberts,et al. ALOHA packet system with and without slots and capture , 1975, CCRV.
[8] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.
[9] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[10] Imrich Chlamtac,et al. The wave expansion approach to broadcasting in multihop radio networks , 1991, IEEE Trans. Commun..
[11] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.
[12] 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..
[13] Wojciech Rytter,et al. Deterministic broadcasting in unknown radio networks , 2000, SODA '00.
[14] Yishay Mansour,et al. Broadcast in radio networks , 1995, SODA '95.
[15] Andrzej Pelc,et al. Broadcasting in radio networks , 2002 .
[16] Andrea E. F. Clementi,et al. Selective families, superimposed codes, and broadcasting on unknown radio networks , 2001, SODA '01.