{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T14:45:28Z","timestamp":1775745928944,"version":"3.50.1"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/allerton.2017.8262882","type":"proceedings-article","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T23:03:47Z","timestamp":1516316627000},"page":"1264-1270","source":"Crossref","is-referenced-by-count":58,"title":["On the optimal recovery threshold of coded matrix multiplication"],"prefix":"10.1109","author":[{"given":"Mohammad","family":"Fahim","sequence":"first","affiliation":[]},{"given":"Haewon","family":"Jeong","sequence":"additional","affiliation":[]},{"given":"Farzin","family":"Haddadpour","sequence":"additional","affiliation":[]},{"given":"Sanghamitra","family":"Dutta","sequence":"additional","affiliation":[]},{"given":"Viveck","family":"Cadambe","sequence":"additional","affiliation":[]},{"given":"Pulkit","family":"Grover","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541612"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7848828"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2017.33"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852225"},{"key":"ref14","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"Proc of the International Conference on Machine Learning (ICML)"},{"key":"ref15","author":"raviv","year":"2017","journal-title":"Gradient coding from cyclic MDS codes and expander graphs"},{"key":"ref16","author":"fatih aktas","year":"2017","journal-title":"Effective straggler mitigation Which clones should attack and when?"},{"key":"ref17","author":"fatih aktas","year":"2017","journal-title":"Straggler mitigation by delayed relaunch of tasks"},{"key":"ref18","author":"aliasgari","year":"2017","journal-title":"Coded computation against straggling decoders for network function virtualization"},{"key":"ref19","author":"reisizadehmobarakeh","year":"2017","journal-title":"Coded computation over heterogeneous clusters"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"ref4","author":"yu","year":"2017","journal-title":"Polynomial codes an optimal design for high-dimensional coded matrix multiplication"},{"key":"ref27","author":"kung","year":"1973","journal-title":"Fast evaluation and interpolation"},{"key":"ref3","article-title":"Gradient coding","author":"tandon","year":"2016","journal-title":"Machine Learning Systems Workshop Advances in Neural Information Processing Systems (NIPS)"},{"key":"ref6","first-page":"2092","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF03167332"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140518"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852335"},{"key":"ref7","article-title":"Consensus-based distributed computing","author":"azian-ruhi","year":"2017","journal-title":"Information Theory and Applications Workshop"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447112"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2692244"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541478"},{"key":"ref20","author":"halbawi","year":"2017","journal-title":"Improving distributed gradient descent using Reed-Solomon codes"},{"key":"ref22","article-title":"Coding method for parallel iterative linear solver","author":"yang","year":"2017","journal-title":"NIPS 2017"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007058"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262881"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676475"}],"event":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","location":"Monticello, IL, USA","start":{"date-parts":[[2017,10,3]]},"end":{"date-parts":[[2017,10,6]]}},"container-title":["2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8253908\/8262705\/08262882.pdf?arnumber=8262882","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,28]],"date-time":"2018-02-28T21:51:54Z","timestamp":1519854714000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8262882\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/allerton.2017.8262882","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}