{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:25:25Z","timestamp":1757629525503,"version":"3.44.0"},"reference-count":35,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1992,9]]},"DOI":"10.1016\/0743-7315(92)90040-t","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"15-26","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":12,"title":["Complexity analysis of broadcasting in hypercubes with restricted communication capabilities"],"prefix":"10.1016","volume":"16","author":[{"given":"Pierre","family":"Fraigniaud","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(92)90040-T_BIB1","series-title":"Hypercube and Distributed Computers","first-page":"329","article-title":"How to use an incomplete binary hypercube for fault tolerance","author":"Alam","year":"1989"},{"key":"10.1016\/0743-7315(92)90040-T_BIB2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-8191(88)90113-5","article-title":"Comparing shared and distributed memory computers","volume":"8","author":"Baillie","year":"1988","journal-title":"Parallel Computing."},{"key":"10.1016\/0743-7315(92)90040-T_BIB3","first-page":"307","article-title":"A novel approach to system-level fault tolerance in hypercube multiprocessors","volume":"Vol. 1","author":"Banerjee","year":"1988"},{"key":"10.1016\/0743-7315(92)90040-T_BIB4","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/0743-7315(86)90008-0","article-title":"Strategies for interconnection networks: Some methods from graph theory","volume":"3","author":"Bermond","year":"1986","journal-title":"Parallel Distribut. Comput."},{"key":"10.1016\/0743-7315(92)90040-T_BIB5","series-title":"Hypercube and Distributed Computers","first-page":"279","article-title":"A competitor for the hypercube?","author":"Bermond","year":"1989"},{"article-title":"How to embed trees in hypercubes","year":"1985","author":"Bhatt","key":"10.1016\/0743-7315(92)90040-T_BIB6"},{"key":"10.1016\/0743-7315(92)90040-T_BIB7","series-title":"Hypercube and Distributed Computers","first-page":"93","article-title":"Communication benchmarks for the iPSC\/2","author":"Bomans","year":"1989"},{"issue":"10","key":"10.1016\/0743-7315(92)90040-T_BIB8","doi-asserted-by":"crossref","first-page":"1285","DOI":"10.1109\/12.5991","article-title":"On embedding rectangular grids in hypercubes","volume":"37","author":"Chan","year":"1988","journal-title":"IEEE Trans. Comput."},{"article-title":"Tnode: Document utilisateur","year":"1989","author":"Champion","key":"10.1016\/0743-7315(92)90040-T_BIB9"},{"key":"10.1016\/0743-7315(92)90040-T_BIB10","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0167-8191(90)90032-5","article-title":"Finding the roots of a polynomial on a MIMD multicomputer","volume":"15","author":"Cosnard","year":"1990","journal-title":"Parallel Comput."},{"article-title":"Theoretical aspects of VLSI pin limitations","year":"1989","author":"Cypher","key":"10.1016\/0743-7315(92)90040-T_BIB11"},{"article-title":"A VLSI architecture for concurrent data structure","year":"1980","author":"Dally","key":"10.1016\/0743-7315(92)90040-T_BIB12"},{"key":"10.1016\/0743-7315(92)90040-T_BIB13","article-title":"Mod\u00e9lisation des performances de communication sur le T-node avec le logical system transputer toolset","volume":"7","author":"Desprez","year":"1990","journal-title":"Lett. Transput. Calculat. Distrib."},{"key":"10.1016\/0743-7315(92)90040-T_BIB14","unstructured":"Fraigniaud, P. Asymptotically optimal broadcast and total-exchange algorithms in faulty hypercuube multicomputers. Res. Rep. LIP-IMAG 89-05, ENS Lyon, France, 1989. IEEE Trans. Comput., to appear."},{"issue":"3","key":"10.1016\/0743-7315(92)90040-T_BIB15","doi-asserted-by":"crossref","DOI":"10.1016\/0167-8191(90)90140-5","article-title":"Scattering on a ring of processors","volume":"13","author":"Fraigniaud","year":"1990","journal-title":"Parallel Comput."},{"key":"10.1016\/0743-7315(92)90040-T_BIB16","doi-asserted-by":"crossref","first-page":"1164","DOI":"10.1109\/12.30870","article-title":"Performance of fault-tolerant diagnostics in the hypercube systems","volume":"38","author":"Ghafoor","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(92)90040-T_BIB17","doi-asserted-by":"crossref","DOI":"10.21236\/ADA198695","article-title":"Recursive mesh refinement on hypercubes","author":"Gropp","year":"1988"},{"key":"10.1016\/0743-7315(92)90040-T_BIB18","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0743-7315(86)90017-1","article-title":"The architecture of a homogeneous vector supercomputer","volume":"3","author":"Gustafson","year":"1986","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/0743-7315(92)90040-T_BIB19","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":"1986","journal-title":"Networks"},{"key":"10.1016\/0743-7315(92)90040-T_BIB20","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-8191(89)90095-1","article-title":"Graph theoretic characterization and reliability of the generalized Boolen n-cube network","volume":"12","author":"Huang","year":"1989","journal-title":"Parallel Comput."},{"key":"10.1016\/0743-7315(92)90040-T_BIB21","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1109\/TC.1985.1676569","article-title":"Connectivity of regular directed graphs with small diameters","volume":"34","author":"Imase","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(92)90040-T_BIB22","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0743-7315(87)90002-5","article-title":"Communication efficient basic linear algebra computations on hypercube architectures","volume":"4","author":"Johnsson","year":"1987","journal-title":"J. Parallel Distrib. Comput."},{"issue":"9","key":"10.1016\/0743-7315(92)90040-T_BIB23","doi-asserted-by":"crossref","DOI":"10.1109\/12.29465","article-title":"Optimum broadcasting and personalized communication in hypercubes","volume":"38","author":"Johnsson","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(92)90040-T_BIB24","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/0743-7315(90)90066-X","article-title":"Multicast in hypercube multiprocessors","volume":"8","author":"Lan","year":"1990","journal-title":"J. Parallel Distrib. Comput."},{"issue":"12","key":"10.1016\/0743-7315(92)90040-T_BIB25","doi-asserted-by":"crossref","first-page":"1654","DOI":"10.1109\/12.9743","article-title":"Reliable broadcast in hypercube multicomputers","volume":"37","author":"Ramanathan","year":"1988","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"10.1016\/0743-7315(92)90040-T_BIB26","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/12.2234","article-title":"Topological properties of hypercubes","volume":"37","author":"Saad","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(92)90040-T_BIB27","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0167-8191(89)90024-0","article-title":"Data communication in parallel architectures","volume":"11","author":"Saad","year":"1989","journal-title":"Parallel Comput."},{"issue":"4","key":"10.1016\/0743-7315(92)90040-T_BIB28","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1109\/12.21149","article-title":"The De Bruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI","volume":"38","author":"Samatham","year":"1989","journal-title":"IEEE Trans. Comput."},{"issue":"10","key":"10.1016\/0743-7315(92)90040-T_BIB29","doi-asserted-by":"crossref","first-page":"1284","DOI":"10.1109\/12.5990","article-title":"Minimal mesh embeddings in binary hypercubes","volume":"37","author":"Scott","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(92)90040-T_BIB30","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0743-7315(90)90026-L","article-title":"Intensive hypercube communication, prerranged communication in link-bound machines","volume":"10","author":"Stout","year":"1990","journal-title":"J. Parallel Distrib. Comput."},{"article-title":"Manuel d'utilisation de I'hypercube FPS T20","year":"1988","author":"Tourancheau","key":"10.1016\/0743-7315(92)90040-T_BIB31"},{"key":"10.1016\/0743-7315(92)90040-T_BIB32","first-page":"293","article-title":"On hamiltonian circuits, paths and spanning trees of hypercubes","volume":"89","author":"Tvrdik","year":"1989"},{"key":"10.1016\/0743-7315(92)90040-T_BIB33","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/0743-7315(85)90026-7","article-title":"Embedding of tree networks into hypercubes","volume":"2","author":"Wu","year":"1985","journal-title":"J. Parallel Distrib. Comput."},{"article-title":"The complexity of parallel computation","year":"1979","author":"Wyllie","key":"10.1016\/0743-7315(92)90040-T_BIB34"},{"issue":"9","key":"10.1016\/0743-7315(92)90040-T_BIB35","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1109\/31.7582","article-title":"Graph theoretic reliability analysis for the Boolean n-cube networks","volume":"32","author":"Yang","year":"1988","journal-title":"IEEE Trans. Circuits Systems"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159290040T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159290040T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:28:44Z","timestamp":1757514524000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159290040T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["074373159290040T"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(92)90040-t","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1992,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Complexity analysis of broadcasting in hypercubes with restricted communication capabilities","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(92)90040-T","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1992 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}