{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:28Z","timestamp":1773377788940,"version":"3.50.1"},"reference-count":22,"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.9174299","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"2556-2561","source":"Crossref","is-referenced-by-count":3,"title":["Reliable Distributed Clustering with Redundant Data Assignment"],"prefix":"10.1109","author":[{"given":"Venkata","family":"Gandikota","sequence":"first","affiliation":[{"name":"University of Massachusetts,College of Information and Computer Sciences,Amherst,MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arya","family":"Mazumdar","sequence":"additional","affiliation":[{"name":"University of Massachusetts,College of Information and Computer Sciences,Amherst,MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ankit Singh","family":"Rawat","sequence":"additional","affiliation":[{"name":"Google Research,New York,NY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"2100","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"Proceedings of The 26th International Conference on Neural Information Processing Systems (NIPS)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.103"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007400"},{"key":"ref13","first-page":"3113","article-title":"Improved distributed principal component analysis","author":"balcan","year":"2014","journal-title":"Proceedings of the 27th International Conference on Neural Information Processing Systems (NIPS)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30538-5_27"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/11590156_8"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060622"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-006-1271-x"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/070699007"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.50"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref3","first-page":"1063","article-title":"Fast distributed k-center clustering with outliers on massive data","author":"malkomes","year":"2015","journal-title":"Proceedings of the Annual Conference on Neural Information Processing Systems (NIPS)"},{"key":"ref6","first-page":"803","article-title":"Slow and stale gradients can win the race: Error-runtime trade-offs in distributed sgd","author":"dutta","year":"2018","journal-title":"Proc AISTATS"},{"key":"ref5","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"Proceedings of the 34th International Conference on International Conference on Machine Learning (ICML)"},{"key":"ref8","first-page":"5440","article-title":"Straggler mitigation in distributed optimization through data encoding","author":"karakus","year":"2017","journal-title":"Proceedings of The 26th International Conference on Neural Information Processing Systems (NIPS)"},{"key":"ref7","article-title":"Approximate gradient coding via sparse random graphs","author":"charles","year":"2017","journal-title":"arXiv preprint arXiv 1711 07128"},{"key":"ref2","article-title":"General and robust communication-efficient algorithms for distributed clustering","volume":"abs 1703 830","author":"awasthi","year":"2017","journal-title":"CoRR"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892124"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993712"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2005.09.012"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.105"}],"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\/09174299.pdf?arnumber=9174299","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:09Z","timestamp":1773347709000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174299\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174299","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}