{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T15:23:31Z","timestamp":1771514611217,"version":"3.50.1"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100003968","name":"Iran National Science Foundation","doi-asserted-by":"publisher","award":["98019168"],"award-info":[{"award-number":["98019168"]}],"id":[{"id":"10.13039\/501100003968","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1109\/jsait.2021.3085676","type":"journal-article","created":{"date-parts":[[2021,6,3]],"date-time":"2021-06-03T22:50:38Z","timestamp":1622760638000},"page":"1002-1011","source":"Crossref","is-referenced-by-count":13,"title":["Optimal Communication-Computation Trade-Off in Heterogeneous Gradient Coding"],"prefix":"10.1109","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9198-660X","authenticated-orcid":false,"given":"Tayyebeh","family":"Jahani-Nezhad","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3222-1874","authenticated-orcid":false,"given":"Mohammad Ali","family":"Maddah-Ali","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","author":"jahani-nezhad","year":"2020","journal-title":"Berrut approximated coded computing Straggler resistance beyond polynomial computing"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.jat.2013.01.004"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/S0898-1221(97)00034-5"},{"key":"ref32","volume":"101","author":"cheney","year":"2009","journal-title":"A Course in Approximation Theory"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/100797291"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/3-7643-7356-3_3"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/080741574"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-010-9399-4"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(88)90067-3"},{"key":"ref34","author":"carothers","year":"1998","journal-title":"A Short Course on Approximation Theory"},{"key":"ref10","first-page":"4403","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Proc Conf Adv Neural Inf Process Syst (NIPS)"},{"key":"ref40","first-page":"1","article-title":"On the backward stability of the second barycentric formula for interpolation","volume":"7","author":"mascarenhas","year":"2014","journal-title":"Dolomites Research Notes on Approximation"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3068165"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2927558"},{"key":"ref15","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn (ICML)"},{"key":"ref16","first-page":"5610","article-title":"Communication-computation efficient gradient coding","author":"ye","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919966"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2991361"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029396"},{"key":"ref28","author":"davis","year":"1975","journal-title":"Interpolation and Approximation"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF03167332"},{"key":"ref3","first-page":"19","article-title":"Communication efficient distributed machine learning with the parameter server","author":"li","year":"2014","journal-title":"Proc Conf Adv Neural Inf Process Syst"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3154503"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF01398878"},{"key":"ref5","first-page":"118","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","author":"blanchard","year":"2017","journal-title":"Proc 31st Int Conf Neural Inf Process Syst"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447112"},{"key":"ref7","first-page":"903","article-title":"DRACO: Byzantine-resilient distributed training via redundant gradients","author":"chen","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488393"},{"key":"ref9","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","author":"yu","year":"2019","journal-title":"Proc 22nd Int Conf Artif Intell Stat"},{"key":"ref1","first-page":"1223","article-title":"Large scale distributed deep networks","author":"dean","year":"2012","journal-title":"Proc Conf Adv Neural Inf Process Syst"},{"key":"ref20","author":"glasgow","year":"2020","journal-title":"Approximate gradient coding with optimal decoding"},{"key":"ref22","author":"wang","year":"2019","journal-title":"ErasureHead Distributed gradient descent without delays using approximate gradient coding"},{"key":"ref21","author":"charles","year":"2017","journal-title":"Approximate Gradient Coding via Sparse Random Graphs"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2018.00137"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3366700"},{"key":"ref26","author":"lin","year":"2004","journal-title":"Error Control Coding"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2019.00062"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/9540917\/09446527.pdf?arnumber=9446527","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T23:18:04Z","timestamp":1637191084000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9446527\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":40,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/jsait.2021.3085676","relation":{},"ISSN":["2641-8770"],"issn-type":[{"value":"2641-8770","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9]]}}}