{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:30:13Z","timestamp":1772119813206,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,17]],"date-time":"2023-06-17T00:00:00Z","timestamp":1686960000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Research Council","award":["818252"],"award-info":[{"award-number":["818252"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,17]]},"DOI":"10.1145\/3558481.3591083","type":"proceedings-article","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T22:22:03Z","timestamp":1685571723000},"page":"379-390","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Multiplying 2 \u00d7 2 Sub-Blocks Using 4 Multiplications"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-5813-347X","authenticated-orcid":false,"given":"Yoav","family":"Moran","sequence":"first","affiliation":[{"name":"The Hebrew University of Jerusalem, Jerusalem, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1309-5566","authenticated-orcid":false,"given":"Oded","family":"Schwartz","sequence":"additional","affiliation":[{"name":"The Hebrew University of Jerusalem, Jerusalem, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,6,17]]},"reference":[{"key":"e_1_3_2_3_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.32"},{"key":"e_1_3_2_3_2_1","doi-asserted-by":"publisher","unstructured":"N. Anderson and D. Manley. 1994. A matrix extension of Winograd's inner product algorithm. Theoretical Computer Science 131 (1994). Issue 2. https: \/\/doi.org\/10.1016\/0304--3975(94)90186-4","DOI":"10.1016\/0304--3975(94)90186-4"},{"key":"e_1_3_2_3_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312044"},{"key":"e_1_3_2_3_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989495"},{"key":"e_1_3_2_3_5_1","volume-title":"Sparsifying the Operators of Fast Matrix Multiplication Algorithms. arXiv preprint arXiv:2008.03759","author":"Beniamini Gal","year":"2020","unstructured":"Gal Beniamini, Nathan Cheng, Olga Holtz, Elaye Karstadt, and Oded Schwartz. 2020. Sparsifying the Operators of Fast Matrix Multiplication Algorithms. arXiv preprint arXiv:2008.03759 (2020)."},{"key":"e_1_3_2_3_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323188"},{"key":"e_1_3_2_3_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2858788.2688513"},{"key":"e_1_3_2_3_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02575865"},{"key":"e_1_3_2_3_9_1","volume-title":"Lower bounds for the multiplicative complexity of matrix multiplication. Computational Complexity 8","author":"Bl\u00e4ser Markus","year":"1999","unstructured":"Markus Bl\u00e4ser. 1999. Lower bounds for the multiplicative complexity of matrix multiplication. Computational Complexity 8 (1999). Issue 3. https:\/\/doi.org\/10. 1007\/s000370050028"},{"key":"e_1_3_2_3_10_1","doi-asserted-by":"publisher","unstructured":"Markus Bl\u00e4ser. 2001. A 5 over 2 n 2-lower bound for the multiplicative complexity of n \u00d7 n-matrix multiplication. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2010. https:\/\/doi.org\/10.1007\/3-540-44693-1_9","DOI":"10.1007\/3-540-44693-1_9"},{"key":"e_1_3_2_3_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02308867"},{"key":"e_1_3_2_3_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00176-X"},{"key":"e_1_3_2_3_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2016.07.004"},{"key":"e_1_3_2_3_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238217"},{"key":"e_1_3_2_3_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"e_1_3_2_3_17_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0308210511001648"},{"key":"e_1_3_2_3_18_1","volume-title":"Lectures on the complexity of bilinear problems","author":"De Groote Hans F","unstructured":"Hans F De Groote. 1987. Lectures on the complexity of bilinear problems. Vol. 245. Springer Science & Business Media."},{"key":"e_1_3_2_3_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.80"},{"key":"e_1_3_2_3_20_1","volume-title":"Julian Schrittwieser, Grzegorz Swirszcz, et al .","author":"Fawzi Alhussein","year":"2022","unstructured":"Alhussein Fawzi, Matej Balog, Aja Huang, Thomas Hubert, Bernardino Romera-Paredes, Mohammadamin Barekatain, Alexander Novikov, Francisco J R Ruiz, Julian Schrittwieser, Grzegorz Swirszcz, et al . 2022. Discovering faster matrix multiplication algorithms with reinforcement learning. Nature 610, 7930 (2022), 47--53."},{"key":"e_1_3_2_3_21_1","volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Fischer Patrick C","unstructured":"Patrick C Fischer. 1974. Further schemes for combining matrix algorithms. In International Colloquium on Automata, Languages, and Programming. Springer, 428--436."},{"key":"e_1_3_2_3_22_1","volume-title":"Instruction tables","author":"Fog Agner","year":"2022","unstructured":"Agner Fog. 2022. Instruction tables. Technical University of Denmark (2022). https:\/\/www.agner.org\/optimize\/instruction_tables.pdf"},{"key":"e_1_3_2_3_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"e_1_3_2_3_24_1","volume-title":"New ways to multiply 3 \u00d7 3-matrices. Journal of Symbolic Computation 104","author":"Heule Marijn J.H.","year":"2021","unstructured":"Marijn J.H. Heule, Manuel Kauers, and Martina Seidl. 2021. New ways to multiply 3 \u00d7 3-matrices. Journal of Symbolic Computation 104 (2021). https:\/\/doi.org\/10. 1016\/j.jsc.2020.10.003"},{"key":"e_1_3_2_3_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0120004"},{"key":"e_1_3_2_3_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/0209056"},{"key":"e_1_3_2_3_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10559-019-00163-2"},{"key":"e_1_3_2_3_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10559-021-00345-x"},{"key":"e_1_3_2_3_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802486"},{"key":"e_1_3_2_3_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA52012.2021.00010"},{"key":"e_1_3_2_3_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3364504"},{"key":"e_1_3_2_3_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3295500.3356181"},{"key":"e_1_3_2_3_33_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1976-13988-2"},{"key":"e_1_3_2_3_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2012.33"},{"key":"e_1_3_2_3_35_1","first-page":"1","article-title":"The ubiquitous Kronecker product","volume":"123","author":"Van Loan Charles F.","year":"2000","unstructured":"Charles F. Van Loan. 2000. The ubiquitous Kronecker product. Journal of computational and applied mathematics 123, 1--2 (2000), 85--100. https:\/\/doi. org\/10.1016\/S0377-0427(00)00393-9","journal-title":"Journal of computational and applied mathematics"},{"key":"e_1_3_2_3_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2019.00058"},{"key":"e_1_3_2_3_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/0209027"},{"key":"e_1_3_2_3_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(82)90037--2"},{"key":"e_1_3_2_3_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/0205016"},{"key":"e_1_3_2_3_40_1","volume-title":"Fast Commutative Matrix Algorithm. arXiv preprint arXiv:1904.07683 (4","author":"Rosowski Andreas","year":"2019","unstructured":"Andreas Rosowski. 2019. Fast Commutative Matrix Algorithm. arXiv preprint arXiv:1904.07683 (4 2019). http:\/\/arxiv.org\/abs\/1904.07683"},{"key":"e_1_3_2_3_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/0210032"},{"key":"e_1_3_2_3_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755594"},{"key":"e_1_3_2_3_43_1","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542513120129"},{"key":"e_1_3_2_3_44_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ISAAC.2019.33"},{"key":"e_1_3_2_3_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"e_1_3_2_3_46_1","doi-asserted-by":"publisher","DOI":"10.1515\/crll.1973"},{"key":"e_1_3_2_3_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1970.222926"},{"key":"e_1_3_2_3_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214056"},{"key":"e_1_3_2_3_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1968.227420"},{"key":"e_1_3_2_3_50_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.3160230204"},{"key":"e_1_3_2_3_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(71)90009-7"},{"key":"e_1_3_2_3_52_1","unstructured":"Shmuel Winograd. 1976. Private communication with R. Probert [39]."},{"key":"e_1_3_2_3_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/dcs.1988.12538"}],"event":{"name":"SPAA '23: 35th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Orlando FL USA","acronym":"SPAA '23","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 35th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591083","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3558481.3591083","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:06Z","timestamp":1750178826000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591083"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,17]]},"references-count":52,"alternative-id":["10.1145\/3558481.3591083","10.1145\/3558481"],"URL":"https:\/\/doi.org\/10.1145\/3558481.3591083","relation":{},"subject":[],"published":{"date-parts":[[2023,6,17]]},"assertion":[{"value":"2023-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}