{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:29:20Z","timestamp":1761294560951,"version":"3.37.3"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,11,1]]},"DOI":"10.1109\/itw54588.2022.9965859","type":"proceedings-article","created":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T20:47:00Z","timestamp":1670446020000},"page":"428-433","source":"Crossref","is-referenced-by-count":6,"title":["Multi-User Linearly Separable Computation: A Coding Theoretic Approach"],"prefix":"10.1109","author":[{"given":"Ali","family":"Khalesi","sequence":"first","affiliation":[{"name":"Eurecom,Sophia Antipolis,France,06410"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petros","family":"Elia","sequence":"additional","affiliation":[{"name":"Eurecom,Sophia Antipolis,France,06410"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3064827"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref31","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","volume":"29","author":"dutta","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref30","first-page":"1","article-title":"Distributed linearly separable computation","author":"wan","year":"2021","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029396"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849431"},{"key":"ref12","article-title":"Distributed linearly separable computation","author":"wan","year":"2021","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref13","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"International Conference on Machine Learning"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2018.00137"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3056377"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028194"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3102967"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3050853"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437651"},{"article-title":"A survey of coded distributed computing","year":"2020","author":"ng","key":"ref28"},{"key":"ref4","first-page":"265","article-title":"{TensorFlow}: A system for {Large-Scale} machine learning","author":"abadi","year":"2016","journal-title":"12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3107432"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3377454"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3068165"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1561\/9781680837056"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3142358"},{"key":"ref8","article-title":"Coded distributed computing with partial recovery","author":"ozfatura","year":"2021","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611384"},{"key":"ref2","article-title":"Spark: Cluster computing with working sets","author":"zaharia","year":"2010","journal-title":"2nd USENIX Conf on Hot Topics in Cloud Computing (HotCloud'10)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3157835"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3142373"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2017.7996730"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437882"},{"article-title":"Flexible distributed matrix multiplication","year":"2021","author":"li","key":"ref24"},{"key":"ref23","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","volume":"30","author":"yu","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262883"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989097"}],"event":{"name":"2022 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2022,11,1]]},"location":"Mumbai, India","end":{"date-parts":[[2022,11,9]]}},"container-title":["2022 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9965754\/9965755\/09965859.pdf?arnumber=9965859","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T17:31:21Z","timestamp":1681839081000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9965859\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,1]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/itw54588.2022.9965859","relation":{},"subject":[],"published":{"date-parts":[[2022,11,1]]}}}