Y. Afek, N. Alon, Z. Bar-joseph, A. Cornejo, B. Haeupler et al., Beeping a maximal independent set, Distributed Computing, vol.26, issue.4, pp.195-208, 2013.

R. Bar-yehuda, A. Israeli, and A. Itai, Multiple communication in multihop radio networks, SIAM Journal on Computing, vol.22, issue.4, pp.875-887, 1993.

A. Bonis, L. Gasieniec, and U. Vaccaro, Optimal two-stage algorithms for group testing problems, SIAM Journal on Computing, vol.34, issue.5, pp.1253-1270, 2005.

M. Cheraghchi, Noise-resilient group testing: Limitations and constructions, Discrete Applied Mathematics, vol.161, issue.1, pp.81-95, 2013.

B. S. Chlebus, D. R. Kowalski, A. Pelc, and M. A. Rokicki, Efficient distributed communication in ad-hoc radio networks, ICALP. pp, pp.613-624, 2011.

F. Cicalese and U. Vaccaro, Superselectors: Efficient constructions and applications, ESA. pp, pp.207-218, 2010.

A. Cornejo and F. Kuhn, Deploying wireless networks with beeps, DISC. pp, pp.148-162, 2010.

A. Czumaj and P. Davies, Communicating with Beeps, OPODIS. pp, pp.1-16, 2016.

A. Czumaj and P. Davies, Deterministic communication in radio networks, SIAM Journal on Computing, vol.47, issue.1, pp.218-240, 2018.

A. Czumaj and P. Davies, Communicating with beeps, Journal of Parallel and Distributed Computing, 2019.

R. Dorfman, The detection of defective members of large populations, Ann. Math. Statist, vol.14, issue.4, pp.436-440, 1943.

D. Z. Du and F. K. Hwang, Combinatorial Group Testing and Its Applications, 1993.

F. Dufoulon, J. Burman, and J. Beauquier, Beeping a Deterministic Time-Optimal Leader Election, DISC. pp, vol.20, p.17, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01794711

A. D'yachkov, V. Rykov, and A. Rashad, Superimposed distance codes, Problems Control Inform. Theory, vol.18, issue.4, pp.237-250, 1989.

M. Ghaffari and B. Haeupler, Near optimal leader election in multi-hop radio networks, SODA. pp, pp.748-766, 2013.

F. K. Hwang, A method for detecting all defective members in a population by group testing, Journal of the American Statistical Association, vol.67, issue.339, pp.605-608, 1972.

P. Indyk, H. Q. Ngo, and A. Rudra, Efficiently decodable non-adaptive group testing, SODA. pp, pp.1126-1142, 2010.
DOI : 10.1137/1.9781611973075.91
URL : http://www.cse.buffalo.edu/~hungngo/papers/soda10.pdf

C. H. Li, A sequential method for screening experimental variables, Journal of the American Statistical Association, vol.57, issue.298, pp.455-477, 1962.
DOI : 10.2307/2281652

J. Luo and D. Guo, Neighbor discovery in wireless ad hoc networks based on group testing, 46th Annual Allerton Conference on Communication, Control, and Computing, pp.791-797, 2008.

H. Q. Ngo, E. Porat, and A. Rudra, Efficiently decodable error-correcting list disjunct matrices and applications, ICALP. pp, pp.557-568, 2011.
DOI : 10.1007/978-3-642-22006-7_47

E. Porat and A. Rothschild, Explicit nonadaptive combinatorial group testing schemes, IEEE Transactions on Information Theory, vol.57, issue.12, pp.7982-7989, 2011.
DOI : 10.1109/tit.2011.2163296
URL : http://arxiv.org/pdf/0712.3876

S. P. Vadhan, Pseudorandomness. Foundations and Trends in Theoretical Computer Science, vol.7, issue.1-3, pp.1-336, 2012.