{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:33:26Z","timestamp":1742996006366,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319130743"},{"type":"electronic","value":"9783319130750"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13075-0_5","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T16:37:06Z","timestamp":1415983026000},"page":"53-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficiently Correcting Matrix Products"],"prefix":"10.1007","author":[{"given":"Leszek","family":"G\u0105sieniec","sequence":"first","affiliation":[]},{"given":"Christos","family":"Levcopoulos","sequence":"additional","affiliation":[]},{"given":"Andrzej","family":"Lingas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,8]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Spalek, R.: Quantum Verification of Matrix Products. In: Proc. ACM-SIAM SODA, pp. 880\u2013889 (2006)","DOI":"10.1145\/1109557.1109654"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Chen, Z.-Z., Kao, M.-Y.: Reducing Randomness via Irrational Numbers. In: Proc. ACM STOC, pp. 200\u2013209 (1997)","DOI":"10.1145\/258533.258583"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix Multiplication via Arithmetic Progressions. J. of Symbolic Computation 9, 251\u2013280 (1990)","journal-title":"J. of Symbolic Computation"},{"issue":"5","key":"5_CR4","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539703428002","volume":"34","author":"A De Bonis","year":"2005","unstructured":"De Bonis, A., Gasieniec, L., Vaccaro, U.: Optimal Two-Stage Algorithms for Group Testing Problems. SIAM Journal on Computing 34(5), 1253\u20131270 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Ding, C., Karlsson, C., Liu, H., Davies, T., Chen, Z.: Matrix Multiplication on GPUs with On-Line Fault Tolerance. In: Proc. of the 9th IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA 2011), Busan, Korea, May 26\u201328 (2011)","DOI":"10.1109\/ISPA.2011.50"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and its Applications World Scientific Publishing, NJ (1993)","DOI":"10.1142\/1936"},{"key":"5_CR7","unstructured":"Freivalds, R.: Probabilistic Machines Can Use Less Running Time. IFIP Congress pp. 839\u2013842 (1977)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Le Gall, F.: Powers of Tensors and Fast Matrix Multiplication. In: Proc. 39th International Symposium on Symbolic and Algebraic Computation, (ISSAC 2014), pp. 296\u2013303 (2014)","DOI":"10.1145\/2608628.2608664"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0020-0190(93)90224-W","volume":"45","author":"T Kimbrel","year":"1993","unstructured":"Kimbrel, T., Sinha, R.K.: A probabilistic algorithm for verifying matrix products using $$O(n^2)$$ time and $$\\log _2n+O(1)$$ random bits. Information Processing Letters 45, 107\u2013119 (1993)","journal-title":"Information Processing Letters"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-319-04298-5_33","volume-title":"SOFSEM 2014: Theory and Practice of Computer Science","author":"I Korec","year":"2014","unstructured":"Korec, I., Wiedermann, J.: Deterministic Verification of Integer Matrix Multiplication in Quadratic Time. In: Geffert, V., Preneel, B., Rovan, B., \u0160tuller, J., Tjoa, A.M. (eds.) SOFSEM 2014. LNCS, vol. 8327, pp. 375\u2013382. Springer, Heidelberg (2014)"},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.cosrev.2010.09.009","volume":"5","author":"RM McConnell","year":"2011","unstructured":"McConnell, R.M., Mehlhorn, K., N\u00e4her, S., Schweitzer, P.: Certifying algorithms. Computer Science Review 5(2), 119\u2013161 (2011)","journal-title":"Computer Science Review"},{"issue":"4","key":"5_CR12","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"J Naor","year":"1993","unstructured":"Naor, J., Naor, M.: Small-Bias Probability Spaces: Efficient Constructions and Applications. SIAM J. Comput. 22(4), 838\u2013856 (1993)","journal-title":"SIAM J. Comput."},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V Strassen","year":"1969","unstructured":"Strassen, V.: Gaussian elimination is not optimal. Numerische Mathematik 13, 354\u2013356 (1969)","journal-title":"Numerische Mathematik"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Vassilevska Williams, V.: Multiplying matrices faster than Coppersmith-Winograd. In: Proc. ACM STOC, pp. 887\u2013898 (2012)","DOI":"10.1145\/2213977.2214056"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Vassilevska Williams, V., Williams, R.: Subcubic Equivalences between Path, Matrix and Triangle Problems. In: Proc. IEEE FOCS 2010, pp. 645\u2013654 (2010)","DOI":"10.1109\/FOCS.2010.67"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Wu, P., Ding, C., Chen, L., Gao, F., Davies, T., Karlsson, C., Chen, Z.: Fault Tolerant Matrix-Matrix Multiplication: Correcting Soft Errors On-Line. In: Proc. of the 2011 Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems (ScalA) held in conjunction with the 24th IEEE\/ACM International Conference on High Performance Computing, Networking, Storage and Analysis (SC 2011) (2011)","DOI":"10.1145\/2133173.2133185"},{"issue":"6","key":"5_CR17","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/j.jocs.2013.05.002","volume":"4","author":"P Wu","year":"2013","unstructured":"Wu, P., Ding, C., Chen, L., Gao, F., Davies, T., Karlsson, C., Chen, Z.: On-Line Soft Error Correction in Matrix-Matrix Multiplication. Journal of Computational Science 4(6), 465\u2013472 (2013)","journal-title":"Journal of Computational Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13075-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T10:21:05Z","timestamp":1675246865000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13075-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319130743","9783319130750"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13075-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}