乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T17:14:39Z","timestamp":1712423679770},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,11,20]],"date-time":"2007-11-20T00:00:00Z","timestamp":1195516800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1007\/s00453-007-9123-5","type":"journal-article","created":{"date-parts":[[2007,11,19]],"date-time":"2007-11-19T10:32:51Z","timestamp":1195468371000},"page":"118-139","source":"Crossref","is-referenced-by-count":25,"title":["Many-to-Many Communication in Radio Networks"],"prefix":"10.1007","volume":"54","author":[{"given":"Bogdan S.","family":"Chlebus","sequence":"first","affiliation":[]},{"given":"Dariusz R.","family":"Kowalski","sequence":"additional","affiliation":[]},{"given":"Tomasz","family":"Radzik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,11,20]]},"reference":[{"key":"9123_CR1","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/0022-0000(91)90015-W","volume":"43","author":"N. Alon","year":"1991","unstructured":"Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. Comput. Syst. Sci. 43, 290\u2013298 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"9123_CR2","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","volume":"45","author":"R. Bar-Yehuda","year":"1992","unstructured":"Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization. J. Comput. Syst. Sci. 45, 104\u2013126 (1992)","journal-title":"J. Comput. Syst. Sci."},{"key":"9123_CR3","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/0222055","volume":"22","author":"R. Bar-Yehuda","year":"1993","unstructured":"Bar-Yehuda, R., Israeli, A., Itai, A.: Multiple communication in multihop radio networks. SIAM J. Comput. 22, 875\u2013887 (1993)","journal-title":"SIAM J. Comput."},{"key":"9123_CR4","doi-asserted-by":"crossref","first-page":"1240","DOI":"10.1109\/TCOM.1985.1096245","volume":"33","author":"I. Chlamtac","year":"1985","unstructured":"Chlamtac, I., Kutten, S.: On broadcasting in radio networks\u2014problem analysis and protocol design. IEEE Trans. Commun. 33, 1240\u20131246 (1985)","journal-title":"IEEE Trans. Commun."},{"key":"9123_CR5","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1109\/26.79285","volume":"39","author":"I. Chlamtac","year":"1991","unstructured":"Chlamtac, I., Weinstein, O.: The wave expansion approach to broadcasting in multihop radio networks. IEEE Trans. Commun. 39, 426\u2013433 (1991)","journal-title":"IEEE Trans. Commun."},{"key":"9123_CR6","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.tcs.2007.03.057","volume":"383","author":"B.S. Chlebus","year":"2007","unstructured":"Chlebus, B.S., Rokicki, M.R.: Centralized asynchronous broadcast in radio networks. Theor. Comput. Sci. 383, 5\u201322 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"9123_CR7","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., G\u0105sieniec, L., \u00d6stlin, A., Robson, J.M.: Deterministic radio broadcasting. In: Proceedings, 27th Colloquium on Automata, Languages and Programming (ICALP). LNCS, vol.\u00a01853, pp.\u00a0717\u2013728 (2000)","DOI":"10.1007\/3-540-45022-X_60"},{"key":"9123_CR8","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s446-002-8028-1","volume":"15","author":"B.S. Chlebus","year":"2002","unstructured":"Chlebus, B.S., G\u0105sieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. Distrib. Comput. 15, 27\u201338 (2002)","journal-title":"Distrib. Comput."},{"key":"9123_CR9","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., G\u0105sieniec, L., Kowalski, D.R., Radzik, T.: On the wake-up problem in radio networks. In: Proceedings, 32nd Colloquium on Automata, Languages and Programming (ICALP). LNCS, vol.\u00a03580, pp.\u00a0347\u2013359 (2005)","DOI":"10.1007\/11523468_29"},{"key":"9123_CR10","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., Kowalski, D.R., Rokicki, M.R.: Average-time complexity of gossiping in radio networks. In: Proceedings, 13th Colloquium on Structural Information and Communication Complexity (SIROCCO). LNCS, vol.\u00a04056, pp.\u00a0253\u201326 (2006)","DOI":"10.1007\/11780823_20"},{"key":"9123_CR11","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Crescenzi, P., Monti, A., Penna, P., Silvestri, R.: On computing ad-hoc selective families. In: Proceedings, 5th Workshop on Randomization and Approximation Techniques in Computer Science (APPROX-RANDOM). LNCS, vol.\u00a02129, pp.\u00a0211\u2013222 (2001)","DOI":"10.1007\/3-540-44666-4_24"},{"key":"9123_CR12","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0304-3975(02)00851-4","volume":"302","author":"A.E.F. Clementi","year":"2003","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Distributed broadcast in radio networks of unknown topology. Theor. Comput. Sci. 302, 337\u2013364 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"9123_CR13","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.jalgor.2004.08.001","volume":"60","author":"A. Czumaj","year":"2006","unstructured":"Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. J. Algorithms 60, 115\u2013143 (2006)","journal-title":"J. Algorithms"},{"key":"9123_CR14","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/j.jalgor.2003.11.004","volume":"52","author":"M. Elkin","year":"2004","unstructured":"Elkin, M., Kortsarz, G.: A logarithmic lower bound for radio broadcast. J. Algorithms 52, 8\u201325 (2004)","journal-title":"J. Algorithms"},{"key":"9123_CR15","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1137\/S0895480104445319","volume":"19","author":"M. Elkin","year":"2005","unstructured":"Elkin, M., Kortsarz, G.: Polylogarithmic additive inapproximability of the radio broadcast problem. SIAM J. Discrete Math. 19, 881\u2013899 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"9123_CR16","doi-asserted-by":"crossref","unstructured":"Elkin, M., Kortsarz, G.: An improved algorithm for radio broadcast. ACM Trans. Algorithms 3 (2007)","DOI":"10.1145\/1186810.1186818"},{"key":"9123_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0196-6774(02)00292-4","volume":"46","author":"I. Gaber","year":"2003","unstructured":"Gaber, I., Mansour, Y.: Centralized broadcast in multihop radio networks. J. Algorithms 46, 1\u201320 (2003)","journal-title":"J. Algorithms"},{"key":"9123_CR18","doi-asserted-by":"crossref","unstructured":"G\u0105sieniec, L., Potapov, I.: Gossiping with unit messages in known radio networks. In: Proceedings, 2nd IFIP Conference on Theoretical Computer Science (TCS), pp.\u00a0193\u2013205 (2002)","DOI":"10.1007\/978-0-387-35608-2_17"},{"key":"9123_CR19","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/S0895480100376022","volume":"14","author":"L. G\u0105sieniec","year":"2001","unstructured":"G\u0105sieniec, L., Pelc, A., Peleg, D.: The wakeup problem in synchronous broadcast systems. SIAM J. Discrete Math. 14, 207\u2013222 (2001)","journal-title":"SIAM J. Discrete Math."},{"key":"9123_CR20","doi-asserted-by":"crossref","unstructured":"G\u0105sieniec, L., Pagourtzis, A., Potapov, I.: Deterministic communication in radio networks with large labels. In: Proceedings, 10th European Symposium on Algorithms (ESA). LNCS, vol.\u00a02461, pp.\u00a0512\u2013524 (2002)","DOI":"10.1007\/3-540-45749-6_46"},{"key":"9123_CR21","doi-asserted-by":"crossref","unstructured":"G\u0105sieniec, L., Potapov, I., Xin, Q.: Time efficient gossiping in known radio networks. In: Proceedings, 11th Colloquium on Structural Information and Communication Complexity (SIROCCO). LNCS, vol.\u00a03104, pp.\u00a0173\u2013184 (2004)","DOI":"10.1007\/978-3-540-27796-5_16"},{"key":"9123_CR22","doi-asserted-by":"crossref","unstructured":"G\u0105sieniec, L., Radzik, T., Xin, Q.: Faster deterministic gossiping in directed ad-hoc radio networks. In: Proceedings, 9th Scandinavian Workshop on Algorithm Theory (SWAT). LNCS, vol.\u00a03111, pp.\u00a0397\u2013407 (2004)","DOI":"10.1007\/978-3-540-27810-8_34"},{"key":"9123_CR23","doi-asserted-by":"crossref","unstructured":"G\u0105sieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: Proceedings, 24th ACM Symposium on Principles of Distributed Computing (PODC), pp.\u00a0129\u2013137 (2005)","DOI":"10.1145\/1073814.1073840"},{"key":"9123_CR24","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.tcs.2006.06.017","volume":"362","author":"L. G\u0105sieniec","year":"2006","unstructured":"G\u0105sieniec, L., Kranakis, E., Pelc, A., Xin, Q.: Deterministic M2M multicast in radio networks. Theor. Comput. Sci. 362, 196\u2013206 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"9123_CR25","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1145\/3828.214125","volume":"32","author":"A.G. Greenberg","year":"1985","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 32, 589\u2013596 (1985)","journal-title":"J. ACM"},{"key":"9123_CR26","unstructured":"Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: Proceedings, 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0697\u2013704 (2002)"},{"key":"9123_CR27","doi-asserted-by":"crossref","first-page":"870","DOI":"10.1137\/S0097539702419339","volume":"33","author":"D.R. Kowalski","year":"2004","unstructured":"Kowalski, D.R., Pelc, A.: Time of deterministic broadcasting in radio networks with local knowledge. SIAM J. Comput. 33, 870\u2013891 (2004)","journal-title":"SIAM J. Comput."},{"key":"9123_CR28","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s00446-005-0126-7","volume":"18","author":"D.R. Kowalski","year":"2005","unstructured":"Kowalski, D.R., Pelc, A.: Broadcasting in undirected ad hoc radio networks. Distrib. Comput. 18, 43\u201357 (2005)","journal-title":"Distrib. Comput."},{"key":"9123_CR29","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s00446-006-0007-8","volume":"19","author":"D.R. Kowalski","year":"2007","unstructured":"Kowalski, D.R., Pelc, A.: Optimal deterministic broadcasting in known topology radio networks. Distrib. Comput. 19, 185\u2013195 (2007)","journal-title":"Distrib. Comput."},{"key":"9123_CR30","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1137\/S0097539794279109","volume":"27","author":"E. Kushilevitz","year":"1998","unstructured":"Kushilevitz, E., Mansour, Y.: An \u03a9(Dlog\u2009(N\/D)) lower bound for broadcast in radio networks. SIAM J. Comput. 27, 702\u2013712 (1998)","journal-title":"SIAM J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9123-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9123-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9123-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:01Z","timestamp":1559123101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9123-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,20]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["9123"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9123-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,20]]}}}