{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T06:32:13Z","timestamp":1790145133560,"version":"4.0.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,11,15]],"date-time":"2015-11-15T00:00:00Z","timestamp":1447545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100001082","name":"Camille and Henry Dreyfus Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100001082","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ACI-1450262"],"award-info":[{"award-number":["ACI-1450262"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,11,15]]},"DOI":"10.1145\/2833179.2833186","type":"proceedings-article","created":{"date-parts":[[2015,11,18]],"date-time":"2015-11-18T08:42:32Z","timestamp":1447836152000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Scalable task-based algorithm for multiplication of block-rank-sparse matrices"],"prefix":"10.1145","author":[{"given":"Justus A.","family":"Calvin","sequence":"first","affiliation":[{"name":"Virginia Tech, Blacksburg, VA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cannada A.","family":"Lewis","sequence":"additional","affiliation":[{"name":"Virginia Tech, Blacksburg, VA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Edward F.","family":"Valeev","sequence":"additional","affiliation":[{"name":"Virginia Tech, Blacksburg, VA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,11,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.395.0575"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.386.0673"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486196"},{"key":"e_1_3_2_1_4_1","volume-title":"Designing Communication-efficient Matrix Algorithms in Distributed-memory Cilk","author":"Baruch E.","year":"2001","unstructured":"Baruch , E. Designing Communication-efficient Matrix Algorithms in Distributed-memory Cilk . Tel-Aviv University , 2001 . Baruch, E. Designing Communication-efficient Matrix Algorithms in Distributed-memory Cilk. Tel-Aviv University, 2001."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(89)90091-4"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/265932"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.299"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2008.45"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/110848244"},{"key":"e_1_3_2_1_10_1","volume-title":"Tiledarray: A massively-parallel, block-sparse tensor library written in C++. https:\/\/github.com\/valeevgroup\/tiledarray\/","author":"Calvin J. A.","year":"2015","unstructured":"Calvin , J. A. , and Valeev , E. F . Tiledarray: A massively-parallel, block-sparse tensor library written in C++. https:\/\/github.com\/valeevgroup\/tiledarray\/ , 2015 . Calvin, J. A., and Valeev, E. F. Tiledarray: A massively-parallel, block-sparse tensor library written in C++. https:\/\/github.com\/valeevgroup\/tiledarray\/, 2015."},{"key":"e_1_3_2_1_12_1","first-page":"310","volume-title":"IPPS-97 (Apr.","author":"Choi J.","year":"1997","unstructured":"Choi , J. A fast scalable universal matrix multiplication algorithm on distributed-memory concurrent computers . In IPPS-97 (Apr. 1997 ), IEEE Comput. Soc. Press , pp. 310 -- 314 . Choi, J. A fast scalable universal matrix multiplication algorithm on distributed-memory concurrent computers. In IPPS-97 (Apr. 1997), IEEE Comput. Soc. Press, pp. 310--314."},{"key":"e_1_3_2_1_13_1","first-page":"8","article-title":"A new parallel matrix multiplication algorithm on distributed-memory concurrent computers","volume":"10","author":"Choi J","year":"1998","unstructured":"Choi , J . A new parallel matrix multiplication algorithm on distributed-memory concurrent computers . Concurr. Comput. 10 , 8 ( July 1998 ), 655--670. Choi, J. A new parallel matrix multiplication algorithm on distributed-memory concurrent computers. Concurr. Comput. 10, 8 (July 1998), 655--670.","journal-title":"Concurr. Comput."},{"key":"e_1_3_2_1_14_1","first-page":"7","article-title":"Pumma: Parallel universal matrix multiplication algorithms on distributed memory concurrent computers","volume":"6","author":"Choi J.","year":"1994","unstructured":"Choi , J. , Walker , D. W. , and Dongarra , J. J . Pumma: Parallel universal matrix multiplication algorithms on distributed memory concurrent computers . Concurr. Comput. 6 , 7 ( Oct. 1994 ), 543--570. Choi, J., Walker, D. W., and Dongarra, J. J. Pumma: Parallel universal matrix multiplication algorithms on distributed memory concurrent computers. Concurr. Comput. 6, 7 (Oct. 1994), 543--570.","journal-title":"Concurr. Comput."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(87)90060-3"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/876880.879566"},{"key":"e_1_3_2_1_17_1","volume-title":"MADNESS project hosted on Github. https:\/\/github.com\/m-a-d-n-e-s-s\/madness","author":"Harrison R.","year":"2015","unstructured":"Harrison , R. , and MADNESS Community . MADNESS project hosted on Github. https:\/\/github.com\/m-a-d-n-e-s-s\/madness , 2015 . Harrison, R., and MADNESS Community. MADNESS project hosted on Github. https:\/\/github.com\/m-a-d-n-e-s-s\/madness, 2015."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019150005407"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1021\/jp034596z"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.4917519"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1362622.1362664"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.2709881"},{"key":"e_1_3_2_1_23_1","unstructured":"Lewis C. A. Calvin J. A. and Valeev E. F. Clustered Low-Rank Tensor Format: Introduction and Application to Fast Construction of Hartree-Fock Exchange. arXiv:1510.01156. submitted to J. Chem. Phys.  Lewis C. A. Calvin J. A. and Valeev E. F. Clustered Low-Rank Tensor Format: Introduction and Application to Fast Construction of Hartree-Fock Exchange. arXiv:1510.01156. submitted to J. Chem. Phys."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.3086717"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevB.70.193102"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595296732"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2014.35"},{"key":"e_1_3_2_1_28_1","volume-title":"Scalable universal matrix multiplication algorithms: 2D and 3D variations on a theme. submitted to ACM Transactions on Mathematical Software","author":"Schatz M. D.","year":"2012","unstructured":"Schatz , M. D. , Poulson , J. , and van de Geijn , R. A. Scalable universal matrix multiplication algorithms: 2D and 3D variations on a theme. submitted to ACM Transactions on Mathematical Software ( 2012 ), 1--30. Schatz, M. D., Poulson, J., and van de Geijn, R. A. Scalable universal matrix multiplication algorithms: 2D and 3D variations on a theme. submitted to ACM Transactions on Mathematical Software (2012), 1--30."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063487"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/978-3-642-23397-5_10","volume-title":"Euro-Par 2011 Parallel Processing","author":"Solomonik E.","year":"2011","unstructured":"Solomonik , E. , and Demmel , J . Communication-optimal parallel 2.5D matrix multiplication and LU factorization algorithms . In Euro-Par 2011 Parallel Processing . Springer Berlin Heidelberg , 2011 , pp. 90 -- 109 . Solomonik, E., and Demmel, J. Communication-optimal parallel 2.5D matrix multiplication and LU factorization algorithms. In Euro-Par 2011 Parallel Processing. Springer Berlin Heidelberg, 2011, pp. 90--109."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.06.002"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"e_1_3_2_1_35_1","volume-title":"Modern Quantum Chemistry: Introduction to Advanced Electronic Structure Theory","author":"Szabo A.","year":"1989","unstructured":"Szabo , A. , and Ostlund , N. S . Modern Quantum Chemistry: Introduction to Advanced Electronic Structure Theory . McGraw-Hill , New York , 1989 . Szabo, A., and Ostlund, N. S. Modern Quantum Chemistry: Introduction to Advanced Electronic Structure Theory. McGraw-Hill, New York, 1989."},{"key":"e_1_3_2_1_36_1","first-page":"4","article-title":"SUMMA: Scalable universal matrix multiplication algorithm","volume":"9","author":"van de Geijn R. A.","year":"1997","unstructured":"van de Geijn , R. A. , and Watts , J . SUMMA: Scalable universal matrix multiplication algorithm . Concurr. Comput. 9 , 4 ( 1997 ), 255--274. van de Geijn, R. A., and Watts, J. SUMMA: Scalable universal matrix multiplication algorithm. Concurr. Comput. 9, 4 (1997), 255--274.","journal-title":"Concurr. Comput."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10092-005-0107-z"}],"event":{"name":"SC15: The International Conference for High Performance Computing, Networking, Storage and Analysis","location":"Austin Texas","acronym":"SC15","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGARCH ACM Special Interest Group on Computer Architecture","IEEE-CS\\DATC IEEE Computer Society"]},"container-title":["Proceedings of the 5th Workshop on Irregular Applications: Architectures and Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2833179.2833186","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2833179.2833186","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:07:21Z","timestamp":1750208841000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2833179.2833186"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,15]]},"references-count":34,"alternative-id":["10.1145\/2833179.2833186","10.1145\/2833179"],"URL":"https:\/\/doi.org\/10.1145\/2833179.2833186","relation":{},"subject":[],"published":{"date-parts":[[2015,11,15]]},"assertion":[{"value":"2015-11-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}