{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:08:42Z","timestamp":1761401322675},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650669"},{"type":"electronic","value":"9783540496939"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0056477","type":"book-chapter","created":{"date-parts":[[2006,7,30]],"date-time":"2006-07-30T08:37:41Z","timestamp":1154248661000},"page":"104-118","source":"Crossref","is-referenced-by-count":34,"title":["Propagation and leader election in a multihop broadcast environment"],"prefix":"10.1007","author":[{"given":"Israel","family":"Cidon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Osnat","family":"Mokryn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,2]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"B. Awerbuch. Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems. Proc. 19th Symp. on Theory of Computing, pages 230\u2013240, May 1987.","DOI":"10.1145\/28395.28421"},{"key":"10_CR2","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. On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. Journal on Computer and System Sciences, 45:104\u2013126, 1992.","journal-title":"Journal on Computer and System Sciences"},{"key":"10_CR3","unstructured":"A. Ben-David and M. Sidi. Collision resolution algorithms in multi-station packet radio network. IEEE Journal on Selected Areas in Communications, November 1983."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"F. Chin and H.F. Ting. An almost linear time and o(vlogv+e) message distributed algorithm for minimum weight spanning trees. Proceedings of Foundations Of Computer Science (FOCS), October 1985.","DOI":"10.1109\/SFCS.1985.7"},{"issue":"3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1109\/26.79285","volume":"COM-39","author":"I. Chlamtac","year":"1991","unstructured":"I. Chlamtac and O. Weinstein. The wave expansion approach to broadcasting in multihop radio networks. IEEE Transaction on Communications, COM-39(3):426\u2013433, 1991.","journal-title":"IEEE Transaction on Communications"},{"key":"10_CR6","unstructured":"I. Cidon and O. Mokryn. Distributed algorithms in a multihop broadcast environment. Technical Report \u2014 Center for Communication and Information Technologies, Technion, no. 241, 1998."},{"issue":"10","key":"10_CR7","doi-asserted-by":"publisher","first-page":"1353","DOI":"10.1109\/12.35830","volume":"38","author":"I. Cidon","year":"1989","unstructured":"I. Cidon and M. Sidi. Distributed assignment algorithm for multihop packet radio networks. IEEE Transaction on Computers, 38(10):1353\u20131361, October 1989.","journal-title":"IEEE Transaction on Computers"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"M. Faloutsos and M. Molle. Optimal distributed algorithms for minimum spanning trees revisited. ACM Symp. on Principles of Distributed Computing, pages 231\u2013237, May 1995.","DOI":"10.1145\/224964.225474"},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"4","author":"R. Gallager","year":"1983","unstructured":"R. Gallager, P. Humblet, and P. Spira. A distributed algorithm for minimum weight spanning trees. ACM Transactions on Programming languages and Systems, 4(1):66\u201377, January 1983.","journal-title":"ACM Transactions on Programming languages and Systems"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"J.A. Garay, S. Kutten, and D. Peleg. A sub-linear time distributed algorithm for minimum-weight spanning trees. SIAM Journal on Computing, pages 302\u2013316, 1998.","DOI":"10.1137\/S0097539794261118"},{"issue":"5","key":"10_CR11","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1109\/JSAC.1983.1145994","volume":"SAC-1","author":"M.A. Marsen","year":"1983","unstructured":"M.A. Marsen and D. Roffinella. Multichannel local area network protocols. IEEE Journal on Selected Areas in Communications, SAC-1(5):885\u2013897, November 1983.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/TIT.1983.1056620","volume":"IT-29","author":"A. Segall","year":"1983","unstructured":"A. Segall. Distributed network protocols. IEEE Transaction on Information Theory, IT-29(1):23\u201335, January 1983.","journal-title":"IEEE Transaction on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0056477","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T11:41:53Z","timestamp":1555760513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0056477"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650669","9783540496939"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0056477","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}