{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:24:59Z","timestamp":1725456299441},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540587125"},{"type":"electronic","value":"9783540490500"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/bfb0030137","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:19:55Z","timestamp":1133417995000},"page":"67-79","source":"Crossref","is-referenced-by-count":1,"title":["A transform approach to fast matrix multiplication"],"prefix":"10.1007","author":[{"given":"Pavel","family":"Berkhin","sequence":"first","affiliation":[]},{"given":"John","family":"Brown","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Strassen","year":"1969","unstructured":"V. Strassen (1969), Gaussian elimination is not optimal, Numer. Math, v.13, pp. 354\u2013356.","journal-title":"Numer. Math"},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1109\/TC.1968.227420","volume":"C-18","author":"S. Winograd","year":"1968","unstructured":"S. Winograd (1968), A new algorithm for inner product, IEEE Trans, on Computing, v. C-18. pp. 693\u2013694.","journal-title":"IEEE Trans, on Computing"},{"issue":"No.3","key":"8_CR3","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1137\/1026076","volume":"26","author":"V. Pan","year":"1984","unstructured":"V. Pan (1984), How can we speed up matrix multiplication?, SIAM Review, v.26, No.3, pp. 393\u2013415.","journal-title":"SIAM Review"},{"issue":"No.2","key":"8_CR4","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1137\/0209027","volume":"9","author":"V. Pan","year":"1980","unstructured":"V. Pan (1980), New fast algorithms for matrix operations, SIAM J. Comput., v.9, No. 2, pp. 321\u2013342.","journal-title":"SIAM J. Comput."},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"D. Coppersmith, S. Winograd (1990), Matrix multiplication via arithmetic progression, J. Symbolic Comp., v.9, pp. 251\u2013280.","journal-title":"J. Symbolic Comp."},{"issue":"No.3","key":"8_CR6","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1137\/0909040","volume":"9","author":"D. Bailey","year":"1988","unstructured":"David Bailey (1988), Extra high speed matrix multiplication on the CRAY-2, SIAM J. Sci.Stat. Comput., 9, No.3, pp. 603\u2013607.","journal-title":"SIAM J. Sci.Stat. Comput."},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF00129836","volume":"4","author":"D.H. Bailey","year":"1990","unstructured":"D.H. Bailey, K. Lee, H.D. Simon (1990), Using Strassen's algorithn to accelerate the solution of linear systems. J. Supercomp., v. 4, pp.357\u2013371.","journal-title":"J. Supercomp."},{"unstructured":"P. Bjorstad, F. Manne, T. Sorevik, M Vajtersic (1991), Efficient matrix multiplication on SIMD computers, Institutt for Informatikk, Univ. of Bergen, Report No. 53.","key":"8_CR8"},{"doi-asserted-by":"crossref","unstructured":"G. Golub, J. Ortega (1993), Scientific Computing. An Introduction with Parallel Computing. Academic Press.","key":"8_CR9","DOI":"10.1016\/B978-0-12-289253-0.50005-1"},{"unstructured":"S.M. Balle, P.C. Hansen, N.J. Higham (1993), A Strassen-Type Matrix Inversion Algorithm for the Connection Machine, Report UNIC-93-11.","key":"8_CR10"},{"issue":"No.3","key":"8_CR11","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1137\/0204009","volume":"4","author":"W. Miller","year":"1975","unstructured":"W. Miller (1975), Computational complexity and numerical stability, SIAM J. Comput, v. 4, No.3, pp. 97\u2013107.","journal-title":"SIAM J. Comput"},{"key":"8_CR12","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1145\/98267.98290","volume":"16","author":"N.J. Higham","year":"1990","unstructured":"N.J. Higham (1990), Exploiting fast matrix multiplication within the level 3 BLAS, ACM Trans. Math. Software, v. 16, pp.352\u2013368.","journal-title":"ACM Trans. Math. Software"}],"container-title":["Lecture Notes in Computer Science","Parallel Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030137","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:21:26Z","timestamp":1586593286000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540587125","9783540490500"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0030137","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}