{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T06:28:15Z","timestamp":1750746495144,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437549","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"1993-1997","source":"Crossref","is-referenced-by-count":52,"title":["Straggler-Proofing Massive-Scale Distributed Matrix Multiplication with D-Dimensional Product Codes"],"prefix":"10.1109","author":[{"given":"Tavor","family":"Baharav","sequence":"first","affiliation":[]},{"given":"Kangwook","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Orhan","family":"Ocal","sequence":"additional","affiliation":[]},{"given":"Kannan","family":"Ramchandran","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Polynomial codes an optimal design for high-dimensional coded matrix multiplication","year":"2017","author":"yu","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/08073408X"},{"journal-title":"Can Schonhage multiplication speed up the RSA decryption or encryption?","year":"2007","author":"garcia","key":"ref12"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/BF02017348","article-title":"A parallel method for fast and practical high-order newton interpolation","volume":"30","author":"egecioglu","year":"1990","journal-title":"BIT"},{"journal-title":"Leaving randomness to nature d-dimensional product codes through the lens of Generalized-LDPC codes","year":"2018","author":"baharav","key":"ref14"},{"journal-title":"Efficient Erasure Decoding of Reed-Solomon Codes","year":"2009","author":"didier","key":"ref15"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3127479.3128601"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262778"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref8","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"ICML"},{"key":"ref7","article-title":"Coding method for parallel iterative linear solver","volume":"abs 1706 163","author":"yang","year":"2017","journal-title":"CoRR"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541478"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006962"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437549.pdf?arnumber=8437549","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T18:26:55Z","timestamp":1598207215000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437549\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437549","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}