{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T12:01:19Z","timestamp":1773316879600,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,8,26]],"date-time":"2010-08-26T00:00:00Z","timestamp":1282780800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s00224-010-9285-4","type":"journal-article","created":{"date-parts":[[2010,8,25]],"date-time":"2010-08-25T04:16:16Z","timestamp":1282709776000},"page":"934-962","source":"Crossref","is-referenced-by-count":19,"title":["Optimal Sparse Matrix Dense Vector Multiplication in\u00a0the I\/O-Model"],"prefix":"10.1007","volume":"47","author":[{"given":"Michael A.","family":"Bender","sequence":"first","affiliation":[]},{"given":"Gerth St\u00f8lting","family":"Brodal","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Fagerberg","sequence":"additional","affiliation":[]},{"given":"Riko","family":"Jacob","sequence":"additional","affiliation":[]},{"given":"Elias","family":"Vicari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,8,26]]},"reference":[{"issue":"9","key":"9285_CR1","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Commun. ACM 31(9), 1116\u20131127 (1988)","journal-title":"Commun. ACM"},{"key":"9285_CR2","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1090\/dimacs\/050\/08","volume-title":"External Memory Algorithms and Visualization","author":"L. Arge","year":"1999","unstructured":"Arge, L., Miltersen, P.B.: On showing lower bounds for external-memory computational geometry problems. In: Abello, J.M., Vitter, J.S. (eds.) External Memory Algorithms and Visualization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 50, pp. 139\u2013159. American Mathematical Society, Providence (1999)"},{"key":"9285_CR3","first-page":"307","volume-title":"Proc. 35th Annual ACM Symposium on Theory of Computing (STOC)","author":"G.S. Brodal","year":"2003","unstructured":"Brodal, G.S., Fagerberg, R.: On the limits of cache-obliviousness. In: Proc. 35th Annual ACM Symposium on Theory of Computing (STOC), pp.\u00a0307\u2013315. ACM, San Diego (2003)"},{"key":"9285_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1007\/11523468_47","volume-title":"Proc. 32nd International Colloquium on Automata, Languages, and Programming","author":"G.S. Brodal","year":"2005","unstructured":"Brodal, G.S., Fagerberg, R., Moruz, G.: Cache-aware and cache-oblivious adaptive sorting. In: Proc. 32nd International Colloquium on Automata, Languages, and Programming. Lecture Notes in Computer Science, vol. 3580, pp. 576\u2013588. Springer, Berlin (2005)"},{"issue":"1","key":"9285_CR5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1137\/S0097539795283681","volume":"28","author":"T.H. Cormen","year":"1999","unstructured":"Cormen, T.H., Sundquist, T., Wisniewski, L.F.: Asymptotically tight bounds for performing BMMC permutations on parallel disk systems. SIAM J. Comput. 28(1), 105\u2013136 (1999)","journal-title":"SIAM J. Comput."},{"key":"9285_CR6","doi-asserted-by":"crossref","unstructured":"Demmel, J., Dongarra, J., Eijkhout, V., Fuentes, E., Antoine Petitet, R.V., Whaley, R.C., Yelick, K.: Self-adapting linear algebra algorithms and software. Proc. IEEE 93(2) (2005). Special Issue on Program Generation, Optimization, and Adaptation","DOI":"10.1109\/JPROC.2004.840848"},{"issue":"4","key":"9285_CR7","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1145\/365723.365732","volume":"26","author":"S. Filippone","year":"2000","unstructured":"Filippone, S., Colajanni, M.: PSBLAS: a library for parallel linear algebra computation on sparse matrices. ACM Trans. Math. Softw. 26(4), 527\u2013550 (2000)","journal-title":"ACM Trans. Math. Softw."},{"key":"9285_CR8","first-page":"285","volume-title":"Proc. 40th Annual Symposium on Foundations of Computer Science (FOCS)","author":"M. Frigo","year":"1999","unstructured":"Frigo, M., Leiserson, C.E., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. In: Proc. 40th Annual Symposium on Foundations of Computer Science (FOCS), pp.\u00a0285\u2013297. IEEE Computer Society, New York (1999)"},{"key":"9285_CR9","first-page":"326","volume-title":"Proc. 13th Annual ACM Symposium on Theory of Computing (STOC)","author":"J.-W. Hong","year":"1981","unstructured":"Hong, J.-W., Kung, H.T.: I\/O complexity: the red-blue pebble game. In: Proc. 13th Annual ACM Symposium on Theory of Computing (STOC), pp.\u00a0326\u2013333. ACM, New York (1981)"},{"key":"9285_CR10","unstructured":"Im, E.J.: Optimizing the performance of sparse matrix-vector multiplication. PhD thesis, University of California, Berkeley, May 2000"},{"key":"9285_CR11","first-page":"633","volume-title":"Proc. 36th Annual ACM Symposium on Theory of Computing (STOC)","author":"R. Raz","year":"2004","unstructured":"Raz, R.: Multi-linear formulas for permanent and determinant are of super-polynomial size. In: Proc. 36th Annual ACM Symposium on Theory of Computing (STOC), Chicago, IL, USA, pp.\u00a0633\u2013641. ACM, New York (2004)"},{"key":"9285_CR12","unstructured":"Remington, K., Pozo, R.: NIST sparse BLAS user\u2019s guide. Technical report, National Institute of Standards and Technology, Gaithersburg, MD (1996)"},{"key":"9285_CR13","unstructured":"Saad, Y.: Sparsekit: a basic tool kit for sparse matrix computations. Technical report, Computer Science Department, University of Minnesota, June 1994"},{"issue":"4","key":"9285_CR14","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Strassen","year":"1969","unstructured":"Strassen, V.: Gaussian elimination is not optimal. Numer. Math. 13(4), 354\u2013356 (1969)","journal-title":"Numer. Math."},{"key":"9285_CR15","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1090\/dimacs\/050\/09","volume-title":"External Memory Algorithms and Visualization","author":"S. Toledo","year":"1999","unstructured":"Toledo, S.: A survey of out-of-core algorithms in numerical linear algebra. In: Abello, J.M., Vitter, J.S. (eds.) External Memory Algorithms and Visualization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 50, pp. 161\u2013179. American Mathematical Society, Providence (1999)"},{"key":"9285_CR16","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","first-page":"1","volume-title":"External Memory Algorithms and Visualization","author":"J.S. Vitter","year":"1999","unstructured":"Vitter, J.S.: External memory algorithms and data structures. In: Abello, J.M., Vitter, J.S. (eds.) External Memory Algorithms and Visualization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 50 pp.\u00a01\u201338. American Mathematical Society, Providence (1999)"},{"key":"9285_CR17","unstructured":"Vudac, R., Demmel, J.W., Yelick, K.A.: The Optimized Sparse Kernel Interface (OSKI) library: user\u2019s guide for version 1.0.1b. Berkeley Benchmarking and OPtimization (BeBOP) Group, 15 March 2006"},{"key":"9285_CR18","unstructured":"Vuduc, R.W.: Automatic performance tuning of sparse matrix kernels. PhD thesis, University of California, Berkeley, Fall 2003"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-010-9285-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-010-9285-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-010-9285-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T03:58:05Z","timestamp":1559447885000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-010-9285-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,26]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["9285"],"URL":"https:\/\/doi.org\/10.1007\/s00224-010-9285-4","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,26]]}}}