{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:29:39Z","timestamp":1757626179869,"version":"3.44.0"},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2000,2,10]],"date-time":"2000-02-10T00:00:00Z","timestamp":950140800000},"content-version":"vor","delay-in-days":1501,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1996,1]]},"DOI":"10.1016\/0167-8191(95)00058-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:15:57Z","timestamp":1027588557000},"page":"75-99","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Communication-efficient matrix multiplication on hypercubes"],"prefix":"10.1016","volume":"22","author":[{"given":"Himanshu","family":"Gupta","sequence":"first","affiliation":[]},{"given":"P.","family":"Sadayappan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(95)00058-5_bib1","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":"Berntsen","year":"1989","journal-title":"Parallel Computing"},{"article-title":"A cellular computer to implement the Kaiman Filter Algorithm, Technical report","year":"1969","author":"Cannon","key":"10.1016\/0167-8191(95)00058-5_bib2"},{"key":"10.1016\/0167-8191(95)00058-5_bib3","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/0210049","article-title":"Parallel matrix and graph algorithms","volume":"10","author":"Dekel","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-8191(95)00058-5_bib4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0167-8191(87)90060-3","article-title":"Matrix algorithms on a hypercube I: Matrix multiplication","volume":"4","author":"Fox","year":"1987","journal-title":"Parallel Computing"},{"key":"10.1016\/0167-8191(95)00058-5_bib5","first-page":"115","article-title":"Scalability of parallel algorithms for matrix multiplication","volume":"3","author":"Gupta","year":"1993","journal-title":"Proc. 1993 Int. Confer. on Parallel Processing"},{"year":"1989","author":"Bertsekas","key":"10.1016\/0167-8191(95)00058-5_bib6"},{"issue":"9","key":"10.1016\/0167-8191(95)00058-5_bib7","doi-asserted-by":"crossref","first-page":"1249","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\/0167-8191(95)00058-5_bib8","series-title":"Proc. Sixth Distributed Memory Computing Confer.","first-page":"447","article-title":"Matrix multiplication on hypercubes using full bandwidth and constant storage","author":"Ho","year":"1991"},{"key":"10.1016\/0167-8191(95)00058-5_bib9","article-title":"Parallel linear algebra","volume":"2","author":"Demmel","year":"1993"},{"key":"10.1016\/0167-8191(95)00058-5_bib10","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1145\/322047.322057","article-title":"Some complexity results for matrix computations on parallel processors","volume":"25","author":"Gentleman","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0167-8191(95)00058-5_bib11","series-title":"Proc. Sixth ACM Symp. on Parallel Algorithms and Architectures","first-page":"320","article-title":"Communication efficient matrix multiplication on hypercubes","author":"Gupta","year":"1994"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819195000585?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819195000585?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:27:21Z","timestamp":1757453241000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819195000585"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["0167819195000585"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(95)00058-5","relation":{},"ISSN":["0167-8191"],"issn-type":[{"type":"print","value":"0167-8191"}],"subject":[],"published":{"date-parts":[[1996,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Communication-efficient matrix multiplication on hypercubes","name":"articletitle","label":"Article Title"},{"value":"Parallel Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-8191(95)00058-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}