{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T23:05:29Z","timestamp":1768345529256,"version":"3.49.0"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T00:00:00Z","timestamp":1729987200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T00:00:00Z","timestamp":1729987200000},"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":[[2024,10,27]]},"DOI":"10.1109\/ieeeconf60004.2024.10942796","type":"proceedings-article","created":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T18:20:20Z","timestamp":1743790820000},"page":"1453-1460","source":"Crossref","is-referenced-by-count":1,"title":["Communication-Efficient Distributed Computing via Matrix Factorization"],"prefix":"10.1109","author":[{"given":"Seif","family":"Hussein","sequence":"first","affiliation":[{"name":"School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology,Stockholm,Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saeed","family":"Razavikia","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology,Stockholm,Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sajad","family":"Daei","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology,Stockholm,Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlo","family":"Fischione","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology,Stockholm,Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Large scale distributed deep networks","author":"Dean","year":"2012","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139042918"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/icde.2011.5767930"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/HISB.2012.8"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbs088"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2021.3091684"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1561\/0100000103"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref10","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"Yu","year":"2017","journal-title":"CoRR"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2017.2736066"},{"key":"ref12","article-title":"Localnewton: Reducing communication rounds for distributed learning","volume-title":"Proceedings of Machine Learning Research","author":"Gupta","year":"2021"},{"key":"ref13","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"Tandon","year":"2017","journal-title":"ICML"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852225"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3107432"},{"key":"ref17","article-title":"A fundamental tradeoff between computation and commu-nication in distributed computing","author":"Li","year":"2018","journal-title":"IEEE Trans. Info. Theo."},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3127910"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3283967"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref21","article-title":"Coded sparse matrix multiplication","author":"Wang","year":"2018","journal-title":"CoRR"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2019.2929328"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ITW55543.2023.10160241"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/SampTA45681.2019.9030937"},{"key":"ref25","volume-title":"11-magic: Recovery of sparse signals via convex programming","author":"Candes","year":"2005"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/JCN.2013.000083"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2161794"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2009.10.004"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2008.03.014"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2424238"}],"event":{"name":"2024 58th Asilomar Conference on Signals, Systems, and Computers","location":"Pacific Grove, CA, USA","start":{"date-parts":[[2024,10,27]]},"end":{"date-parts":[[2024,10,30]]}},"container-title":["2024 58th Asilomar Conference on Signals, Systems, and Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10942562\/10942606\/10942796.pdf?arnumber=10942796","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T11:11:40Z","timestamp":1743851500000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10942796\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,27]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/ieeeconf60004.2024.10942796","relation":{},"subject":[],"published":{"date-parts":[[2024,10,27]]}}}