{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:30:42Z","timestamp":1772119842274,"version":"3.50.1"},"reference-count":73,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2012,12,1]],"date-time":"2012-12-01T00:00:00Z","timestamp":1354320000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["239985"],"award-info":[{"award-number":["239985"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-SC0003959, DE-SC0004938, and DE-FC02-06-ER25786"],"award-info":[{"award-number":["DE-SC0003959, DE-SC0004938, and DE-FC02-06-ER25786"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["DMS-0635607"],"award-info":[{"award-number":["DMS-0635607"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006235","name":"Lawrence Berkely National Laboratory","doi-asserted-by":"publisher","award":["DE-AC02-05CH11231"],"award-info":[{"award-number":["DE-AC02-05CH11231"]}],"id":[{"id":"10.13039\/100006235","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2012,12]]},"abstract":"<jats:p>The communication cost of algorithms (also known as I\/O-complexity) is shown to be closely related to the expansion properties of the corresponding computation graphs. We demonstrate this on Strassen's and other fast matrix multiplication algorithms, and obtain the first lower bounds on their communication costs.<\/jats:p>\n          <jats:p>\n            In the sequential case, where the processor has a fast memory of size\n            <jats:italic>M<\/jats:italic>\n            , too small to store three\n            <jats:italic>n<\/jats:italic>\n            -by-\n            <jats:italic>n<\/jats:italic>\n            matrices, the lower bound on the number of words moved between fast and slow memory is, for a large class of matrix multiplication algorithms, \u03a9( (\n            <jats:italic>n<\/jats:italic>\n            \/\u221a\n            <jats:italic>M<\/jats:italic>\n            )\n            <jats:sup>\n              \u03c9\n              <jats:sub>0<\/jats:sub>\n            <\/jats:sup>\n            \u00b7\n            <jats:italic>M<\/jats:italic>\n            ), where \u03c9\n            <jats:sub>0<\/jats:sub>\n            is the exponent in the arithmetic count (e.g., \u03c9\n            <jats:sub>0<\/jats:sub>\n            = lg 7 for Strassen, and \u03c9\n            <jats:sub>0<\/jats:sub>\n            = 3 for conventional matrix multiplication). With\n            <jats:italic>p<\/jats:italic>\n            parallel processors, each with fast memory of size\n            <jats:italic>M<\/jats:italic>\n            , the lower bound is asymptotically lower by a factor of\n            <jats:italic>p<\/jats:italic>\n            . These bounds are attainable both for sequential and for parallel algorithms and hence optimal.\n          <\/jats:p>","DOI":"10.1145\/2395116.2395121","type":"journal-article","created":{"date-parts":[[2013,1,8]],"date-time":"2013-01-08T15:34:16Z","timestamp":1357659256000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":47,"title":["Graph expansion and communication costs of fast matrix multiplication"],"prefix":"10.1145","volume":"59","author":[{"given":"Grey","family":"Ballard","sequence":"first","affiliation":[{"name":"University of California, Berkeley, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Demmel","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olga","family":"Holtz","sequence":"additional","affiliation":[{"name":"University of California at Berkeley and Technische Universit\u00e4t Berlin"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oded","family":"Schwartz","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,1,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.395.0575"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90188-N"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 6th International Euro-Par Conference on Parallel Processing (Euro-Par '00)","author":"Ahmed N.","unstructured":"Ahmed , N. and Pingali , K . 2000. Automatic generation of block-recursive codes . In Proceedings of the 6th International Euro-Par Conference on Parallel Processing (Euro-Par '00) . Springer-Verlag, Berlin, 368--378. Ahmed, N. and Pingali, K. 2000. Automatic generation of block-recursive codes. In Proceedings of the 6th International Euro-Par Conference on Parallel Processing (Euro-Par '00). Springer-Verlag, Berlin, 368--378."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548307008851"},{"key":"e_1_2_1_6_1","unstructured":"Anderson E. Bai Z. Bischof C. Demmel J. Dongarra J. Croz J. D. Greenbaum A. Hammarling S. McKenney A. Ostrouchov S. and Sorensen D. 1992. LAPACK's User's Guide. SIAM Philadelphia PA http:\/\/www.netlib.org\/lapack\/.   Anderson E. Bai Z. Bischof C. Demmel J. Dongarra J. Croz J. D. Greenbaum A. Hammarling S. McKenney A. Ostrouchov S. and Sorensen D. 1992. LAPACK's User's Guide. SIAM Philadelphia PA http:\/\/www.netlib.org\/lapack\/."},{"key":"e_1_2_1_7_1","volume-title":"2008--2012. The MAGMA project","author":"Baboulin M.","unstructured":"Baboulin , M. , Demmel , J. , Dong , T. , Dongarra , J. , Horton , M. , Jia , Y. , Kabir , K. , Langou , J. , Li , Y. , Ltaief , H. , Nath , R. , Tomov , S. , and Volkov , V . 2008--2012. The MAGMA project . University of Tennessee , Department of Electrical Engineering and Computer Science. http:\/\/icl.cs.utk.edu\/magma\/. Baboulin, M., Demmel, J., Dong, T., Dongarra, J., Horton, M., Jia, Y., Kabir, K., Langou, J., Li, Y., Ltaief, H., Nath, R., Tomov, S., and Volkov, V. 2008--2012. The MAGMA project. University of Tennessee, Department of Electrical Engineering and Computer Science. http:\/\/icl.cs.utk.edu\/magma\/."},{"key":"e_1_2_1_8_1","unstructured":"Ballard G. Demmel J. and Dumitriu I. 2011a. Communication-optimal parallel and sequential eigenvalue and singular value algorithms. EECS Tech. rep. EECS-2011-14 University of California Berkeley.  Ballard G. Demmel J. and Dumitriu I. 2011a. Communication-optimal parallel and sequential eigenvalue and singular value algorithms. EECS Tech. rep. EECS-2011-14 University of California Berkeley."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989531"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312021"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312044"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34862-4_2"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/090760969"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989495"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/090769156"},{"key":"e_1_2_1_16_1","unstructured":"Ballard G. Demmel J. Holtz O. and Schwartz O. 2012d. Sequential communication bounds for fast linear algebra. Tech. rep. EECS-2012-36 University of California Berkeley.  Ballard G. Demmel J. Holtz O. and Schwartz O. 2012d. Sequential communication bounds for fast linear algebra. Tech. rep. EECS-2012-36 University of California Berkeley."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-010-9285-4"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/647681.732330"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002240000131"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02575865"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90113-3"},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Blackford L. S. Choi J. Cleary A. D\u00e3Azevedo E. Demmel J. Dhillon I. Dongarra J. Hammarling S. Henry G. Petitet A. Stanley K. Walker D. and Whaley R. C. 1997. ScaLAPACK Users' Guide. SIAM Philadelphia PA. http:\/\/www.netlib.org\/scalapack\/.   Blackford L. S. Choi J. Cleary A. D\u00e3Azevedo E. Demmel J. Dhillon I. Dongarra J. Hammarling S. Henry G. Petitet A. Stanley K. Walker D. and Whaley R. C. 1997. ScaLAPACK Users' Guide. SIAM Philadelphia PA. http:\/\/www.netlib.org\/scalapack\/.","DOI":"10.1137\/1.9780898719642"},{"key":"e_1_2_1_23_1","volume-title":"(Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '08)","author":"Blelloch G. E.","unstructured":"Blelloch , G. E. , Chowdhury , R. A. , Gibbons , P. B. , Ramachandran , V. , Chen , S. , and Kozuch , M . 2008. Provably good multicore cache performance for divide-and-conquer algorithms . In (Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '08) , SIAM, Philadelphia, PA, 501--510. Blelloch, G. E., Chowdhury, R. A., Gibbons, P. B., Ramachandran, V., Chen, S., and Kozuch, M. 2008. Provably good multicore cache performance for divide-and-conquer algorithms. In (Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '08), SIAM, Philadelphia, PA, 501--510."},{"key":"e_1_2_1_24_1","volume-title":"Geometric Inequalities. Grundlehren der Mathematische Wissenschaften Series","volume":"285","author":"Burago Y. D.","unstructured":"Burago , Y. D. and Zalgaller , V. A . 1988 . Geometric Inequalities. Grundlehren der Mathematische Wissenschaften Series , vol. 285 , Springer, Berlin. Burago, Y. D. and Zalgaller, V. A. 1988. Geometric Inequalities. Grundlehren der Mathematische Wissenschaften Series, vol. 285, Springer, Berlin."},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","unstructured":"B\u0171rgisser P. Clausen M. and Shokrollahi M. A. 1997. Algebraic Complexity Theory. Number 315 in Grundlehren der mathematischen Wissenschaften. Springer Verlag.   B\u0171rgisser P. Clausen M. and Shokrollahi M. A. 1997. Algebraic Complexity Theory. Number 315 in Grundlehren der mathematischen Wissenschaften. Springer Verlag.","DOI":"10.1007\/978-3-662-03338-8"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109622"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.39"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211038"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28396"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810496"},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Dekel E. Nassimi D. and Sahni S. 1981. Parallel matrix and graph algorithms. SIAM J. Comput. 657--675.  Dekel E. Nassimi D. and Sahni S. 1981. Parallel matrix and graph algorithms. SIAM J. Comput. 657--675.","DOI":"10.1137\/0210049"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-007-0114-x"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-007-0061-6"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/080731992"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.v16:8"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcph.1994.1001"},{"key":"e_1_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Elmroth E. and \n      Gustavson F\n  . \n  1998\n  . New serial and parallel recursive QR factorization algorithms for SMP systems. In Applied Parallel Computing. Large Scale Scientific and Industrial Problems. B. K. et al. Ed. Lecture Notes in Computer Science Series vol. \n  1541 Springer 120--128.   Elmroth E. and Gustavson F. 1998. New serial and parallel recursive QR factorization algorithms for SMP systems. In Applied Parallel Computing. Large Scale Scientific and Industrial Problems. B. K. et al. Ed. Lecture Notes in Computer Science Series vol. 1541 Springer 120--128.","DOI":"10.1007\/BFb0095328"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/966049.781525"},{"key":"e_1_2_1_41_1","volume-title":"Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS '99)","author":"Frigo M.","unstructured":"Frigo , M. , Leiserson , C. E. , Prokop , H. , and Ramachandran , S . 1999. Cache-oblivious algorithms . In Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS '99) . IEEE Computer Society, Los Alamitos, CA, 285. Frigo, M., Leiserson, C. E., Prokop, H., and Ramachandran, S. 1999. Cache-oblivious algorithms. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS '99). IEEE Computer Society, Los Alamitos, CA, 285."},{"key":"e_1_2_1_42_1","volume-title":"Eds","author":"Fuller S. H.","year":"2011","unstructured":"Fuller , S. H. and Millett , L. I. , Eds . 2011 . The Future of Computing Performance: Game Over or Next Level&quest; The National Academies Press , Washington, D.C. http:\/\/www.nap.edu. Fuller, S. H. and Millett, L. I., Eds. 2011. The Future of Computing Performance: Game Over or Next Level&quest; The National Academies Press, Washington, D.C. http:\/\/www.nap.edu."},{"key":"e_1_2_1_43_1","volume-title":"Eds","author":"Graham S. L.","year":"2004","unstructured":"Graham , S. L. , Snir , M. , and Patterson , C. A. , Eds . 2004 . Getting up to Speed : The Future of Supercomputing. Report of National Research Council of the National Academies Sciences, The National Academies Press , Washington, D.C. http:\/\/www.nap.edu. Graham, S. L., Snir, M., and Patterson, C. A., Eds. 2004. Getting up to Speed: The Future of Supercomputing. Report of National Research Council of the National Academies Sciences, The National Academies Press, Washington, D.C. http:\/\/www.nap.edu."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/100788926"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.416.0737"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802486"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1137\/0120004"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/369028.369096"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.03.021"},{"key":"e_1_2_1_50_1","unstructured":"Koucky M. Kabanets V. and Kolokolova A. 2007. Expanders made elementary. Manuscript. http:\/\/www.cs.sfu.ca\/~kabanets\/papers\/expanders.pdf.  Koucky M. Kabanets V. and Kolokolova A. 2007. Expanders made elementary. Manuscript. http:\/\/www.cs.sfu.ca\/~kabanets\/papers\/expanders.pdf."},{"key":"e_1_2_1_51_1","unstructured":"Leiserson C. E. 2008. Personal communication with G. Ballard J. Demmel O. Holtz and O. Schwartz.  Leiserson C. E. 2008. Personal communication with G. Ballard J. Demmel O. Holtz and O. Schwartz."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90105-6"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1949-09320-5"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00008264"},{"key":"e_1_2_1_55_1","volume-title":"Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), 769--782","author":"Michael J. P.","unstructured":"Michael , J. P. , Penner , M. , and Prasanna , V. K . 2002. Optimizing graph algorithms for improved cache performance . In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), 769--782 . Michael, J. P., Penner, M., and Prasanna, V. K. 2002. Optimizing graph algorithms for improved cache performance. In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), 769--782."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63529"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1137\/0209027"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702402147"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.2307\/3062153"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211020"},{"key":"e_1_2_1_61_1","volume-title":"Space-time tradeoffs in memory hierarchies. Tech. rep","author":"Savage J.","unstructured":"Savage , J. 1994. Space-time tradeoffs in memory hierarchies. Tech. rep ., Brown University , Providence . Savage, J. 1994. Space-time tradeoffs in memory hierarchies. Tech. rep., Brown University, Providence."},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.5555\/646714.701412"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1137\/0210032"},{"key":"e_1_2_1_64_1","volume-title":"Proceedings of the 17th International European Conference on Parallel and Distributed Computing (Euro-Par'11)","author":"Solomonik E.","unstructured":"Solomonik , E. , and Demmel , J . 2011. Communication-optimal parallel 2.5D matrix multiplication and LU factorization algorithms . In Proceedings of the 17th International European Conference on Parallel and Distributed Computing (Euro-Par'11) , Springer. Solomonik, E., and Demmel, J. 2011. Communication-optimal parallel 2.5D matrix multiplication and LU factorization algorithms. In Proceedings of the 17th International European Conference on Parallel and Distributed Computing (Euro-Par'11), Springer."},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"e_1_2_1_67_1","first-page":"375","article-title":"Relative bilinear complexity and matrix multiplication","volume":"1987","author":"Strassen V.","year":"1987","unstructured":"Strassen , V. 1987 . Relative bilinear complexity and matrix multiplication . Journal f\u0171r die reine und angewandte Mathematik (Crelles Journal) 1987 , 375 -- 376 , 406--443. Strassen, V. 1987. Relative bilinear complexity and matrix multiplication. Journal f\u0171r die reine und angewandte Mathematik (Crelles Journal) 1987, 375--376, 406--443.","journal-title":"Journal f\u0171r die reine und angewandte Mathematik (Crelles Journal)"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013588221172"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2006.04.017"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896297744"},{"key":"e_1_2_1_71_1","volume-title":"Proceedings of the ACM\/IEEE Conference on Supercomputing (SC '08)","author":"Volkov V.","unstructured":"Volkov , V. and Demmel , J . 2008. Benchmarking GPUs to tune dense linear algebra . In Proceedings of the ACM\/IEEE Conference on Supercomputing (SC '08) . IEEE Press, Los Alamitos, CA, 1--11. Volkov, V. and Demmel, J. 2008. Benchmarking GPUs to tune dense linear algebra. In Proceedings of the ACM\/IEEE Conference on Supercomputing (SC '08). IEEE Press, Los Alamitos, CA, 1--11."},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214056"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(71)90009-7"},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.5555\/646665.698943"},{"key":"e_1_2_1_75_1","volume-title":"Proceedings of the 8th International Conference on Distributed Computing Systems. 366--373","author":"Yang C.-Q.","unstructured":"Yang , C.-Q. and Miller , B . 1988. Critical path analysis for the execution of parallel and distributed programs . In Proceedings of the 8th International Conference on Distributed Computing Systems. 366--373 . Yang, C.-Q. and Miller, B. 1988. Critical path analysis for the execution of parallel and distributed programs. In Proceedings of the 8th International Conference on Distributed Computing Systems. 366--373."}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2395116.2395121","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2395116.2395121","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:56Z","timestamp":1750239296000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2395116.2395121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":73,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["10.1145\/2395116.2395121"],"URL":"https:\/\/doi.org\/10.1145\/2395116.2395121","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12]]},"assertion":[{"value":"2011-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}