{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:41Z","timestamp":1759063481464},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"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":4886,"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":[[2000,3]]},"DOI":"10.1016\/s0166-218x(99)00155-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:12:16Z","timestamp":1027584736000},"page":"1-15","source":"Crossref","is-referenced-by-count":22,"title":["Optimal multiple message broadcasting in telephone-like communication systems"],"prefix":"10.1016","volume":"100","author":[{"given":"Amotz","family":"Bar-Noy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shlomo","family":"Kipnis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00155-9_BIB1","unstructured":"A. Bar-Noy, C.T. Ho, Broadcasting multiple messages in the multi-port model, Proceedings of the 10th International Parallel Processing Symposium, IPPS 96."},{"issue":"5","key":"10.1016\/S0166-218X(99)00155-9_BIB2","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/BF01184933","article-title":"Designing broadcasting algorithms in the postal model for message-passing systems","volume":"27","author":"Bar-Noy","year":"1994","journal-title":"Math. Systems Theor."},{"key":"10.1016\/S0166-218X(99)00155-9_BIB3","doi-asserted-by":"crossref","unstructured":"A. Bar-Noy, S. Kipnis, Multiple message broadcasting in the postal model, Proceedings of the seventh International Parallel Processing Symposium, IEEE, April 1993, pp. 463\u2013470.","DOI":"10.1109\/IPPS.1993.262831"},{"issue":"2","key":"10.1016\/S0166-218X(99)00155-9_BIB4","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0166-218X(94)90001-9","article-title":"Broadcasting multiple messages optimally in simultaneous send\/receive systems","volume":"55","author":"Bar-Noy","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00155-9_BIB5","unstructured":"J. Bruck, R. Cypher, L. Gravano, A. Ho, C.T. Ho, S. Kipnis, S. Konstantinidou, M. Snir, E. Upfal, Survey of routing issues for the Vulcan parallel computer, IBM Research Report, RJ-8839, June 1992."},{"key":"10.1016\/S0166-218X(99)00155-9_BIB6","doi-asserted-by":"crossref","unstructured":"J. Bruck, R. Cypher, C.T. Ho, Multiple message broadcasting with generalized Fibonacci trees, Proceedings of the fourth Symposium on Parallel and Distributed Processing, IEEE, December 1992, pp. 424\u2013431.","DOI":"10.1109\/SPDP.1992.242714"},{"issue":"2","key":"10.1016\/S0166-218X(99)00155-9_BIB7","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1002\/dac.4520010208","article-title":"PARIS: an approach to integrated high-speed private networks","volume":"1","author":"Cidon","year":"1988","journal-title":"Int. J. Digital Analog Cabled Systems"},{"key":"10.1016\/S0166-218X(99)00155-9_BIB8","doi-asserted-by":"crossref","unstructured":"D. Clark, B. Davie, D. Farber, I. Gopal, B. Kadaba, D. Sincoskie, J. Smith, D. Tennenhouse, The AURORA gigabit testbed, Computer Networks and ISDN, 1991.","DOI":"10.1109\/INFCOM.1992.263450"},{"key":"10.1016\/S0166-218X(99)00155-9_BIB9","unstructured":"E. Cockayne, A. Thomason, Optimal multi-message broadcasting in complete graphs, Proceedings of the 11th SE Conference on Combinatorics, Graph Theory, and Computing, 1980, pp. 181\u2013199."},{"issue":"2","key":"10.1016\/S0166-218X(99)00155-9_BIB10","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1137\/0139032","article-title":"Broadcast time in communication networks","volume":"39","author":"Farley","year":"1980","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0166-218X(99)00155-9_BIB11","unstructured":"W. Groscup, The Intel Paragon XP\/S supercomputer, Proceedings of the fifth ECMWF Workshop on the use of Parallel Processors in Meteorology, 1993, pp. 173\u2013187."},{"issue":"4","key":"10.1016\/S0166-218X(99)00155-9_BIB12","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"},{"issue":"11","key":"10.1016\/S0166-218X(99)00155-9_BIB13","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/163359.163361","article-title":"The CM 5 connection machine: a scalable supercomputer","volume":"36","author":"Hillis","year":"1993","journal-title":"Commun. ACM"},{"key":"10.1016\/S0166-218X(99)00155-9_BIB14","unstructured":"C.T. Ho, Optimal multiple messages broadcasting in the send\/receive model, personal communication, December 1993."},{"issue":"2","key":"10.1016\/S0166-218X(99)00155-9_BIB15","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/0743-7315(91)90094-P","article-title":"Optimal broadcasting on SIMD hypercubes without indirect addressing capability","volume":"13","author":"Ho","year":"1991","journal-title":"J. Parallel Distri. Comput."},{"key":"10.1016\/S0166-218X(99)00155-9_BIB16","doi-asserted-by":"crossref","unstructured":"R. Karp, A. Sahay, E. Santos, K.E. Schauser, Optimal broadcast and summation in the LogP model, Proceedings of the fifth Annual Symposium on Parallel Algorithms and Architectures, ACM, June 1993, pp. 142\u2013153.","DOI":"10.1145\/165231.165250"},{"key":"10.1016\/S0166-218X(99)00155-9_BIB17","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/net.3230260409","article-title":"Multiple message broadcasting in Communication Networks","volume":"26","author":"Kwon","year":"1995","journal-title":"Networks"},{"issue":"4","key":"10.1016\/S0166-218X(99)00155-9_BIB18","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/0167-8191(94)90026-4","article-title":"Efficient parallel communication with the nCUBE 2S processor","volume":"20","author":"Schmidt","year":"1994","journal-title":"Parallel Comput."},{"key":"10.1016\/S0166-218X(99)00155-9_BIB19","doi-asserted-by":"crossref","unstructured":"C.B. Stunkel, D.G. Shea, B. Abali, M.M. Denneau, P.H. Hochschild, D.J. Joseph, B.J. Nathanson, M. Tsao, P.R. Varker, Architecture and implementation of Vulcan, Proceedings of the eighth International Parallel Processing Symposium, IEEE, April 1994, pp. 268\u2013274.","DOI":"10.1109\/IPPS.1994.288290"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001559?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001559?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T05:03:09Z","timestamp":1578459789000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99001559"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["S0166218X99001559"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00155-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}