{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:33:27Z","timestamp":1754109207239,"version":"3.37.3"},"reference-count":31,"publisher":"Informa UK Limited","issue":"1","funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ECCS-1810314"],"award-info":[{"award-number":["ECCS-1810314"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Computer Mathematics: Computer Systems Theory"],"published-print":{"date-parts":[[2021,1,2]]},"DOI":"10.1080\/23799927.2020.1861104","type":"journal-article","created":{"date-parts":[[2020,12,14]],"date-time":"2020-12-14T18:48:52Z","timestamp":1607971732000},"page":"54-93","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":2,"title":["Randomization of approximate bilinear computation for matrix multiplication"],"prefix":"10.1080","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4477-481X","authenticated-orcid":false,"given":"Osman Asif","family":"Malik","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics, University of Colorado Boulder, Boulder, CO, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1932-8159","authenticated-orcid":false,"given":"Stephen","family":"Becker","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics, University of Colorado Boulder, Boulder, CO, USA"}]}],"member":"301","published-online":{"date-parts":[[2020,12,30]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1137\/15M1032168"},{"key":"CIT0002","doi-asserted-by":"crossref","unstructured":"A.R. Benson, G. Ballard.A framework for practical parallel fast matrix multiplication, SIGPLAN Not., Vol. 50, ACM, New York, 2015, pp. 42\u201353.","DOI":"10.1145\/2858788.2688513"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1007\/BF02575865"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1007\/BF01395989"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90113-3"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1137\/0209053"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1016\/S0885-064X(02)00007-9"},{"key":"CIT0008","doi-asserted-by":"crossref","unstructured":"R.P. Brent,Algorithms for matrix multiplication, Tech. Rep. STAN-CS-70-157, Stanford University, 1970.","DOI":"10.21236\/AD0705509"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1007\/BF02308867"},{"key":"CIT0010","doi-asserted-by":"crossref","unstructured":"P. B\u00fcrgisser, M. Clausen, M.A. Shokrollahi,Algebraic Complexity Theory, Vol. 315, Springer-Verlag Berlin Heidelberg, Berlin, 1997.","DOI":"10.1007\/978-3-662-03338-8"},{"key":"CIT0011","unstructured":"R.R. Castrapel and J.L. Gustafson,Precision improvement method for the Strassen\/Winograd matrix multiplication method, U.S. Patent No. 7209939B2, 2007, pp. 1\u201311."},{"key":"CIT0012","doi-asserted-by":"crossref","unstructured":"H. De Silva, J.L. Gustafson, and W.F. Wong,Making Strassen matrix multiplication safe, in2018 IEEE 25th International Conference on High Performance Computing (HiPC), IEEE, 2018, pp. 173\u2013182.","DOI":"10.1109\/HiPC.2018.00028"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-007-0114-x"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-007-0061-6"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442684"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1007\/s002110050348"},{"key":"CIT0017","first-page":"3964","volume":"17","author":"Elser V.","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"CIT0018","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","volume-title":"Matrix Computations","author":"Golub G.H.","year":"2013","edition":"4"},{"key":"CIT0019","unstructured":"S. Gupta, A. Agrawal, K. Gopalakrishnan, P. Narayanan,Deep learning with limited numerical precision, in International Conference on Machine Learning, Lille, France, 2015, pp. 1737\u20131746."},{"key":"CIT0020","unstructured":"M. Hopkins, M. Mikaitis, D.R. Lester, and S. Furber,Stochastic rounding and reduced-precision fixed-point arithmetic for solving neural ODEs, preprint (2019). Available at arXiv:1904.11263."},{"key":"CIT0021","unstructured":"J. Huang, C.D. Yu, and R.A. van de Geijn,Implementing Strassen's algorithm with CUTLASS on NVIDIA Volta GPUs, (2018). Available at arXiv:1808.07984 [cs]."},{"key":"CIT0022","doi-asserted-by":"crossref","unstructured":"S. Huss-Lederman, E.M. Jacobson, J.R. Johnson, A. Tsao, and T. Turnbull,Implementation of Strassen's algorithm for matrix multiplication, inSupercomputing'96: Proceedings of the 1996 ACM\/IEEE Conference on Supercomputing, IEEE, 1996, pp. 32\u201332.","DOI":"10.1145\/369028.369096"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1137\/0215043"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.01.004"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1976-13988-2"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1145\/2493252.2493254"},{"key":"CIT0027","doi-asserted-by":"crossref","unstructured":"S.I. Resnick,A Probability Path, Modern Birkh\u00e4user Classics, Birkh\u00e4user, Basel, 2014.","DOI":"10.1007\/978-0-8176-8409-9"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176996102"},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542513120129"},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"CIT0031","unstructured":"N. Wang, J. Choi, D. Brand, C.Y. Chen, K. Gopalakrishnan,Training deep neural networks with 8-bit floating point numbers, inAdvances in Neural Information Processing Systems, Montr\u00e9al, Canada.\u00a0Curran Associates, Inc., New York, 2018, pp. 7675\u20137684."}],"container-title":["International Journal of Computer Mathematics: Computer Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/23799927.2020.1861104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T07:36:04Z","timestamp":1697355364000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/23799927.2020.1861104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,30]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1,2]]}},"alternative-id":["10.1080\/23799927.2020.1861104"],"URL":"https:\/\/doi.org\/10.1080\/23799927.2020.1861104","relation":{},"ISSN":["2379-9927","2379-9935"],"issn-type":[{"type":"print","value":"2379-9927"},{"type":"electronic","value":"2379-9935"}],"subject":[],"published":{"date-parts":[[2020,12,30]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tcom20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tcom20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2020-02-24","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-05-20","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-11-29","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-12-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}