J. Komlós and A. G. Greenberg, Correction to 'An Asymptotically Nonadaptive Algorithm for Conflict Resolution in Multiple-Access Channels', IEEE Transactions on Information Theory, vol.31, issue.6, p.841, 1985.
DOI : 10.1109/TIT.1985.1057101

A. E. Clementi, A. Monti, and R. Silvestri, Selective families, superimposed codes, and broadcasting on unknown radio networks, Ed. ACM/SIAM, pp.709-718, 2001.

J. Hayes, An Adaptive Technique for Local Distribution, IEEE Transactions on Communications, vol.26, issue.8, pp.1178-1186, 1978.
DOI : 10.1109/TCOM.1978.1094204

A. G. Greenberg and S. Winograd, A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels, Journal of the ACM, vol.32, issue.3, pp.589-596, 1985.
DOI : 10.1145/3828.214125

C. U. Martel, Maximum finding on a multiple access broadcast network, Information Processing Letters, vol.52, issue.1, pp.7-15, 1994.
DOI : 10.1016/0020-0190(94)90133-3

D. R. Kowalski, On selection problem in radio networks, Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing , PODC '05, pp.158-166, 2005.
DOI : 10.1145/1073814.1073843

A. F. Anta and M. A. Mosteiro, Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks, COCOON, ser. Lecture Notes in Computer Science, pp.378-388, 2010.
DOI : 10.1007/978-3-642-14031-0_41

G. D. Marco and D. R. Kowalski, Towards Power-Sensitive Communication on a Multiple-Access Channel, 2010 IEEE 30th International Conference on Distributed Computing Systems, pp.728-735, 2010.
DOI : 10.1109/ICDCS.2010.50

K. Nakano and S. Olariu, Energy-efficient initialization protocols for radio networks with no collision detection, 2000.

J. L. Bordim, J. Cui, N. Ishii, and K. Nakano, Doublylogarithmic energy-efficient initialization protocols for singlehop radio networks, IPDPS, 2002.
DOI : 10.1007/3-540-46632-0_23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.3657

T. Jurdzinski, M. Kutylowski, and J. Zatopianski, Energyefficient size approximation of radio networks with no collision detection, COCOON, ser. Lecture Notes in Computer Science, pp.279-289, 2002.

M. Klonowski, M. Kutylowski, and J. Zatopianski, Energy efficient alert in single-hop networks of extremely weak devices, ALGOSENSORS, ser. Lecture Notes in Computer Science, S. Dolev, pp.139-150, 2009.
DOI : 10.1016/j.tcs.2012.01.044

K. Nakano and S. Olariu, Energy-efficient randomized routing in radio networks, Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications , DIALM '00, pp.35-44, 2000.
DOI : 10.1145/345848.345856

M. Kutylowski and W. Rutkowski, Adversary Immune Leader Election in ad hoc Radio Networks, ESA, pp.397-408, 2003.
DOI : 10.1007/978-3-540-39658-1_37

D. E. Willard, Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel, SIAM Journal on Computing, vol.15, issue.2, pp.468-477, 1986.
DOI : 10.1137/0215032

M. Raab and A. Steger, ???Balls into Bins??? ??? A Simple and Tight Analysis, 1998.
DOI : 10.1007/3-540-49543-6_13

W. Kautz and R. Singleton, Nonrandom binary superimposed codes Information Theory, IEEE Transactions on, vol.10, issue.4, pp.363-377, 1964.

A. D. Bonis and U. Vaccaro, Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels, Theoretical Computer Science, vol.306, issue.1-3, pp.223-243, 2003.
DOI : 10.1016/S0304-3975(03)00281-0

P. Erd?-os, P. Frankl, and Z. Füredi, Families of finite sets in which no set is covered by the union ofr others, Israel Journal of Mathematics, vol.27, issue.2, pp.79-89, 1985.
DOI : 10.1007/BF02772959

M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, ninth dover printing, tenth gpo printing ed, 1964.