Optimal Two-Stage Algorithms for Group Testing Problems, SIAM Journal on Computing, vol.34, issue.5 ,
DOI : 10.1137/S0097539703428002
Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels, ESA '02: Proceedings of the 10th Annual European Symposium on Algorithms, pp.335-347, 2002. ,
DOI : 10.1007/3-540-45749-6_32
Tree algorithms for packet broadcast channels, IEEE Transactions on Information Theory, vol.25, issue.5, pp.25505-515, 1979. ,
DOI : 10.1109/TIT.1979.1056093
A better wakeup in radio networks, PODC, pp.266-274, 2004. ,
The Wake???Up Problem in MultiHop Radio Networks, SIAM Journal on Computing, vol.36, issue.5, pp.1453-1471, 2007. ,
DOI : 10.1137/S0097539704442726
On Alarm Protocol in Wireless Sensor Networks, Lecture Notes in Computer Science, vol.6288, pp.43-52, 2010. ,
DOI : 10.1007/978-3-642-14785-2_4
Selective families, superimposed codes, and broadcasting on unknown radio networks, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, SODA '01, pp.709-718, 2001. ,
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, 1007. ,
DOI : 10.1007/BF02772959
The analysis of a near-optimal cardinality estimation algorithm, AOFA 07: PROCEEDINGS OF THE 2007 INTERNATIONAL CONFERENCE ON ANALYSIS OF ALGORITHMS, 2007. ,
The Wakeup Problem in Synchronous Broadcast Systems, SIAM Journal on Discrete Mathematics, vol.14, issue.2, pp.207-222, 2001. ,
DOI : 10.1137/S0895480100376022
Towards Fair Leader Election in Wireless Networks, Lecture Notes in Computer Science, vol.5793, pp.166-179, 2009. ,
DOI : 10.1007/978-3-642-04383-3_13
A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels, J. ACM, vol.32, issue.3, pp.589-596, 1985. ,
Probabilistic Algorithms for the Wake-Up Problem in Single-Hop Radio Networks, Theory of Computing Systems, vol.38, issue.3, pp.347-367, 2005. ,
DOI : 10.1007/s00224-005-1144-3
Adversary Immune Size Approximation of Single-Hop Radio Networks, Lecture Notes in Computer Science, vol.3959, pp.148-158, 2006. ,
DOI : 10.1007/11750321_14
Nonrandom binary superimposed codes. Information Theory, IEEE Transactions on, vol.10, issue.4, pp.363-377, 1964. ,
Energy efficient alert in single-hop networks of extremely weak devices, Algorithmic Aspects of Wireless Sensor Networks, pp.139-150 ,
DOI : 10.1016/j.tcs.2012.01.044
An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels . Information Theory, IEEE Transactions on, vol.31, issue.2, pp.302-306, 1985. ,
On selection problem in radio networks, Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, PODC '05, pp.158-166, 2005. ,
Secure Initialization in Single-Hop Radio Networks, Lecture Notes in Computer Science, vol.3313, pp.31-41, 2004. ,
DOI : 10.1007/978-3-540-30496-8_4
Distributed Disaster Disclosure, Lecture Notes in Computer Science, vol.5124, pp.246-257, 2005. ,
DOI : 10.1007/978-3-540-69903-3_23
Uniform leader election protocols for radio networks, IEEE Transactions on Parallel and Distributed Systems, vol.13, issue.5, pp.516-526, 2002. ,
DOI : 10.1109/TPDS.2002.1003864