{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:02:56Z","timestamp":1773378176130,"version":"3.50.1"},"reference-count":23,"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\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","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.9834346","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"1010-1015","source":"Crossref","is-referenced-by-count":4,"title":["An Integrated Method to Deal with Partial Stragglers and Sparse Matrices in Distributed Computations"],"prefix":"10.1109","author":[{"given":"Anindya Bijoy","family":"Das","sequence":"first","affiliation":[{"name":"Iowa State University,Department of Electrical and Computer Engineering,Ames,IA,USA,50011"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aditya","family":"Ramamoorthy","sequence":"additional","affiliation":[{"name":"Iowa State University,Department of Electrical and Computer Engineering,Ames,IA,USA,50011"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3095909"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3103822"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2880213"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2974149"},{"key":"ref14","first-page":"5152","article-title":"Coded sparse matrix multiplication","author":"wang","year":"2018","journal-title":"Proc of Intl Conf on Machine Learning (ICML)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3152827"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref17","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":"Proceedings of the ACM on Meas and Analysis of Comp Syst"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3036763"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611400"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref3","first-page":"4403","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Proc of Adv in Neur Inf Proc Syst (NIPS)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849395"},{"key":"ref5","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"Proc of Intl Conf on Machine Learning (ICML)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919859"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849468"},{"key":"ref2","first-page":"2100","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"Proc of Adv in Neur Inf Proc Syst (NIPS)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3137266"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8683267"},{"key":"ref22","first-page":"1","article-title":"Bivariate hermitian¨ polynomial coding for efficient distributed matrix multiplication","author":"has?rc?oglu","year":"2020","journal-title":"Proc IEEE Global Communication Conf (GLOBECOM)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849451"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611400"}],"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\/09834346.pdf?arnumber=9834346","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:38Z","timestamp":1773347798000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834346\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834346","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}