{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:03:05Z","timestamp":1773378185422,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834389","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"838-843","source":"Crossref","is-referenced-by-count":0,"title":["Successive Approximation for Coded Matrix Multiplication"],"prefix":"10.1109","author":[{"given":"Shahrzad","family":"Kiani","sequence":"first","affiliation":[{"name":"University of Toronto,Department of Electrical and Computer Engineering,Toronto,ON,Canada"}]},{"given":"Stark C.","family":"Draper","sequence":"additional","affiliation":[{"name":"University of Toronto,Department of Electrical and Computer Engineering,Toronto,ON,Canada"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3050526"},{"key":"ref11","first-page":"5095","article-title":"Approximate weighted cr coded matrix multiplication","author":"charalambides","year":"2021","journal-title":"IEEE Int Conf Acoustics Speech and Signal Processing (ICASSP)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682895"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3068165"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622139"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852337"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262879"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3099811"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3190859"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517750"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3366706","article-title":"Rateless codes for near-perfect load balancing in distributed matrixvector multiplication","volume":"3","author":"mallick","year":"2019","journal-title":"Proc of the ACM on Measurement and Analysis of Computing Sys"},{"key":"ref5","first-page":"726","article-title":"Hierarchical coded matrix multiplication","volume":"67","author":"kiani","year":"2020","journal-title":"IEEE Trans Inf Theory"},{"key":"ref8","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","author":"yu","year":"2019","journal-title":"Int Conf on Artificial Intelligence and Statistics (AISTATS)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref2","first-page":"4406","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Int Conf Neural Inf Proc Sys (NeurIPS)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref9","volume":"37","author":"quarteroni","year":"2010","journal-title":"Numerical Mathematics"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834389.pdf?arnumber=9834389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:40Z","timestamp":1773347800000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834389\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834389","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}