{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:47:35Z","timestamp":1783036055638,"version":"3.54.6"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540613107","type":"print"},{"value":"9783540684534","type":"electronic"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61310-2_17","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:27:31Z","timestamp":1330273651000},"page":"219-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On optimizing multiplications of sparse matrices"],"prefix":"10.1007","author":[{"given":"Edith","family":"Cohen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"17_CR1","unstructured":"E. Cohen. Estimating the size of the transitive closure in linear time. In Proc. 35th IEEE. Annual Symposium on Foundations of Computer Science, pages 190\u2013200. IEEE, 1994. full version submitted to JCSS."},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symb. Comput., 9:251\u2013280, 1990.","journal-title":"J. Symb. Comput."},{"key":"17_CR3","volume-title":"An introduction to probability theory and its applications, volume 2","author":"W. Feller","year":"1971","unstructured":"W. Feller. An introduction to probability theory and its applications, volume 2. John Wiley & Sons, New York, 1971."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"A. George, J. Gilbert, and J.W.H. Liu, editors. Graph theory and sparse matrix computation, volume 56 of The IMA volumes in Mathematics and its Applications. Springer-Verlag, 1993.","DOI":"10.1007\/978-1-4613-8369-7"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"J. Gilbert and E. G. NG. Predicting structure in nonsymmetric sparse matrix factorizations. In A. George, J. Gilbert, and J.W.H. Liu, editors, Graph theory and sparse matrix computation The IMA volumes in Mathematics and its Applications, volume 56, pages 107\u2013140. Springer-Verlag, 1993.","DOI":"10.1007\/978-1-4613-8369-7_6"},{"key":"17_CR6","volume-title":"Matrix Computations","author":"G. Golub","year":"1989","unstructured":"G. Golub. Matrix Computations. The Johns Hopkins U. Press, Baltimore, MD, 1989."},{"key":"17_CR7","volume-title":"Matrix computations","author":"A. Jennings","year":"1992","unstructured":"A. Jennings and J. J. McKeown. Matrix computations. John Wiley & Sons, New York, second edition, 1992.","edition":"second edition"},{"key":"17_CR8","volume-title":"Sparse matrix technology","author":"S. Pissanetzky","year":"1984","unstructured":"S. Pissanetzky. Sparse matrix technology. Academic Press, New York, 1984."},{"key":"17_CR9","volume-title":"Algorithms","author":"R. Sedgewick","year":"1988","unstructured":"R. Sedgewick. Algorithms. Addison-Wesley Publishing Co., Reading, MA, 1988."},{"issue":"3","key":"17_CR10","first-page":"345","volume":"14","author":"V. Strassen","year":"1969","unstructured":"V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 14(3): 345\u2013356, 1969.","journal-title":"Numerische Mathematik"},{"key":"17_CR11","volume-title":"Sparse matrices","author":"R. P. Tewarson","year":"1973","unstructured":"R. P. Tewarson. Sparse matrices. Academic Press, New York, 1973."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61310-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:48:20Z","timestamp":1558255700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61310-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613107","9783540684534"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-61310-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"3 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}