{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:34:56Z","timestamp":1742398496874},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540555995"},{"type":"electronic","value":"9783540472506"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55599-4_84","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:19:18Z","timestamp":1330251558000},"page":"113-130","source":"Crossref","is-referenced-by-count":6,"title":["Optimal algorithms for dissemination of information in generalized communication modes"],"prefix":"10.1007","author":[{"given":"R.","family":"Feldmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Hromkovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Madhavapeddy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Monien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Mysliwietz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,14]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"B. Aiello, T. Leighton, B. Maggs, and M. Newman. Fast algorithms for bit-serial routing on a hypercube. 2nd ACM Symposium on Parallel Algorithms and Architectures, pages pp. 55\u201364, 1990.","DOI":"10.1145\/97444.97459"},{"key":"8_CR2","volume-title":"Technical report","author":"Y. Ben-Asher","year":"1990","unstructured":"Y. Ben-Asher, D. Peleg, R. Ramaswami, and A. Schuster. The power of reconfiguration. Technical report, The Hebrew University, Jerusalem, 1990."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"A. Bagchi, S. L. Hakimi, J. Mitchem, and E. Schmeichel. Parallel algorithms for gossiping by mail. Inf. Proc. Letters, (34):pp 197\u2013202, 1990.","DOI":"10.1016\/0020-0190(90)90160-Y"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"B. Baker and R. Shostak. Gossips and telephones. Diser. Mathem., (2):pp 191\u2013193, 1972.","DOI":"10.1016\/0012-365X(72)90001-5"},{"issue":"5","key":"8_CR5","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1109\/TC.1987.1676939","volume":"C-36","author":"W. Dally","year":"1987","unstructured":"W. Dally and C. Seitz. Deadlock free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, C-36(5), pages pp 547\u2013553, 1987.","journal-title":"IEEE Transactions on Computers"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"S. Even and B. Monien. On the number of rounds necessary to disseminate information. In: Proc. 1st ACM Symp. on Parallel Algorithms and Architectures, pages pp 318\u2013327, 1989.","DOI":"10.1145\/72935.72969"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"A.M. Farley. Minimum-time line broadcast networks. Networks, (10):pp 59\u201370, 1980.","DOI":"10.1002\/net.3230100106"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"S.M. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, (18):pp 319\u2013349, 1988.","DOI":"10.1002\/net.3230180406"},{"issue":"1990","key":"8_CR9","first-page":"337","volume":"452","author":"J. Hromkovic","year":"1990","unstructured":"J. Hromkovic, C.D. Jeschke, and B. Monien. Optimal algorithms for dissemination of information in some interconnection networks. In: Proc. of 15th MFCS'90, LNCS 452 (1990), pages pp 337\u2013346, 1990.","journal-title":"Proc. of 15th MFCS'90, LNCS"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"A. Hajnal, E.C. Milner, and E. Szemeredi. A cure for the telephone disease. Can. Math. Bull., (15):pp 447\u2013450, 1972.","DOI":"10.4153\/CMB-1972-081-0"},{"issue":"4","key":"8_CR11","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0376-5075(79)90032-1","volume":"3","author":"P. Kermani","year":"1979","unstructured":"P. Kermani and L. Kleinrock. Virtual cut-through: A new computer communications switching technique. Computer Networks, 3(4), pages pp 267\u2013286, 1979.","journal-title":"Computer Networks"}],"container-title":["Lecture Notes in Computer Science","PARLE '92 Parallel Architectures and Languages Europe"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55599-4_84.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:59:57Z","timestamp":1605646797000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55599-4_84"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540555995","9783540472506"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-55599-4_84","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}