{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:22Z","timestamp":1759638262654},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642415265"},{"type":"electronic","value":"9783642415272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41527-2_22","type":"book-chapter","created":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T10:55:48Z","timestamp":1380797748000},"page":"314-328","source":"Crossref","is-referenced-by-count":4,"title":["Conflict Resolution and Membership Problem in Beeping Channels"],"prefix":"10.1007","author":[{"given":"Bojun","family":"Huang","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Moscibroda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-642-24100-0_3","volume-title":"Distributed Computing","author":"Y. Afek","year":"2011","unstructured":"Afek, Y., Alon, N., Bar-Joseph, Z., Cornejo, A., Haeupler, B., Kuhn, F.: Beeping a maximal independent set. In: Peleg, D. (ed.) DISC 2011. LNCS, vol.\u00a06950, pp. 32\u201350. Springer, Heidelberg (2011)"},{"issue":"6014","key":"22_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1126\/science.1193210","volume":"331","author":"Y. Afek","year":"2011","unstructured":"Afek, Y., Alon, N., Barad, O., Hornstein, E., Barkai, N., Bar-Joseph, Z.: A biological solution to a fundamental distributed computing problem. Science\u00a0331(6014), 183\u2013185 (2011)","journal-title":"Science"},{"issue":"5","key":"22_CR3","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1109\/TIT.1979.1056093","volume":"25","author":"J. Capetanakis","year":"1979","unstructured":"Capetanakis, J.: Tree algorithms for packet broadcast channels. IEEE Transactions on Information Theory\u00a025(5), 505\u2013515 (1979)","journal-title":"IEEE Transactions on Information Theory"},{"doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2001 (2001)","key":"22_CR4","DOI":"10.1145\/383962.384040"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-15763-9_15","volume-title":"Distributed Computing","author":"A. Cornejo","year":"2010","unstructured":"Cornejo, A., Kuhn, F.: Deploying wireless networks with beeps. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 148\u2013162. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Du, D., Hwang, F.: Combinatorial group testing and its applications. World Scientific (2000)","key":"22_CR6","DOI":"10.1142\/9789812798107"},{"issue":"3","key":"22_CR7","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1145\/2093548.2093574","volume":"55","author":"S. Gelly","year":"2012","unstructured":"Gelly, S., Kocsis, L., Schoenauer, M., Sebag, M., Silver, D., Szepesv\u00e1ri, C., Teytaud, O.: The grand challenge of computer go: Monte carlo tree search and extensions. Commun. ACM\u00a055(3), 106\u2013113 (2012)","journal-title":"Commun. ACM"},{"doi-asserted-by":"crossref","unstructured":"Greenberg, A.G., Winograd, S.: A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels. J. ACM\u00a032(3) (July 1985)","key":"22_CR8","DOI":"10.1145\/3828.214125"},{"issue":"8","key":"22_CR9","doi-asserted-by":"publisher","first-page":"1178","DOI":"10.1109\/TCOM.1978.1094204","volume":"26","author":"J. Hayes","year":"1978","unstructured":"Hayes, J.: An adaptive technique for local distribution. IEEE Transactions on Communications\u00a026(8), 1178\u20131186 (1978)","journal-title":"IEEE Transactions on Communications"},{"issue":"2","key":"22_CR10","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/TIT.1985.1057020","volume":"31","author":"J. Komlos","year":"1985","unstructured":"Komlos, J., Greenberg, A.: An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels. IEEE Transactions on Information Theory\u00a031(2), 302\u2013306 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"doi-asserted-by":"crossref","unstructured":"Kowalski, D.R.: On selection problem in radio networks. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005 (2005)","key":"22_CR11","DOI":"10.1145\/1073814.1073843"},{"issue":"298","key":"22_CR12","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1080\/01621459.1962.10480672","volume":"57","author":"C.H. Li","year":"1962","unstructured":"Li, C.H.: A sequential method for screening experimental variables. Journal of the American Statistical Association\u00a057(298), 455\u2013477 (1962)","journal-title":"Journal of the American Statistical Association"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(94)90133-3","volume":"52","author":"C.U. Martel","year":"1994","unstructured":"Martel, C.U.: Maximum finding on a multiple access broadcast network. Information Processing Letters\u00a052, 7\u201313 (1994)","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"Massey, J.L.: Collision-resolution algorithms and random-access communications. Technical Report UCLA-ENG-8016 (April 1980)","key":"22_CR14","DOI":"10.1007\/978-3-7091-2900-5_4"},{"unstructured":"Tsybakov, B.S., Mikhailov, V.A.: Free synchronous packet access in a broadcast channel with feedback. Prob. Inf. Transmission\u00a014(4) (April 1978)","key":"22_CR15"},{"doi-asserted-by":"crossref","unstructured":"Wolf, J.K.: Born again group testing: Multiaccess communications. IEEE Transaction on Information Theory\u00a02 (March 1985)","key":"22_CR16","DOI":"10.1109\/TIT.1985.1057026"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41527-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T14:50:41Z","timestamp":1558104641000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41527-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415265","9783642415272"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41527-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}