{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:03Z","timestamp":1725488943661},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540411833"},{"type":"electronic","value":"9783540400646"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40064-8_17","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T00:25:42Z","timestamp":1186878342000},"page":"172-183","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Communication in Unknown Networks"],"prefix":"10.1007","author":[{"given":"Luisa","family":"Gargano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephane","family":"Perennes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,18]]},"reference":[{"key":"17_CR1","unstructured":"H. Attiya and J. Welch, Distributed Computing, McGraw-Hill."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1145\/77600.77618","volume":"37","author":"B. Awerbuch","year":"1990","unstructured":"B. Awerbuch, O. Goldreich, D. Peleg and R. Vainish, A Tradeoff Between Information and Communication in Broadcast Protocols, J. of ACM 37, (1990), 238\u2013256.","journal-title":"J. of ACM"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"R. Bar-Yehuda, O. Goldreich, and A. Itai, On the time complexity of broadcastin radio networks: An exponential gap between determinism and randomization, Proc. 6th ACM PODC (1987), 98\u2013108.","DOI":"10.1145\/41840.41849"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Y. Beritbart, M. Garofalakis, R. Rastogi, S. Seshadri, A. Silbershatz, Topology Discovery in Heterogeneous IP networks, Proceedings of INFOCOM\u201999.","DOI":"10.1109\/INFCOM.2000.832196"},{"key":"17_CR5","unstructured":"B.S. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc, W. Rytter, Deterministic broadcasting in unknown radio networks, Proc. SODA\u20192000, 861\u2013870."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1142\/S0129626498000195","volume":"8","author":"K. Diks","year":"1998","unstructured":"K. Diks, E. Kranakis and A. Pelc, Broadcasting in unlabeled tori, Par. Proc. Lett. 8 (1998), 177\u2013188.","journal-title":"Par. Proc. Lett."},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0166-218X(98)00047-X","volume":"87","author":"K. Diks","year":"1999","unstructured":"K. Diks, E. Kranakis and A. Pelc, Perfect broadcasting in unlabeled networks, Discrete Applied Mathematics 87 (1999), 33\u201347.","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0020-0190(98)00055-6","volume":"66","author":"K. Diks","year":"1998","unstructured":"K. Diks, S. Dobrev, E. Kranakis, A. Pelc and P. Ruzicka, Broadcasting in unlabeledhypercubes with linear number of messages, IPL 66 (1998), 181\u2013186.","journal-title":"IPL"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1002\/rsa.3240010406","volume":"1","author":"U. Feige","year":"1990","unstructured":"U. Feige, D. Peleg, P. Raghavan and E. Upfal, Randomized broadcast in networks, Random Structures and Algorithms 1 (1990), 447\u2013460.","journal-title":"Random Structures and Algorithms"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"R. Gavindan, H. Tangmunarunkit, Heuristics for Internet map discovery, Proceedings of INFOCOM\u201999.","DOI":"10.1109\/INFCOM.2000.832534"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"M. Harchol-Balter, T. Leighton, D. Lewin, Resource Discovery in Distributed Networks, Proceedings of PODC\u201999, 229\u2013237.","DOI":"10.1145\/301308.301362"},{"key":"17_CR12","first-page":"149","volume":"8","author":"H. Harutyunyan","year":"1998","unstructured":"H. Harutyunyan and A. Liestman, Messy broadcasting, PPL 8(1998), 149\u2013160.","journal-title":"PPL"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"S.M. Hedetniemi","year":"1988","unstructured":"S.M. Hedetniemi, S.T. Hedetniemi and A.L. Liestman, A survey of Gossiping and Broadcasting in Communication Networks, Networks 18 (1988), 319\u2013349.","journal-title":"Networks"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d, R. Klasing, B. Monien, and R. Peine, Dissemination of Information in Interconnection Networks, in: Ding-Zhu Du and D. Frank Hsu (Eds.) Combinatorial Network Theory, Kluwer, 1995, 125\u2013212.","DOI":"10.1007\/978-1-4757-2491-2_5"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<143::AID-NET3>3.0.CO;2-N","volume":"28","author":"A. Pelc","year":"1996","unstructured":"A. Pelc, Fault Tolerant Broadcasting and Gossiping in Communication Networks, NETWORKS 28 (1996), 143\u2013156.","journal-title":"NETWORKS"},{"key":"17_CR16","unstructured":"R. Reischuk and M. Koshors, Lower bound for Synchronous Systems and the Advantage of Local Information, Proc. of 2nd WDAG, (1987), pp. 374\u2013387."},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/TIT.1983.1056620","volume":"29","author":"A. Segall","year":"1983","unstructured":"A. Segall, Distributed Network Protocols, IEEE Trans. Inf. Th. 29 (1983), 23\u201335.","journal-title":"IEEE Trans. Inf. Th."},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"G. Tel, Introduction to distributed algorithms, Cambridge University Press, 1994.","DOI":"10.1007\/BFb0020419"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40064-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:39:39Z","timestamp":1556739579000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40064-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540411833","9783540400646"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-40064-8_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}