{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:13:34Z","timestamp":1740100414081,"version":"3.37.3"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"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":[[2021,10,17]]},"DOI":"10.1109\/itw48936.2021.9611400","type":"proceedings-article","created":{"date-parts":[[2021,11,23]],"date-time":"2021-11-23T21:46:27Z","timestamp":1637703987000},"page":"1-6","source":"Crossref","is-referenced-by-count":3,"title":["A Unified Treatment of Partial Stragglers and Sparse Matrices in Coded Matrix Computation"],"prefix":"10.1109","author":[{"given":"Anindya Bijoy","family":"Das","sequence":"first","affiliation":[]},{"given":"Aditya","family":"Ramamoorthy","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3095909"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174314"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2974149"},{"key":"ref13","first-page":"5152","article-title":"Coded sparse matrix multiplication","author":"wang","year":"2018","journal-title":"Proc of Intl Conf on Machine Learning (ICML)"},{"key":"ref14","article-title":"Coded sparse matrix computation schemes that leverage partial stragglers","author":"das","year":"2020","journal-title":"Preprint"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3366706"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3036763"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8683267"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849451"},{"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","article-title":"Numerically stable coded matrix computations via circulant and rotation matrix embeddings","author":"ramamoorthy","year":"2019","journal-title":"Preprint"},{"key":"ref20","first-page":"1","article-title":"Bivariate hermitian polynomial coding for efficient distributed matrix multiplication","author":"has?rc?o?lu","year":"2020","journal-title":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613321"}],"event":{"name":"2021 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2021,10,17]]},"location":"Kanazawa, Japan","end":{"date-parts":[[2021,10,21]]}},"container-title":["2021 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9611366\/9611357\/09611400.pdf?arnumber=9611400","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:52:05Z","timestamp":1652201525000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9611400\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,17]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/itw48936.2021.9611400","relation":{},"subject":[],"published":{"date-parts":[[2021,10,17]]}}}