{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:37:01Z","timestamp":1743143821984,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540539513"},{"type":"electronic","value":"9783540464785"}],"license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/bfb0032962","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:53:45Z","timestamp":1133416425000},"page":"463-472","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Fault-tolerant gossiping on hypercube multicomputers"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Fraigniaud","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"46_CR1","unstructured":"M. Alam and R. Melhem. How to use an incomplete binary hypercube for fault tolerance. In F. Andre and J. Verjus, editors, Hypercube and Distributed Computers, pages 329\u2013341. North-Holland, 1989."},{"issue":"2","key":"46_CR2","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1109\/71.80143","volume":"1","author":"M. Chen","year":"1990","unstructured":"M. Chen and K. Shin. Depth-first search approach for fault-tolerant routing in hypercube multicomputers. IEEE Trans on Parallel and Distributed Systems, 1(2):152\u2013159, 1990.","journal-title":"IEEE Trans on Parallel and Distributed Systems"},{"key":"46_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0167-8191(90)90032-5","volume":"15","author":"M. Cosnard","year":"1990","unstructured":"M. Cosnard and P. Fraigniaud. Finding the roots of a polynomial on an MIMD multicomputer. Parallel Computing, 15:75\u201385, 1990.","journal-title":"Parallel Computing"},{"issue":"11","key":"46_CR4","first-page":"1586","volume":"58","author":"A.-H. Esfahanian","year":"1989","unstructured":"A.-H. Esfahanian. Generalized measures of fault tolerance with application to n-cube networks. IEEE TC, 58(11):1586\u20131591, 1989.","journal-title":"IEEE TC"},{"key":"46_CR5","series-title":"Research report","volume-title":"Asymptotically optimal broadcasting and total exchange algorithms in faulty hypercube multicomputers","author":"P. Fraigniaud","year":"1989","unstructured":"P. Fraigniaud. Asymptotically optimal broadcasting and total exchange algorithms in faulty hypercube multicomputers. Research report 89-05, LIP-IMAG, ENS Lyon, France, 1989."},{"key":"46_CR6","unstructured":"P. Fraigniaud. Performance analysis of broadcasting in hypercubes. In F. Andre and J. verjus, editors, Hypercubes and Distributed Computers, pages 311\u2013328. North-Holland, 1989."},{"key":"46_CR7","series-title":"Research report","volume-title":"Performance analysis of broadcasting in hypercubes with restricted communication capabilities","author":"P. Fraigniaud","year":"1990","unstructured":"P. Fraigniaud. Performance analysis of broadcasting in hypercubes with restricted communication capabilities. Research report 90-16, LIP-IMAG, ENS Lyon, France, 1990."},{"issue":"8","key":"46_CR8","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1109\/12.30870","volume":"38","author":"A. Ghafoor","year":"1989","unstructured":"A. Ghafoor and P. Sole. Performance of fault-tolerant diagnostics in the hypercube systems. IEEE Trans. on Comp., 38(8):1164\u20131172, 1989.","journal-title":"IEEE Trans. on Comp."},{"key":"46_CR9","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"S. Hedetniemi","year":"1986","unstructured":"S. Hedetniemi, S. Hedetniemi, and A. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18:319\u2013349, 1986.","journal-title":"Networks"},{"issue":"9","key":"46_CR10","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1109\/12.29465","volume":"38","author":"S. Johnsson","year":"1989","unstructured":"S. Johnsson and C.-T. Ho. Optimum broadcasting and personalized communication in hypercubes. IEEE Trans. Comp., 38(9):1249\u20131268, 1989.","journal-title":"IEEE Trans. Comp."},{"key":"46_CR11","volume-title":"Broadcasting in DMA-bound bounded degree graphs","author":"E. Lazard","year":"1990","unstructured":"E. Lazard. Broadcasting in DMA-bound bounded degree graphs. Research report (to appear in Disc. Appl. Math.), LRI, Orsay, France, 1990."},{"key":"46_CR12","unstructured":"C. Li and W. Fuchs. Graceful degradation on hypercube multiprocessors using data redistribution. Proceedings of DMCC5, Charleston, SC, April 8\u201312, 1990."},{"key":"46_CR13","first-page":"376","volume":"8","author":"R. McLeod","year":"1990","unstructured":"R. McLeod and J. Schellenberg. Percolation and anomalous transport as tools in analyzing parallel processing interconnection networks. JPDC, 8:376\u2013387, 1990.","journal-title":"JPDC"},{"issue":"12","key":"46_CR14","doi-asserted-by":"publisher","first-page":"1654","DOI":"10.1109\/12.9743","volume":"37","author":"P. Ramanathan","year":"1988","unstructured":"P. Ramanathan and K. Shin. Reliable broadcast in hypercube multicomputers. IEEE Transactions on Computers, 37(12):1654\u20131657, 1988.","journal-title":"IEEE Transactions on Computers"},{"issue":"7","key":"46_CR15","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1109\/12.2234","volume":"37","author":"Y. Saad","year":"1988","unstructured":"Y. Saad and M. Schultz. Topological properties of hypercubes. IEEE Transaction on Computers, 37(7):867\u2013871, 1988.","journal-title":"IEEE Transaction on Computers"},{"key":"46_CR16","first-page":"115","volume":"6","author":"Y. Saad","year":"1989","unstructured":"Y. Saad and M. Schultz. Data communication in hypercubes. JJPD, 6:115\u2013135, 1989.","journal-title":"JJPD"},{"key":"46_CR17","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0167-8191(89)90024-0","volume":"11","author":"Y. Saad","year":"1989","unstructured":"Y. Saad and M. Schultz. Data communication in parallel architectures. Parallel Computing, 11:131\u2013150, 1989.","journal-title":"Parallel Computing"},{"key":"46_CR18","unstructured":"S. Seidel. Circuit-switched vs. store and forward solutions to symmetric communication problems. HCCA 4, 1989."},{"key":"46_CR19","first-page":"167","volume":"10","author":"Q. Stout","year":"1990","unstructured":"Q. Stout and B. Wagar. Intensive hypercube communication, prearranged communication in link-bound machines. JPDC, 10:167\u2013181, 1990.","journal-title":"JPDC"}],"container-title":["Lecture Notes in Computer Science","Distributed Memory Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032962","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,15]],"date-time":"2021-10-15T11:29:55Z","timestamp":1634297395000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0032962"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540539513","9783540464785"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0032962","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]},"assertion":[{"value":"17 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}