{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:01:06Z","timestamp":1773378066219,"version":"3.50.1"},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"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 (NSF)","doi-asserted-by":"publisher","award":["CCF-1718470,CCF-1910840"],"award-info":[{"award-number":["CCF-1718470,CCF-1910840"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518059","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1570-1575","source":"Crossref","is-referenced-by-count":11,"title":["Coded sparse matrix computation schemes that leverage partial stragglers"],"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.2020.3036763"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8683267"},{"key":"ref12","first-page":"1","article-title":"Bivariate hermitian polynomial coding for efficient distributed matrix multiplication","author":"has?rc?o?lu","year":"2020","journal-title":"IEEE Global Communications Conference"},{"key":"ref13","article-title":"C3 LES: Codes for coded computation that leverage stragglers","author":"das","year":"0","journal-title":"IEEE Inf Theory Workshop"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849468"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919859"},{"key":"ref16","author":"das","year":"2020","journal-title":"Efficient and robust distributed matrix computations via convolutional coding"},{"key":"ref17","article-title":"Coded sparse matrix computation schemes that leverage partial stragglers","author":"das","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref18","author":"stinson","year":"2007","journal-title":"Combinatorial Designs Constructions and Analysis"},{"key":"ref4","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"0","journal-title":"Proc of Intl Conf on Machine Learning (ICML)"},{"key":"ref3","first-page":"4403","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"0","journal-title":"Proc of Adv in Neur Inf Proc Syst (NIPS)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3366706"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2927558"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref9","first-page":"5152","article-title":"Coded sparse matrix multiplication","author":"wang","year":"0","journal-title":"Proc of Intl Conf on Machine Learning (ICML)"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518059.pdf?arnumber=9518059","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:07Z","timestamp":1773347767000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518059\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518059","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}