{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T16:00:36Z","timestamp":1726416036485},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6894,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1016\/0166-218x(94)90179-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"55-78","source":"Crossref","is-referenced-by-count":12,"title":["Optimal algorithms for dissemination of information in generalized communication modes"],"prefix":"10.1016","volume":"53","author":[{"given":"R.","family":"Feldmann","sequence":"first","affiliation":[]},{"given":"J.","family":"Hromkovi\u010d","sequence":"additional","affiliation":[]},{"given":"S.","family":"Madhavapeddy","sequence":"additional","affiliation":[]},{"given":"B.","family":"Monien","sequence":"additional","affiliation":[]},{"given":"P.","family":"Mysliwietz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90179-1_BIB1","first-page":"191","article-title":"Gossips and telephones","volume":"2","author":"Baker","year":"1972","journal-title":"Dissertationes Math."},{"key":"10.1016\/0166-218X(94)90179-1_BIB2","doi-asserted-by":"crossref","first-page":"447","DOI":"10.4153\/CMB-1972-081-0","article-title":"A cure for the telephone disease","volume":"15","author":"Hajnal","year":"1972","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0166-218X(94)90179-1_BIB3","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","article-title":"A survey of gossiping and broadcasting in communication networks","volume":"18","author":"Hedetniemi","year":"1988","journal-title":"Networks"},{"key":"10.1016\/0166-218X(94)90179-1_BIB4","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1145\/72935.72969","article-title":"On the number of rounds necessary to disseminate information","author":"Even","year":"1989","journal-title":"Proceedings of first ACM Symposium on Parallel Algorithms and Architectures"},{"key":"10.1016\/0166-218X(94)90179-1_BIB5","series-title":"Proceedings of fifteenth MFCS'90","first-page":"337","article-title":"Optimal algorithms for dissemination of information in some interconnection networks","volume":"452","author":"Hromkovic","year":"1990"},{"key":"10.1016\/0166-218X(94)90179-1_BIB6","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0020-0190(90)90160-Y","article-title":"Parallel algorithms for gossiping by mail","volume":"34","author":"Bagchi","year":"1990","journal-title":"Inform. Process Lett."},{"year":"1990","series-title":"The power of reconfiguration","author":"Ben-Asher","key":"10.1016\/0166-218X(94)90179-1_BIB7"},{"key":"10.1016\/0166-218X(94)90179-1_BIB8","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230100106","article-title":"Minimum-time line broadcast networks","volume":"10","author":"Farley","year":"1980","journal-title":"Networks"},{"issue":"5","key":"10.1016\/0166-218X(94)90179-1_BIB9","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1109\/TC.1987.1676939","article-title":"Deadlock free message routing in multiprocessor interconnection networks","volume":"C-36","author":"Dally","year":"1987","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/0166-218X(94)90179-1_BIB10","first-page":"267","article-title":"Virtual cut-through: A new computer communications switching technique","volume":"3","author":"Kermani","year":"1979","journal-title":"Comput. Networks"},{"key":"10.1016\/0166-218X(94)90179-1_BIB11","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1145\/97444.97459","article-title":"Fast algorithms for bit-serial routing on a hypercube","author":"Aiello","year":"1990","journal-title":"Proceedings of the second ACM Symposium on Parallel Algorithms and Architectures"},{"key":"10.1016\/0166-218X(94)90179-1_BIB12","series-title":"Proceedings of the seventeenth MFCS'92","first-page":"246","article-title":"The shuffle exchange network has a hamiltonian path","volume":"629","author":"Feldmann","year":"1992"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94901791?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94901791?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:28:30Z","timestamp":1555122510000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94901791"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["0166218X94901791"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90179-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}