{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:31:14Z","timestamp":1772119874531,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,7,28]],"date-time":"2009-07-28T00:00:00Z","timestamp":1248739200000},"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":[[2009,7,28]]},"DOI":"10.1145\/1576702.1576713","type":"proceedings-article","created":{"date-parts":[[2009,7,28]],"date-time":"2009-07-28T12:45:28Z","timestamp":1248785128000},"page":"55-62","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm"],"prefix":"10.1145","author":[{"given":"Brice","family":"Boyer","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Grenoble, Grenoble, France"}]},{"given":"Jean-Guillaume","family":"Dumas","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Grenoble, Grenoble, France"}]},{"given":"Cl\u00e9ment","family":"Pernet","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Grenoble, Grenoble, France"}]},{"given":"Wei","family":"Zhou","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}]}],"member":"320","published-online":{"date-parts":[[2009,7,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2006.03.018"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/0909040"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0265-3","volume-title":"Polynomial and Matrix Computations, Volume 1: Fundamental Algorithms","author":"Bini D.","year":"1994","unstructured":"D. Bini and V. Pan . Polynomial and Matrix Computations, Volume 1: Fundamental Algorithms . Birkhauser , Boston , 1994 . D. Bini and V. Pan. Polynomial and Matrix Computations, Volume 1: Fundamental Algorithms. Birkhauser, Boston, 1994."},{"key":"e_1_3_2_1_4_1","volume-title":"Algebraic Complexity Theory","author":"Clausen M.","year":"1997","unstructured":"M. Clausen , P. Bürgisser, and M. A. Shokrollahi . Algebraic Complexity Theory . Springer , 1997 . M. Clausen, P. Bürgisser, and M. A. Shokrollahi. Algebraic Complexity Theory. Springer, 1997."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcph.1994.1001"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/780506.780515"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005285.1005304"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/369028.369096"},{"key":"e_1_3_2_1_10_1","volume-title":"Strassen's algorithm for matrix multiplication : Modeling analysis, and implementation. Technical report","author":"Huss-Lederman S.","year":"1996","unstructured":"S. Huss-Lederman , E. M. Jacobson , J. R. Johnson , A. Tsao , and T. Turnbull . Strassen's algorithm for matrix multiplication : Modeling analysis, and implementation. Technical report , Center for Computing Sciences , Nov. 1996 . CCS-TR-96-17. S. Huss-Lederman, E. M. Jacobson, J. R. Johnson, A. Tsao, and T. Turnbull. Strassen's algorithm for matrix multiplication : Modeling analysis, and implementation. Technical report, Center for Computing Sciences, Nov. 1996. CCS-TR-96-17."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90007-4"},{"key":"e_1_3_2_1_12_1","volume-title":"Fast Gaussian elimination and the PLUQ decomposition. Technical report","author":"Jeannerod C.-P.","year":"2007","unstructured":"C.-P. Jeannerod , C. Pernet , and A. Storjohann . Fast Gaussian elimination and the PLUQ decomposition. Technical report , 2007 . C.-P. Jeannerod, C. Pernet, and A. Storjohann. Fast Gaussian elimination and the PLUQ decomposition. Technical report, 2007."},{"key":"e_1_3_2_1_13_1","series-title":"LNCS","first-page":"404","volume-title":"Proceedings of the 5th Symposium on Mathematical Foundations of Computer Science","author":"Kreczmar A.","year":"1976","unstructured":"A. Kreczmar . On memory requirements of Strassen's algorithms . In A. Mazurkiewicz, editor, Proceedings of the 5th Symposium on Mathematical Foundations of Computer Science , volume 45 of LNCS , pages 404 -- 407 , Gdańsk, Poland, Sept. 1976 . Springer . A. Kreczmar. On memory requirements of Strassen's algorithms. In A. Mazurkiewicz, editor, Proceedings of the 5th Symposium on Mathematical Foundations of Computer Science, volume 45 of LNCS, pages 404--407, Gdańsk, Poland, Sept. 1976. Springer."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(92)90393-O"},{"key":"e_1_3_2_1_15_1","volume-title":"Laboratoire Informatique et Distribution","author":"Pernet C.","year":"2001","unstructured":"C. Pernet . Implementation of Winograd's fast matrix multiplication over finite fields using ATLAS level 3 BLAS. Technical report , Laboratoire Informatique et Distribution , July 2001 . ljk.imag.fr\/membres\/Jean-Guillaume.Dumas\/FFLAS. C. Pernet. Implementation of Winograd's fast matrix multiplication over finite fields using ATLAS level 3 BLAS. Technical report, Laboratoire Informatique et Distribution, July 2001. ljk.imag.fr\/membres\/Jean-Guillaume.Dumas\/FFLAS."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(71)90009-7"}],"event":{"name":"ISSAC '09: International Symposium on Symbolic and Algebraic Computation","location":"Seoul Republic of Korea","acronym":"ISSAC '09","sponsor":["ACM Association for Computing Machinery","SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"]},"container-title":["Proceedings of the 2009 international symposium on Symbolic and algebraic computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1576702.1576713","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1576702.1576713","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:09Z","timestamp":1750249389000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1576702.1576713"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,28]]},"references-count":17,"alternative-id":["10.1145\/1576702.1576713","10.1145\/1576702"],"URL":"https:\/\/doi.org\/10.1145\/1576702.1576713","relation":{},"subject":[],"published":{"date-parts":[[2009,7,28]]},"assertion":[{"value":"2009-07-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}