{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:39Z","timestamp":1773377619333,"version":"3.50.1"},"reference-count":14,"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:\/\/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:\/\/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.8849370","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2489-2493","source":"Crossref","is-referenced-by-count":11,"title":["CodedSketch: Coded Distributed Computation of Approximated Matrix Multiplication"],"prefix":"10.1109","author":[{"given":"Tayyebeh","family":"Jahani-Nezhad","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Sharif University of Technology"}]},{"given":"Mohammad Ali","family":"Maddah-Ali","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Sharif University of Technology"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Lagrange coded computing: Optimal design for resiliency, security and privacy","author":"yu","year":"2018"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2493252.2493254"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454225"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.51"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"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"},{"key":"ref6","first-page":"2092","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":"ref5","first-page":"1264","article-title":"On the optimal recovery threshold of coded matrix multiplication","author":"fahim","year":"2018","journal-title":"Proceedings of 55th Annual Allerton Conference on Communication Control and Computing"},{"key":"ref8","article-title":"Overs-ketch: Approximate matrix multiplication for the cloud","author":"gupta","year":"2018"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437651"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref9","first-page":"8176","article-title":"Coded sparse matrix multiplication","volume":"12","author":"wang","year":"2018","journal-title":"Proc of the International Conference on Machine Learning (ICML)"}],"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":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849370.pdf?arnumber=8849370","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:38Z","timestamp":1773347678000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849370\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849370","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}