{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T00:04:36Z","timestamp":1783641876825,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T00:00:00Z","timestamp":1181347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,6,9]]},"DOI":"10.1145\/1248377.1248391","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"61-70","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Optimal sparse matrix dense vector multiplication in the I\/O-model"],"prefix":"10.1145","author":[{"given":"Michael A.","family":"Bender","sequence":"first","affiliation":[{"name":"Stony Brook University, Stony Brook, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gerth St\u00f8lting","family":"Brodal","sequence":"additional","affiliation":[{"name":"University of Aarhus, Aarhus, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rolf","family":"Fagerberg","sequence":"additional","affiliation":[{"name":"University of Southern Denmark, Odense M, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Riko","family":"Jacob","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elias","family":"Vicari","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2007,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"e_1_3_2_1_2_1","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","author":"Arge L.","year":"1999","unstructured":"L. Arge and P. B. Miltersen . On showing lower bounds for external-memory computational geometry problems . In J. M. Abello and J. S. Vitter, editors, External Memory Algorithms , vol. 50 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science , pages 139 -- 159 . AMS Press 1999 . L. Arge and P. B. Miltersen. On showing lower bounds for external-memory computational geometry problems. In J. M. Abello and J. S. Vitter, editors, External Memory Algorithms, vol. 50 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 139--159. AMS Press 1999."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_47"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795283681"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840848"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/365723.365732"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796479"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"R. Hartshorne. Algebraic Geometry. Springer 1977.  R. Hartshorne. Algebraic Geometry. Springer 1977.","DOI":"10.1007\/978-1-4757-3849-0"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802486"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007353"},{"key":"e_1_3_2_1_13_1","volume-title":"NIST sparse BLAS user's guide. Technical report","author":"Remington K.","year":"1996","unstructured":"K. Remington and R. Pozo . NIST sparse BLAS user's guide. Technical report , National Institute of Standards and Technology, Gaithersburg , Maryland , 1996 . K. Remington and R. Pozo. NIST sparse BLAS user's guide. Technical report, National Institute of Standards and Technology, Gaithersburg, Maryland, 1996."},{"key":"e_1_3_2_1_14_1","volume-title":"Computer Science Department","author":"Saad Y.","year":"1994","unstructured":"Y. Saad . Sparsekit: a basic tool kit for sparse matrix computations. Technical report , Computer Science Department , University of Minnesota , June 1994 . Y. Saad. Sparsekit: a basic tool kit for sparse matrix computations. Technical report, Computer Science Department, University of Minnesota, June 1994."},{"key":"e_1_3_2_1_15_1","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","author":"Toledo S.","year":"1999","unstructured":"S. Toledo . A survey of out-of-core algorithms in numerical linear algebra. In J. M. Abello and J. S. Vitter, editors, External Memory Algorithms , vol. 50 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science , pages 161 -- 179 . AMS Press 1999 . S. Toledo. A survey of out-of-core algorithms in numerical linear algebra. In J. M. Abello and J. S. Vitter, editors, External Memory Algorithms, vol. 50 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 161--179. AMS Press 1999."},{"key":"e_1_3_2_1_16_1","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","first-page":"1","volume-title":"External Memory Algorithms","author":"Vitter J. S.","year":"1999","unstructured":"J. S. Vitter . External memory algorithms and data structures. In J. M. Abello and J. S. Vitter, editors, External Memory Algorithms , vol. 50 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science , pages 1 -- 38 . AMS Press 1999 . J. S. Vitter. External memory algorithms and data structures. In J. M. Abello and J. S. Vitter, editors, External Memory Algorithms, vol. 50 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 1--38. AMS Press 1999."},{"key":"e_1_3_2_1_17_1","volume-title":"The Optimized Sparse Kernel Interface","author":"Vudac R.","year":"2006","unstructured":"R. Vudac , J. W. Demmel , and K. A. Yelick . The Optimized Sparse Kernel Interface (OSKI) Library: User's Guide for Version 1.0.1b. Berkeley Benchmarking and OPtimization (BeBOP) Group , March 15 2006 . R. Vudac, J. W. Demmel, and K. A. Yelick. The Optimized Sparse Kernel Interface (OSKI) Library: User's Guide for Version 1.0.1b. Berkeley Benchmarking and OPtimization (BeBOP) Group, March 15 2006."}],"event":{"name":"SPAA07: 19th ACM Symposium on Parallelism in Algorithms and Architectures","location":"San Diego California USA","acronym":"SPAA07","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1248377.1248391","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1248377.1248391","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:51:25Z","timestamp":1750258285000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1248377.1248391"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,9]]},"references-count":15,"alternative-id":["10.1145\/1248377.1248391","10.1145\/1248377"],"URL":"https:\/\/doi.org\/10.1145\/1248377.1248391","relation":{},"subject":[],"published":{"date-parts":[[2007,6,9]]},"assertion":[{"value":"2007-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}