{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T23:40:10Z","timestamp":1734738010742,"version":"3.32.0"},"reference-count":29,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"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":8598,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1990,1]]},"DOI":"10.1016\/0890-5401(90)90035-g","type":"journal-article","created":{"date-parts":[[2004,12,2]],"date-time":"2004-12-02T00:24:20Z","timestamp":1101947060000},"page":"97-118","source":"Crossref","is-referenced-by-count":8,"title":["The power of multimedia: Combining point-to-point and multiaccess networks"],"prefix":"10.1016","volume":"84","author":[{"given":"Yehuda","family":"Afek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gad M.","family":"Landau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(90)90035-G_BIB1","series-title":"Proceedings, 28th IEEE Symp. on Foundation of Computer Science","first-page":"358","article-title":"Applying static network protocols to dynamic networks","author":"Afek","year":"1987"},{"key":"10.1016\/0890-5401(90)90035-G_BIB2","series-title":"Proceedings, Int. Conf. on computer Design","first-page":"640","article-title":"A high speed multiple pipeline function unit as a building block for parallel architectures","author":"Asthana","year":"1987"},{"key":"10.1016\/0890-5401(90)90035-G_BIB3","series-title":"Proceedings, 7th ACM Symp. on Principles of Distributed Computing","first-page":"90","article-title":"The power of multimedia: Combining point-to-point and multiaccess networks","author":"Afek","year":"1988"},{"issue":"No. 4","key":"10.1016\/0890-5401(90)90035-G_BIB4","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1145\/4221.4227","article-title":"Complexity of network synchronization","volume":"32","author":"Awerbuch","year":"1985","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(90)90035-G_BIB5","series-title":"Proceedings, 19th ACM Symp. on Theory of Computing","first-page":"230","article-title":"Linear time distributed algorithms for minimum spanning trees, leader election, counting, and related problems","author":"Awerbuch","year":"1987"},{"year":"1987","author":"Bertsekas","key":"10.1016\/0890-5401(90)90035-G_BIB6"},{"key":"10.1016\/0890-5401(90)90035-G_BIB7","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1109\/TC.1984.1676405","article-title":"Finding maximum on an array processor with a global bus","volume":"C-33","author":"Bokhari","year":"1984","journal-title":"IEEE Trans. Comput."},{"issue":"No. 5","key":"10.1016\/0890-5401(90)90035-G_BIB8","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1109\/TIT.1979.1056093","article-title":"Tree algorithms for packet broadcast channels","volume":"IT-25","author":"Capetanakis","year":"1979","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"No. 1","key":"10.1016\/0890-5401(90)90035-G_BIB9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","article-title":"Distributed snapshots: Determining global states of distributed systems","volume":"3","author":"Chandy","year":"1985","journal-title":"ACM Trans. Comput. Systems"},{"key":"10.1016\/0890-5401(90)90035-G_BIB10","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/S0019-9958(86)80023-7","article-title":"Deterministic coin tossing and accelerating cascades: Micro and macro techniques for designing parallel algorithms","volume":"70","author":"Cole","year":"1986","journal-title":"Inform. Control"},{"key":"10.1016\/0890-5401(90)90035-G_BIB11_1","series-title":"Proceedings, 1st International Conference on Supercomputers","first-page":"112","article-title":"Multipath hierarchies is interconnection networks","author":"Franaszek","year":"1987"},{"key":"10.1016\/0890-5401(90)90035-G_BIB11_2","unstructured":"Gallager, R. G. \u201cDistributed Minimum Hop Algorithms,\u201d Technical Report LIDS-P-1175, MIT Lab for Information and Decision Systems, January."},{"key":"10.1016\/0890-5401(90)90035-G_BIB12","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","article-title":"A distributed algorithm for minimum weight spanning trees","volume":"5","author":"Gallager","year":"1983","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"10.1016\/0890-5401(90)90035-G_BIB13","series-title":"Proceedings, 24th IEEE Symp. on Foundation of Computer Science","first-page":"384","article-title":"Estimating the multiplicity of conflicts in multiple access channels","author":"Greenberg","year":"1983"},{"issue":"No. 3","key":"10.1016\/0890-5401(90)90035-G_BIB14","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01782774","article-title":"Distributed algorithms for constructing the minimum weight spanning trees in broadcast networks","volume":"2","author":"Gold","year":"1987","journal-title":"Distrib. Comput."},{"key":"10.1016\/0890-5401(90)90035-G_BIB15_1","series-title":"Proceedings 19th ACM Symp. on Theory of Computing","first-page":"315","article-title":"Parallel symmetry-breaking in sparse graphs","author":"Goldberg","year":"1987"},{"key":"10.1016\/0890-5401(90)90035-G_BIB15_2","doi-asserted-by":"crossref","unstructured":"Greenberg, A. G. On the time complexity of broadcast communication schemes, in \u201cProceedings, 14th ACM Symp. on Theory of Computing,\u201d May, pp. 354\u2013364.","DOI":"10.1145\/800070.802211"},{"year":"1985","key":"10.1016\/0890-5401(90)90035-G_BIB16"},{"issue":"No. 1","key":"10.1016\/0890-5401(90)90035-G_BIB17","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1109\/12.75144","article-title":"Fishnet: A distributed architecture for high-performance local computer networks","volume":"C-37","author":"Kang","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0890-5401(90)90035-G_BIB18","series-title":"Proceedings, 3rd ACM Symp. on Principles of Distributed Computing","first-page":"199","article-title":"Tight lower and upper bounds for some distributed algorithms for a complete network of processors","author":"Korach","year":"1984"},{"key":"10.1016\/0890-5401(90)90035-G_BIB19","series-title":"Proceedings, American Mathematical Society","first-page":"48","article-title":"On the shortest spanning subtree of a graph and the traveling salesman problem","author":"Kruskal","year":"1956"},{"issue":"No. 7","key":"10.1016\/0890-5401(90)90035-G_BIB20","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1145\/360248.360253","article-title":"Ethernet: Distributed packet switching for local computer networks","volume":"19","author":"Metcalfe","year":"1976","journal-title":"Comm. ACM"},{"article-title":"Unification and Extension of the Multiple Access Communications Problem","year":"1981","author":"Molle","key":"10.1016\/0890-5401(90)90035-G_BIB21"},{"issue":"No. 1","key":"10.1016\/0890-5401(90)90035-G_BIB22","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/TIT.1983.1056620","article-title":"Distributed network protocols","volume":"IT-29","author":"Segall","year":"1983","journal-title":"IEEE Trans. Inform. Theory"},{"year":"1985","author":"Shrira","key":"10.1016\/0890-5401(90)90035-G_BIB23"},{"key":"10.1016\/0890-5401(90)90035-G_BIB24","series-title":"Procedings, 27th IEEE Symp. on Foundation of Computer Science","first-page":"264","article-title":"Meshes with multiple buses","author":"Stout","year":"1986"},{"year":"1981","author":"Tannenbaum","key":"10.1016\/0890-5401(90)90035-G_BIB25"},{"issue":"No. 2","key":"10.1016\/0890-5401(90)90035-G_BIB26","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/0214024","article-title":"Trade-offs between depth and width in parallel computation","volume":"14","author":"Vishkin","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(90)90035-G_BIB27","series-title":"Proceedings, 15th ACM Symp. on Theory of Computing","first-page":"512","article-title":"Loglogarithmic protocols for resolving Ethernet and semaphor protocols","author":"Willard","year":"1984"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090035G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090035G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T23:04:42Z","timestamp":1734735882000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019090035G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["089054019090035G"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(90)90035-g","relation":{},"ISSN":["0890-5401"],"issn-type":[{"type":"print","value":"0890-5401"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}