{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:43Z","timestamp":1773377803232,"version":"3.50.1"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174239","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"233-238","source":"Crossref","is-referenced-by-count":5,"title":["Straggler-free Coding for Concurrent Matrix Multiplications"],"prefix":"10.1109","author":[{"given":"Pedro","family":"Soto","sequence":"first","affiliation":[{"name":"Florida International University,School of Computing and Information Sciences,Miami,FL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Li","sequence":"additional","affiliation":[{"name":"Florida International University,School of Computing and Information Sciences,Miami,FL"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","article-title":"A Solution to the Network Challenges of Data Recovery in Erasure-coded Distributed Storage Systems: A Study on the Facebook Warehouse Cluster","author":"rashmi","year":"2013","journal-title":"USENIX Workshop on Hot Topics in Storage and File Systems (HotStorage)"},{"key":"ref3","first-page":"3368","article-title":"Gradient Coding: Avoiding Stragglers in Distributed Learning","author":"tandon","year":"2017","journal-title":"International Conference on Machine Learning (ICML)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174230"},{"key":"ref6","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":"ref5","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref8","article-title":"Cross Subspace Alignment Codes for Coded Distributed Batch Computation","author":"jia","year":"0"},{"key":"ref7","article-title":"Lagrange Coded Computing: Optimal Design for Resiliency, Security, and Privacy","author":"yu","year":"2018","journal-title":"Workshop on Systems for ML and Open Source Software at NeurIPS 2018"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT44484.2020.9174167","article-title":"Entangled Polynomial Codes for Secure, Private, and Batch Distributed Matrix Multiplication: Breaking the ”Cubic\" Barrier","author":"yu","year":"2020","journal-title":"IEEE International Symposium on Information Theory (ISIT)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3102980.3103005"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174239.pdf?arnumber=9174239","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:12Z","timestamp":1773347712000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174239\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174239","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}