{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:55:11Z","timestamp":1773377711255,"version":"3.50.1"},"reference-count":37,"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\/501100001809","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CIF 1900750,CAREER 1845852,CCF 1763657"],"award-info":[{"award-number":["CIF 1900750,CAREER 1845852,CCF 1763657"]}],"id":[{"id":"10.13039\/501100001809","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.9517861","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1582-1587","source":"Crossref","is-referenced-by-count":1,"title":["E-Approximate Coded Matrix Multiplication is Nearly Twice as Efficient as Exact Multiplication"],"prefix":"10.1109","author":[{"given":"Viveck R.","family":"Cadambe","sequence":"first","affiliation":[{"name":"Penn State University"}]},{"given":"Flavio P.","family":"Calmon","sequence":"additional","affiliation":[{"name":"Harvard University"}]},{"given":"Ateet","family":"Devulapalli","sequence":"additional","affiliation":[{"name":"Penn State University"}]},{"given":"Haewon","family":"Jeong","sequence":"additional","affiliation":[{"name":"Harvard University"}]}],"member":"263","reference":[{"key":"ref33","article-title":"Berrut Approximated Coded Computing: Straggler Resistance Beyond Polynomial Computing","author":"jahani-nezhad","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849370"},{"key":"ref31","article-title":"Approximate gradient coding via sparse random graphs","author":"charles","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3366700"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919859"},{"key":"ref36","article-title":"Numerically stable coded matrix computations via circulant and rotation matrix embeddings","author":"ramamoorthy","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref35","first-page":"1","article-title":"Numerically Stable Polynomially Coded Computing","author":"fahim","year":"2021","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref34","article-title":"Analog lagrange coded computing","author":"soleymani","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006961"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636047"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262778"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2869791"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852337"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437473"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682347"},{"key":"ref17","first-page":"5139","article-title":"Coded sparse matrix multiplication","author":"wang","year":"0","journal-title":"International Conference on Machine Learning (ICML)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173985"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2877391"},{"key":"ref28","article-title":"Speeding up distributed machine learning using codes","author":"lee","year":"2017","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-018-9482-6"},{"key":"ref3","article-title":"Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication","author":"yu","year":"2017","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"key":"ref6","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","author":"yu","year":"0","journal-title":"In The 22nd International Conference on Artificial Intelligence and Statistics"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref5","first-page":"2100","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":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029396"},{"key":"ref7","first-page":"3368","article-title":"Gradient Coding: Avoiding Stragglers in Distributed Learning","author":"tandon","year":"0","journal-title":"International Conference on Machine Learning (ICML)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006962"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437467"},{"key":"ref1","year":"0","journal-title":"Full version with proofs and detailed numerical results"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8635933"},{"key":"ref22","article-title":"Oversketched newton: Fast convex optimization for serverless systems","author":"gupta","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622139"},{"key":"ref24","author":"li","year":"2020","journal-title":"Coded Computing Mitigating Fundamental Bottlenecks in Large-scale Distributed Computing and Machine Learning Now Foundations and Trends"},{"key":"ref23","first-page":"3","article-title":"Codes for distributed computing: A tutorial","volume":"67","author":"cadambe","year":"2017","journal-title":"IEEE Information Theory Society Newsletter"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2020.2986362"}],"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\/09517861.pdf?arnumber=9517861","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:56Z","timestamp":1773347696000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517861\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517861","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}