{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T07:50:03Z","timestamp":1767858603910,"version":"3.49.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1023\/a:1009716300509","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T22:50:41Z","timestamp":1040597441000},"page":"307-332","source":"Crossref","is-referenced-by-count":35,"title":["Structure Prediction and Computation of Sparse Matrix Products"],"prefix":"10.1007","volume":"2","author":[{"given":"Edith","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"189949_CR1","unstructured":"E. Cohen, \u201cEstimating the size of the transitive closure in linear time,\u201d in Proc. 35th IEEE Annual Symposium on Foundations of Computer Science, IEEE, 1994, pp. 190\u2013200, full version submitted to JCSS."},{"key":"189949_CR2","doi-asserted-by":"crossref","unstructured":"E. Cohen, \u201cOptimizing multiplications of sparse matrices,\u201d in Proc. of the 5th International Conference on Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 1084, W.H. Cunningham, S.T. McCormick, and M. Queyranne (Eds.), Springer-Verlag, 1996, pp. 219\u2013233.","DOI":"10.1007\/3-540-61310-2_17"},{"key":"189949_CR3","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, \u201cMatrix multiplication via arithmetic progressions,\u201d J. Symb. Comput., vol. 9, pp. 251\u2013280, 1990.","journal-title":"J. Symb. Comput."},{"key":"189949_CR4","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"1990","unstructured":"T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms, McGraw-Hill: New York, 1990."},{"key":"189949_CR5","volume-title":"An Introduction to Probability Theory and its Applications","author":"W. Feller","year":"1971","unstructured":"W. Feller, An Introduction to Probability Theory and its Applications, John Wiley & Sons: New York, 1971, vol. 2."},{"key":"189949_CR6","doi-asserted-by":"crossref","unstructured":"A. George, J. Gilbert, and J.W.H. Liu (Eds.), Graph Theory and Sparse Matrix Computation, The IMA Volumes in Mathematics and its Applications, vol. 56, Springer-Verlag, 1993.","DOI":"10.1007\/978-1-4613-8369-7"},{"key":"189949_CR7","unstructured":"A. George and J.W.H. Liu, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, 1981."},{"issue":"1","key":"189949_CR8","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1137\/S0895479887139455","volume":"15","author":"J.R. Gilbert","year":"1994","unstructured":"J.R. Gilbert, \u201cPredicting structure in sparse matrix computations,\u201d SIAM J. Matrix Anal. Appl., vol. 15, no.1, pp. 62\u201379, 1994.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"189949_CR9","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1137\/0613024","volume":"13","author":"J. Gilbert","year":"1992","unstructured":"J. Gilbert, C. Moler, and R. Schreiber, \u201cSparse matrices in Matlab: Design and implementation,\u201d SIAM J. Matrix Anal. Appl., vol. 13, pp. 333\u2013356, 1992.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"189949_CR10","doi-asserted-by":"crossref","unstructured":"J. Gilbert and E.G. NG, \u201cPredicting structure in nonsymmetric sparse matrix factorizations,\u201d in Graph Theory and Sparse Matrix Computation, The IMA Volumes in Mathematics and its Applications, vol. 56, A. George, J. Gilbert, and J.W.H. Liu (Eds.), Springer-Verlag, 1993, pp. 107\u2013140.","DOI":"10.1007\/978-1-4613-8369-7_6"},{"key":"189949_CR11","volume-title":"Matrix Computations","author":"G. Golub","year":"1989","unstructured":"G. Golub and C. Van Loan, Matrix Computations, The Johns Hopkins U. Press: Baltimore, MD, 1989."},{"key":"189949_CR12","volume-title":"Matrix Computations","author":"A. Jennings","year":"1992","unstructured":"A. Jennings and J.J. McKeown, Matrix Computations, 2nd edition, John Wiley & Sons: New York, 1992.","edition":"2nd edition"},{"key":"189949_CR13","volume-title":"Sparse Matrix Technology","author":"S. Pissanetzky","year":"1984","unstructured":"S. Pissanetzky, Sparse Matrix Technology, Academic Press: New York, 1984."},{"key":"189949_CR14","volume-title":"Algorithms","author":"R. Sedgewick","year":"1988","unstructured":"R. Sedgewick, Algorithms, Addison-Wesley: Reading, MA, 1988."},{"issue":"3","key":"189949_CR15","first-page":"345","volume":"14","author":"V. Strassen","year":"1969","unstructured":"V. Strassen, \u201cGaussian elimination is not optimal,\u201d Numerische Mathematik, vol. 14, no.3, pp. 345\u2013356, 1969.","journal-title":"Numerische Mathematik"},{"key":"189949_CR16","volume-title":"Sparse Matrices","author":"R.P. Tewarson","year":"1973","unstructured":"R.P. Tewarson, Sparse Matrices, Academic Press: New York, 1973."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009716300509.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009716300509\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009716300509.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:02:28Z","timestamp":1751281348000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009716300509"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["189949"],"URL":"https:\/\/doi.org\/10.1023\/a:1009716300509","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}