{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:08Z","timestamp":1773377768307,"version":"3.50.1"},"reference-count":15,"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.9174542","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"251-256","source":"Crossref","is-referenced-by-count":6,"title":["Bivariate Polynomial Coding for Straggler Exploitation with Heterogeneous Workers"],"prefix":"10.1109","author":[{"given":"Burak","family":"Has\u0131rc\u0131o\u011flu","sequence":"first","affiliation":[{"name":"Imperial College London,UK"}]},{"given":"Jes\u00fas","family":"G\u00f3mez-Vilardeb\u00f3","sequence":"additional","affiliation":[{"name":"Centre Tecnològic de Telecomunicacions de Catalunya (CTTC\/CERCA),Barcelona,Spain"}]},{"given":"Deniz","family":"G\u00fcnd\u00fcz","sequence":"additional","affiliation":[{"name":"Imperial College London,UK"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref11","first-page":"2418","article-title":"High-dimensional coded matrix multiplication","author":"lee","year":"2018","journal-title":"2017 IEEE International Symposium on Information Theory (ISIT)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8683267"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CWIT.2019.8929896"},{"key":"ref14","article-title":"Bivariate polynomial coding for exploiting stragglers in heterogeneous coded computing systems","author":"hasircioglu","year":"2020"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0088788"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref3","article-title":"On the optimal recovery threshold of coded matrix multiplication","author":"dutta","year":"2018"},{"key":"ref6","article-title":"Cross subspace alignment codes for coded distributed batch computation","author":"jia","year":"2019"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437852"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437473"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref2","first-page":"4403","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"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682911"}],"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\/09174542.pdf?arnumber=9174542","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:06Z","timestamp":1773347706000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174542\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174542","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}