{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T02:21:56Z","timestamp":1768270916847,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424703","type":"print"},{"value":"9783540446668","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44666-4_24","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T12:58:07Z","timestamp":1178197087000},"page":"211-222","source":"Crossref","is-referenced-by-count":15,"title":["On Computing Ad-hoc Selective Families"],"prefix":"10.1007","author":[{"given":"Andrea E. F.","family":"Clementi","sequence":"first","affiliation":[]},{"given":"Pilu","family":"Crescenzi","sequence":"additional","affiliation":[]},{"given":"Angelo","family":"Monti","sequence":"additional","affiliation":[]},{"given":"Paolo","family":"Penna","sequence":"additional","affiliation":[]},{"given":"Riccardo","family":"Silvestri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/0022-0000(91)90015-W","volume":"43","author":"N. Alon","year":"1991","unstructured":"N. Alon,, A. Bar-Noy, N. Linial, and D. Peleg (1991), A lower bound for radio broadcast, J. Comput. System Sci., 43, 290\u2013298.","journal-title":"J. Comput. System Sci."},{"key":"24_CR2","unstructured":"N. Alon and J. Spencer (1992), The probabilistic method, Wiley."},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","volume":"45","author":"R. Bar-Yehuda","year":"1992","unstructured":"R. Bar-Yehuda, O. Goldreich, and A. Itai (1992), On the time-complexity of broadcast operations in multi-hop radio networks: an exponential gap between determinism and randomization, J. Comput. System Sci., 45, 104\u2013126.","journal-title":"J. Comput. System Sci."},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1109\/TCOM.1985.1096245","volume":"33","author":"I. Chlamtac","year":"1985","unstructured":"I. Chlamtac and S. Kutten (1985), On Broadcasting in Radio Networks-Problem Analysis and Protocol Design, IEEE Trans. on Communications, 33, 1240\u20131246.","journal-title":"IEEE Trans. on Communications"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1109\/26.79285","volume":"39","author":"I. Chlamtac","year":"1991","unstructured":"I. Chlamtac, O. Weinstein (1991), The Wave Expansion Approach to Broadcasting in Multihop Radio Networks, IEEE Trans. on Communications, 39, 426\u2013433.","journal-title":"IEEE Trans. on Communications"},{"key":"24_CR6","unstructured":"B.S. Chlebus, L. Gcaasieniec, A.M. Gibbons, A. Pelc, and W. Rytter (2000), Deterministic broadcasting in unknown radio networks, Proc. of 11th ACM-SIAM SODA, 861\u2013870."},{"key":"24_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/3-540-45022-X_60","volume-title":"Proc. of 27th ICALP","author":"B. S. Chlebus","year":"2000","unstructured":"B. S. Chlebus, L. G. casieniec, A. Ostlin, and J. M. Robson (2000), Deterministic radio broadcasting, Proc. of 27th ICALP, LNCS, 1853, 717\u2013728."},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"M. Chrobak, L. G. casieniec, W. Rytter (2000), Fast broadcasting and gossiping in radio networks, Proc. of 41st IEEE FOCS, 575\u2013581.","DOI":"10.1109\/SFCS.2000.892325"},{"key":"24_CR9","unstructured":"A.E.F. Clementi, A. Monti, and R. Silvestri (2001), Selective Families, Superimposed Codes, and Broadcasting on Unknown Networks, Proc. 12th ACM-SIAM SODA, 709\u2013718."},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/TIT.1985.1057022","volume":"31","author":"R. Gallager","year":"1985","unstructured":"R. Gallager (1985), A perspective on multiaccess channels, IEEE Trans. Inform. Theory, 31, 124\u2013142.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"24_CR11","unstructured":"I. Gaber and Y. Mansour (1995), Broadcast in Radio Networks, Proc. 6th ACM-SIAM SODA, 577\u2013585."},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"R. Motwani and P. Raghavan (1995), Randomized Algorithms, Cambridge University Press.","DOI":"10.1017\/CBO9780511814075"},{"key":"24_CR13","unstructured":"C.H. Papadimitriou (1994), Computational Complexity, Addison Wesley."},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"C.H. Papadimitriou and M. Yannakakis (1991), Optimization, approximation, and complexity classes, J. Comput. System Sci., 43, 425\u2013440.","journal-title":"J. Comput. System Sci."},{"key":"24_CR15","unstructured":"A. Pelc (2000), Broadcasting in Radio Networks, unpublished manuscript."},{"key":"24_CR16","unstructured":"L.G. Roberts (1972), Aloha Packet System with and without Slots and Capture, ASS Notes 8, Advanced Research Projects Agency, Network Information Center, Stanford Research Institute."},{"key":"24_CR17","unstructured":"T.J. Schaefer (1979), The complexity of satisfiability problems, Proc. 10th ACM STOC, 216\u2013226."}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44666-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T06:50:32Z","timestamp":1550299832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44666-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424703","9783540446668"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44666-4_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}