{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T17:51:50Z","timestamp":1772905910387,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"DOE U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-SC0022158,DE-AC02-05CH11231"],"award-info":[{"award-number":["DE-SC0022158,DE-AC02-05CH11231"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2004235,2004763"],"award-info":[{"award-number":["2004235,2004763"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3626183.3659980","type":"proceedings-article","created":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T18:23:04Z","timestamp":1717525384000},"page":"155-168","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Distributed-Memory Randomized Algorithms for Sparse Tensor CP Decomposition"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0483-9578","authenticated-orcid":false,"given":"Vivek","family":"Bharadwaj","sequence":"first","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4477-481X","authenticated-orcid":false,"given":"Osman Asif","family":"Malik","sequence":"additional","affiliation":[{"name":"Encube Technologies, Stockholm, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1461-6458","authenticated-orcid":false,"given":"Riley","family":"Murray","sequence":"additional","affiliation":[{"name":"Sandia National Laboratories, Albuquerque, NM, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7253-9038","authenticated-orcid":false,"given":"Ayd\u0131n","family":"Bulu\u00e7","sequence":"additional","affiliation":[{"name":"Lawrence Berkeley National Laboratory, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0550-5476","authenticated-orcid":false,"given":"James","family":"Demmel","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"FROSTT: The Formidable Repository of Open Sparse Tensors and Tools","author":"Smith S.","year":"2017","unstructured":"S. Smith, J. W. Choi, J. Li, R. Vuduc, J. Park, X. Liu, and G. Karypis, \"FROSTT: The Formidable Repository of Open Sparse Tensors and Tools,\" 2017. [Online]. Available: http:\/\/frostt.io\/"},{"key":"e_1_3_2_1_2_1","first-page":"1","volume-title":"V. S. Tseng, T. B. Ho, Z.-H. Zhou, A. L. P. Chen, and H.-Y","author":"Mao H.-H.","year":"2014","unstructured":"H.-H. Mao, C.-J. Wu, E. E. Papalexakis, C. Faloutsos, K.-C. Lee, and T.-C. Kao, \"MalSpot: Multi2 Malicious Network Behavior Patterns Analysis,\" in Advances in Knowledge Discovery and Data Mining, ser. Lecture Notes in Computer Science, V. S. Tseng, T. B. Ho, Z.-H. Zhou, A. L. P. Chen, and H.-Y. Kao, Eds. Cham: Springer International Publishing, 2014, pp. 1--14."},{"key":"e_1_3_2_1_3_1","first-page":"5185","article-title":"TuckER: Tensor Factorization for Knowledge Graph Completion,\" in Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). Hong Kong, China","author":"Balazevic I.","year":"2019","unstructured":"I. Balazevic, C. Allen, and T. Hospedales, \"TuckER: Tensor Factorization for Knowledge Graph Completion,\" in Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). Hong Kong, China: Association for Computational Linguistics, Nov. 2019, pp. 5185--5194.","journal-title":"Association for Computational Linguistics"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btm134"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1203626"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/21M1441754"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975321.10"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"e_1_3_2_1_9_1","volume-title":"Eds.","volume":"27","author":"Choi J. H.","year":"2014","unstructured":"J. H. Choi and S. Vishwanathan, \"DFacTo: Distributed Factorization of Tensors,\" in Advances in Neural Information Processing Systems, Z. Ghahramani, M.Welling, C. Cortes, N. Lawrence, and K. Q. Weinberger, Eds., vol. 27. Curran Associates, Inc., 2014."},{"key":"e_1_3_2_1_10_1","first-page":"61","volume-title":"May 2015","author":"Smith S.","year":"2075","unstructured":"S. Smith, N. Ravindran, N. D. Sidiropoulos, and G. Karypis, \"SPLATT: Efficient and Parallel Sparse Tensor-Matrix Multiplication,\" in 2015 IEEE International Parallel and Distributed Processing Symposium, May 2015, pp. 61--70, iSSN: 1530--2075."},{"key":"e_1_3_2_1_11_1","first-page":"1","volume-title":"Storage and Analysis","author":"Kaya O.","year":"2015","unstructured":"O. Kaya and B. U\u00e7ar, \"Scalable sparse tensor decompositions in distributed memory systems,\" in SC '15: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, 2015, pp. 1--11."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983332"},{"key":"e_1_3_2_1_13_1","volume-title":"Eds.","volume":"29","author":"Cheng D.","year":"2016","unstructured":"D. Cheng, R. Peng, Y. Liu, and I. Perros, \"SPALS: Fast Alternating Least Squares via Implicit Leverage Scores Sampling,\" in Advances in Neural Information Processing Systems, D. Lee, M. Sugiyama, U. Luxburg, I. Guyon, and R. Garnett, Eds., vol. 29. Curran Associates, Inc., 2016."},{"key":"e_1_3_2_1_14_1","first-page":"14","volume-title":"Proceedings of the 39th International Conference on Machine Learning. PMLR","author":"Malik O. A.","year":"2022","unstructured":"O. A. Malik, \"More Efficient Sampling for Tensor Decomposition With Worst-Case Guarantees,\" in Proceedings of the 39th International Conference on Machine Learning. PMLR, Jun. 2022, pp. 14 887--14 917, iSSN: 2640--3498."},{"key":"e_1_3_2_1_15_1","volume-title":"Fast Exact Leverage Score Sampling from Khatri-Rao Products with Applications to Tensor Decomposition,\" in Thirty-seventh Conference on Neural Information Processing Systems","author":"Bharadwaj V.","year":"2023","unstructured":"V. Bharadwaj, O. A. Malik, R. Murray, L. Grigori, A. Buluc, and J. Demmel, \"Fast Exact Leverage Score Sampling from Khatri-Rao Products with Applications to Tensor Decomposition,\" in Thirty-seventh Conference on Neural Information Processing Systems, 2023. [Online]. Available: https:\/\/arxiv.org\/pdf\/2301.12584.pdf"},{"key":"e_1_3_2_1_16_1","first-page":"902","volume-title":"May 2016","author":"Smith S.","year":"2075","unstructured":"S. Smith and G. Karypis, \"A Medium-Grained Algorithm for Sparse Tensor Factorization,\" in 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), May 2016, pp. 902--911, iSSN: 1530--2075."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000035"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2842602"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492920000021"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3295500.3356216"},{"key":"e_1_3_2_1_21_1","first-page":"141","volume-title":"SODA '20","author":"Ahle T. D.","year":"2020","unstructured":"T. D. Ahle, M. Kapralov, J. B. T. Knudsen, R. Pagh, A. Velingker, D. P. Woodruff, and A. Zandieh, \"Oblivious sketching of high-degree polynomial kernels,\" in Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms, ser. SODA '20. USA: Society for Industrial and Applied Mathematics, 2020, p. 141--160."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1112303"},{"key":"e_1_3_2_1_23_1","first-page":"3566","volume-title":"Proceedings of Machine Learning Research","volume":"119","author":"Gittens A.","year":"2020","unstructured":"A. Gittens, K. Aggour, and B. Yener, \"Adaptive sketching for fast and convergent canonical polyadic decomposition,\" in Proceedings of the 37th International Conference on Machine Learning, ser. Proceedings of Machine Learning Research, vol. 119. PMLR, 13--18 Jul 2020, pp. 3566--3575."},{"key":"e_1_3_2_1_24_1","volume-title":"Tensor-matrix products with a compressed sparse tensor,\" in Proceedings of the 5th Workshop on Irregular Applications: Architectures and Algorithms, ser. IA3 '15","author":"Smith S.","year":"2015","unstructured":"S. Smith and G. Karypis, \"Tensor-matrix products with a compressed sparse tensor,\" in Proceedings of the 5th Workshop on Irregular Applications: Architectures and Algorithms, ser. IA3 '15. New York, NY, USA: Association for Computing Machinery, 2015."},{"key":"e_1_3_2_1_25_1","volume-title":"ParTI! : A parallel tensor infrastructure for multicore cpus and gpus","author":"Li J.","year":"2018","unstructured":"J. Li, Y. Ma, and R. Vuduc, \"ParTI! : A parallel tensor infrastructure for multicore cpus and gpus,\" Oct 2018, last updated: Jan 2020. [Online]. Available: http:\/\/parti-project.org"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3524059.3532363"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1210691"},{"key":"e_1_3_2_1_28_1","volume-title":"Dynasor: A dynamic memory layout for accelerating sparse mttkrp for tensor decomposition on multi-core cpu","author":"Wijeratne S.","year":"2023","unstructured":"S. Wijeratne, R. Kannan, and V. Prasanna, \"Dynasor: A dynamic memory layout for accelerating sparse mttkrp for tensor decomposition on multi-core cpu,\" 2023."},{"key":"e_1_3_2_1_29_1","volume-title":"Minimum cost loop nests for contraction of a sparse tensor with a tensor network","author":"Kanakagiri R.","year":"2023","unstructured":"R. Kanakagiri and E. Solomonik, \"Minimum cost loop nests for contraction of a sparse tensor with a tensor network,\" 2023."},{"key":"e_1_3_2_1_30_1","first-page":"22","volume-title":"IEEE","author":"Ballard G.","year":"2018","unstructured":"G. Ballard, K. Hayashi, and K. Ramakrishnan, \"Parallel nonnegative CP decomposition of dense tensors,\" in 2018 IEEE 25th International Conference on High Performance Computing (HiPC). IEEE, 2018, pp. 22--31."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339583"},{"key":"e_1_3_2_1_32_1","first-page":"412","volume-title":"May 2021","author":"Ma L.","year":"2075","unstructured":"L. Ma and E. Solomonik, \"Efficient parallel CP decomposition with pairwise perturbation and multi-sweep dimension tree,\" in 2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS), May 2021, pp. 412--421, iSSN: 1530--2075."},{"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","volume-title":"SC '22","author":"Yadav R.","year":"2022","unstructured":"R. Yadav, A. Aiken, and F. Kjolstad, \"Spdistal: Compiling distributed sparse tensor computations,\" in Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, ser. SC '22. IEEE Press, 2022."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaaa028"},{"key":"e_1_3_2_1_36_1","first-page":"1299","volume-title":"PMLR","author":"Diao H.","year":"2018","unstructured":"H. Diao, Z. Song, W. Sun, and D. Woodruff, \"Sketching for kronecker product regression and p-splines,\" in International Conference on Artificial Intelligence and Statistics. PMLR, 2018, pp. 1299--1308."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M1266265"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1285358.1285359"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2017.10.013"},{"key":"e_1_3_2_1_40_1","first-page":"1213","volume-title":"Optimizing sparse matrixmultiple vectors multiplication for nuclear configuration interaction calculations,\" in 2014 IEEE 28th International Parallel and Distributed Processing Symposium","author":"Aktulga H. M.","year":"2014","unstructured":"H. M. Aktulga, A. Bulu\u00e7, S. Williams, and C. Yang, \"Optimizing sparse matrixmultiple vectors multiplication for nuclear configuration interaction calculations,\" in 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014, pp. 1213--1222."}],"event":{"name":"SPAA '24: 36th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Nantes France","acronym":"SPAA '24","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"]},"container-title":["Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3659980","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626183.3659980","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T16:23:36Z","timestamp":1755879816000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3659980"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":40,"alternative-id":["10.1145\/3626183.3659980","10.1145\/3626183"],"URL":"https:\/\/doi.org\/10.1145\/3626183.3659980","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}