{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T21:35:40Z","timestamp":1649021740708},"reference-count":20,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1016\/s0167-8191(96)00064-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:18:22Z","timestamp":1027639102000},"page":"1563-1578","source":"Crossref","is-referenced-by-count":0,"title":["Parallel matrix product algorithm in the de Bruijn network using emulation of meshes of trees"],"prefix":"10.1016","volume":"22","author":[{"given":"Dominique","family":"Barth","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0167-8191(96)00064-6_BIB1","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1142\/S0129626493000150","article-title":"Embedding meshes of d-ary trees into de Bruijn graphs","volume":"3","author":"Barth","year":"1994","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/S0167-8191(96)00064-6_BIB2","article-title":"R\u00e9seaux d'interconnexion: Structures et communications","author":"Barth","year":"1994"},{"key":"10.1016\/S0167-8191(96)00064-6_BIB3","author":"Berge","year":"1971"},{"key":"10.1016\/S0167-8191(96)00064-6_BIB4","series-title":"Proc. of Combinatorial Optimization in Science and Technics","article-title":"Communications in interconnection networks","author":"Bermond","year":"1991"},{"key":"10.1016\/S0167-8191(96)00064-6_BIB5","series-title":"Proc. 1st European Workshop on Hypercube and distributed computers","first-page":"279","article-title":"De Bruijn and Kautz network: A competitor for the Hypercube?","author":"Bermond","year":"1989"},{"key":"10.1016\/S0167-8191(96)00064-6_BIB6","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0167-8191(89)90091-4","article-title":"Communication efficient matrix multiplication on hypercubes","volume":"12","author":"Bernsten","year":"1989","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8191(96)00064-6_BIB7","series-title":"Proc. Agean Workshop on Computing","first-page":"201","article-title":"Embedding grids into hypercube","volume":"vol. 319","author":"Bettayeb","year":"1988"},{"key":"10.1016\/S0167-8191(96)00064-6_BIB8","doi-asserted-by":"crossref","DOI":"10.1006\/jpdc.1996.0044","article-title":"Matrix transpose for block allocations on torus and de Bruijn networks","author":"Calvin","year":"1996","journal-title":"J. Parallel Distributed Computing"},{"key":"10.1016\/S0167-8191(96)00064-6_BIB9","article-title":"A cellular computer to implement the Kalman filter algorithm","author":"Cannon","year":"1969"},{"key":"10.1016\/S0167-8191(96)00064-6_BIB10","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1137\/0220052","article-title":"Embedding of grids into optimal hypercubes","volume":"20","author":"Chan","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-8191(96)00064-6_BIB11","author":"Fox","year":"1988"},{"key":"10.1016\/S0167-8191(96)00064-6_BIB12","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","article-title":"Methods and problems of communication in usual networks","volume":"53","author":"Fraigniaud","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-8191(96)00064-6_BIB13","series-title":"Proc. 1992 Internat. Conf. on Parallel Processing","first-page":"28","article-title":"Embeddings of hypercubes and grids into de Bruijn graphs","author":"Heydemann","year":"1992"},{"key":"10.1016\/S0167-8191(96)00064-6_BIB14","series-title":"Proc. STOC 21th","first-page":"227","article-title":"Work-preserving emulation of fixed-connection networks","author":"Koch","year":"1989"},{"key":"10.1016\/S0167-8191(96)00064-6_BIB15","author":"Leighton","year":"1992"},{"issue":"2","key":"10.1016\/S0167-8191(96)00064-6_BIB16","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF01215349","article-title":"Packet routing and job-shop scheduling in O(congestion + dilation) steps","volume":"14","author":"Leighton","year":"1994","journal-title":"Combinatorica"},{"key":"10.1016\/S0167-8191(96)00064-6_BIB17","article-title":"Combinatorics on Words","volume":"Vol. 17","author":"Lothaire","year":"1983"},{"key":"10.1016\/S0167-8191(96)00064-6_BIB18","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/978-3-7091-9076-0_13","article-title":"Embedding one interconnection network in another","volume":"7","author":"Monien","year":"1990","journal-title":"Computing Suppl."},{"key":"10.1016\/S0167-8191(96)00064-6_BIB19","author":"de Rumeur","year":"1994"},{"issue":"4","key":"10.1016\/S0167-8191(96)00064-6_BIB20","doi-asserted-by":"crossref","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."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819196000646?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819196000646?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T07:20:37Z","timestamp":1555572037000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819196000646"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":20,"journal-issue":{"issue":"12","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S0167819196000646"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(96)00064-6","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}