Faster Deterministic Wakeup in Multiple Access Channels
暂无分享,去创建一个
[1] P. Erdös,et al. Families of finite sets in which no set is covered by the union ofr others , 1985 .
[2] Andrzej Pelc,et al. Faster broadcasting in unknown radio networks , 2001, Inf. Process. Lett..
[3] János Komlós,et al. An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels , 1985, IEEE Trans. Inf. Theory.
[4] Andrzej Pelc,et al. The Wakeup Problem in Synchronous Broadcast Systems , 2000, SIAM J. Discret. Math..
[5] P. Erdös,et al. On the Integers Relatively Prime to $n$ and a Number-Theoretic Function Considered by Jacobsthal. , 1962 .
[6] Annalisa De Bonis,et al. Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels , 2003, Theor. Comput. Sci..
[7] Richard C. Singleton,et al. Nonrandom binary superimposed codes , 1964, IEEE Trans. Inf. Theory.
[8] Marek Chrobak,et al. The wake-up problem in multi-hop radio networks , 2004, SODA '04.
[9] Henryk Iwaniec,et al. ON THE PROBLEM OF JACOBSTHAL , 1978 .
[10] D. Du,et al. Combinatorial Group Testing and Its Applications , 1993 .
[11] Dariusz R. Kowalski,et al. On the Wake-Up Problem in Radio Networks , 2005, ICALP.
[12] Peter March,et al. On the stability of the Ethernet , 1985, STOC '85.
[13] Albert G. Greenberg,et al. A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels , 1985, JACM.
[14] 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..
[15] E. Wright,et al. An Introduction to the Theory of Numbers , 1939 .
[16] Robert G. Gallager,et al. A perspective on multiaccess channels , 1984, IEEE Trans. Inf. Theory.
[17] Frank Thomson Leighton,et al. Analysis of backoff protocols for multiple access channels , 1987, STOC '87.
[18] Tomasz Jurdzinski,et al. Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks , 2002, ISAAC.
[19] Dariusz R. Kowalski,et al. A better wake-up in radio networks , 2004, PODC '04.
[20] Piotr Indyk,et al. Deterministic superimposed coding with applications to pattern matching , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[21] Dimitri P. Bertsekas,et al. Data Networks , 1986 .