{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:50:55Z","timestamp":1773377455288,"version":"3.50.1"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849317","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"722-726","source":"Crossref","is-referenced-by-count":24,"title":["Coded Matrix Multiplication on a Group-Based Model"],"prefix":"10.1109","author":[{"given":"Muah","family":"Kim","sequence":"first","affiliation":[{"name":"School of Electrical Engineering, KAIST, Daejeon, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jy-yong","family":"Sohn","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering, KAIST, Daejeon, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaekyun","family":"Moon","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering, KAIST, Daejeon, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262778"},{"key":"ref11","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":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262883"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437669"},{"key":"ref15","year":"0"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref17","first-page":"1","article-title":"Shufflewatcher: Shuffle-aware scheduling in multi-tenant mapreduce clusters","author":"ahmad","year":"2014","journal-title":"USENIX Annual Technical Conference"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2010.72"},{"key":"ref19","first-page":"7","article-title":"Improving mapreduce performance in heterogeneous environments","volume":"8","author":"zaharia","year":"2008","journal-title":"OSDI"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437549"},{"key":"ref5","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":"ref8","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"International Conference on Machine Learning"},{"key":"ref7","first-page":"4302","article-title":"Gradient coding from cyclic mds codes and expander graphs","author":"raviv","year":"0"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref1","first-page":"1223","article-title":"Large scale distributed deep networks","author":"dean","year":"2012","journal-title":"Advances in neural information processing systems"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849317"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2016.7606866"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437467"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849317.pdf?arnumber=8849317","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:33:46Z","timestamp":1773347626000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/ieeexplore.ieee.org\/document\/8849317\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":22,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1109\/isit.2019.8849317","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}