Fetching the paper…
Reading the bibliography…
We consider the problem of coded computing, where a computational task is performed in a distributed fashion in the presence of adversarial workers.
P. Elias, “List decoding for noisy channels,” 1957
1957
Earlier work this paper cites.
J. M. Wozencraft, “List decoding,” Quarterly Progress Report , vol. 48, pp. 90–95, 1958
1958
Earlier work this paper cites.
O. Goldreich and L. A. Levin, “A hard-core predicate for all one-way functions,” in Proceedings of the twenty-first annual ACM symposium on Theory of computing , 1989, pp. 25–32
1989
Earlier work this paper cites.
P. Elias, “Error-correcting codes for list decoding,” IEEE Trans. Inf. Theory , vol. 37, no. 1, pp. 5–12, 1991
1991
Earlier work this paper cites.
M. Sudan, “Decoding of Reed Solomon codes beyond the error-correction bound,” Journal of complexity , vol. 13, no. 1, pp. 180–193, 1997
1997
Earlier work this paper cites.
V. Guruswami and M. Sudan, “Improved decoding of Reed-Solomon and algebraic-geometric codes,” in 39th Annual Symposium on Foundations of Computer Science (Cat. No. 98CB36280) . IEEE, 1998, pp. 28–37
1998
Earlier work this paper cites.
V. Pan, Structured matrices and polynomials: unified superfast algorithms . Springer Science & Business Media, 2001
2001
Earlier work this paper cites.
V. Guruswami, J. Hastad, M. Sudan, and D. Zuckerman, “Combinatorial bounds for list decoding,” IEEE Trans. Inf. Theory , vol. 48, no. 5, pp. 1021–1034, 2002
2002
Earlier work this paper cites.
V. Guruswami, “List decoding with side information,” in 18th IEEE Annual Conference on Computational Complexity, 2003 , pp. 300–309
2003
Earlier work this paper cites.
F. Parvaresh and A. Vardy, “Correcting errors beyond the Guruswami-Sudan radius in polynomial time,” Proceedings of 46th Annual Symposium on Foundations of Computer Science , pp. 285–294, 2005
2005
Earlier work this paper cites.
V. Guruswami and A. Rudra, “Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy,” IEEE Trans. Inf. Theory , vol. 54, no. 1, pp. 135–150, 2008
2008
Earlier work this paper cites.
R. E. Blahut, Algebraic codes on lines, planes, and curves: an engineering approach . Cambridge University Press, 2008
2008
Earlier work this paper cites.
V. Guruswami, “Linear-algebraic list decoding of folded Reed-Solomon codes,” in 2011 IEEE 26th Annual Conference on Computational Complexity , pp. 77–85
2011
Earlier work this paper cites.
S. Saraf and S. Yekhanin, “Noisy interpolation of sparse polynomials, and applications,” in 2011 IEEE 26th Annual Conference on Computational Complexity . IEEE, 2011, pp. 86–92
2011
Earlier work this paper cites.
A. McAfee, E. Brynjolfsson, T. H. Davenport, D. Patil, and D. Barton, “Big data: the management revolution,” Harvard business review , vol. 90, no. 10, pp. 60–68, 2012
2012
Earlier work this paper cites.
V. Guruswami and C. Wang, “Linear-algebraic list decoding for variants of Reed-Solomon codes,” IEEE Trans. Inf. Theory , vol. 59, no. 6, pp. 3257–3268, 2013
2013
Earlier work this paper cites.
W. Raghupathi and V. Raghupathi, “Big data analytics in healthcare: promise and potential,” Health information science and systems , vol. 2, no. 1, p. 3, 2014
2014
Earlier work this paper cites.
S. Kopparty, “List-decoding multiplicity codes,” Theory of Computing , vol. 11, no. 1, pp. 149–182, 2015
2015
Earlier work this paper cites.
R. Cramer, I. B. Damgrd, N. Döttling, S. Fehr, and G. Spini, “Linear secret sharing schemes from error correcting codes and universal hash functions,” in Annual International Conference on the Theory and Applications of Cryptographic Techniques . Springer, 2015, pp. 313–336
2015
Earlier work this paper cites.
R. Safavi-Naini and P. Wang, “A model for adversarial wiretap channels and its applications,” Journal of information processing , vol. 23, no. 5, pp. 554–561, 2015
2015
Cited alongside, same era.
S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “A unified coding framework for distributed computing with straggling servers,” in 2016 IEEE Globecom Workshops (GC Wkshps) , pp. 1–6
2016
Cited alongside, same era.
V. Guruswami and S. Kopparty, “Explicit subspace designs,” Combinatorica , vol. 36, no. 2, pp. 161–185, 2016
2016
Cited alongside, same era.
S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “Coding for distributed fog computing,” IEEE Commun. Mag. , vol. 55, no. 4, pp. 34–40, 2017
2017
Cited alongside, same era.
Q. Yu, M. Maddah-Ali, and S. Avestimehr, “Polynomial codes: an optimal design for high-dimensional coded matrix multiplication,” Advances in Neural Information Processing Systems , vol. 30, pp. 4403–4413, 2017
S. Dutta, M. Fahim, F. Haddadpour, H. Jeong, V. Cadambe, and P. Grover, “On the optimal recovery threshold of coded matrix multiplication,” IEEE Trans. Inf. Theory , vol. 66, no. 1, pp. 278–301, 2019
2019
Later among the works it cites.
S. Li and S. Avestimehr, “Coded computing: Mitigating fundamental bottlenecks in large-scale distributed computing and machine learning,” Found. Trends Commun. Inf. Theory, vol. 17, no. 1, pp. 1–148. , 2020
2020
Later among the works it cites.
J. So, B. Guler, and S. Avestimehr, “A scalable approach for privacy-preserving collaborative machine learning,” Advances in Neural Information Processing Systems , vol. 33, 2020
2020
Later among the works it cites.
M. Soleymani, H. Mahdavifar, and A. S. Avestimehr, “Privacy-preserving distributed learning in the analog domain,” arXiv preprint:2007.08803 , 2020
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2017
Cited alongside, same era.
K. Lee, M. Lam, R. Pedarsani, D. Papailiopoulos, and K. Ramchandran, “Speeding up distributed machine learning using codes,” IEEE Trans. Inf. Theory , vol. 64, no. 3, pp. 1514–1529, 2018
2018
Cited alongside, same era.
M. Aliasgari, J. Kliewer, and O. Simeone, “Coded computation against straggling decoders for network function virtualization,” in 2018 IEEE International Symposium on Information Theory (ISIT) , pp. 711–715
2018
Cited alongside, same era.
S. Dutta, Z. Bai, H. Jeong, T. M. Low, and P. Grover, “A unified coded deep neural network training strategy based on generalized polydot codes,” in 2018 IEEE International Symposium on Information Theory (ISIT) . IEEE, 2018, pp. 1585–1589
2018
Cited alongside, same era.
S. Kopparty, N. Ron-Zewi, S. Saraf, and M. Wootters, “Improved decoding of folded reed-solomon and multiplicity codes,” in 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) . IEEE, 2018, pp. 212–223
2018
Cited alongside, same era.
Q. Yu, S. Li, N. Raviv, S. M. M. Kalan, M. Soltanolkotabi, and S. A. Avestimehr, “Lagrange coded computing: Optimal design for resiliency, security, and privacy,” in The 22nd International Conference on Artificial Intelligence and Statistics . PMLR, 2019, pp. 1215–1225
2019
Cited alongside, same era.
M. Cheraghchi, “Nearly optimal robust secret sharing,” Designs, Codes and Cryptography , vol. 87, no. 8, pp. 1777–1796, 2019
2019
Cited alongside, same era.
A. Reisizadeh, S. Prakash, R. Pedarsani, and A. S. Avestimehr, “Coded computation over heterogeneous clusters,” IEEE Trans. Inf. Theory , vol. 65, no. 7, pp. 4227–4242, 2019
2019
Cited alongside, same era.
2020
Later among the works it cites.
S. Prakash, S. Dhakal, M. R. Akdeniz, Y. Yona, S. Talwar, S. Avestimehr, and N. Himayat, “Coded computing for low-latency federated learning over wireless edge networks,” IEEE Journal on Selected Areas in Communications , vol. 39, no. 1, pp. 233–250, 2020
2020
Later among the works it cites.
Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, “Straggler mitigation in distributed matrix multiplication: Fundamental limits and optimal coding,” IEEE Trans. Inf. Theory , vol. 66, no. 3, pp. 1920–1933, 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
M. Aliasgari, O. Simeone, and J. Kliewer, “Private and secure distributed matrix multiplication with flexible communication load,” IEEE Trans. on Information Forensics and Security , vol. 15, pp. 2722–2734, 2020
2020
Later among the works it cites.
R. G. D’Oliveira, S. El Rouayheb, and D. Karpuk, “GASP codes for secure distributed matrix multiplication,” IEEE Trans. Inf. Theory , vol. 66, pp. 4038–4050, 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
J. So, B. Guler, A. S. Avestimehr, and P. Mohassel, “CodedPrivateML: A fast and privacy-preserving framework for distributed machine learning,” IEEE Journal on Selected Areas in Information Theory (JSAIT): Special issue on Privacy and Security of Information Systems , 2021
2021
Closest in time.
J. So, B. Guler, and A. S. Avestimehr, “Turbo-aggregate: Breaking the quadratic aggregation barrier in secure federated learning,” IEEE Journal on Selected Areas in Information Theory (JSAIT): Special issue on Privacy and Security of Information Systems , 2021
2021
Closest in time.
C.-S. Yang, R. Pedarsani, and A. S. Avestimehr, “Edge computing in the dark: Leveraging contextual-combinatorial bandit and coded computing,” IEEE/ACM Transactions on Networking , 2021
2021
Closest in time.
M. Fahim and V. R. Cadambe, “Numerically stable polynomially coded computing,” in IEEE Trans. Inf. Theory , 2021
2021
Closest in time.
M. Soleymani, H. Mahdavifar, and A. S. Avestimehr, “Analog Lagrange coded computing,” IEEE Journal on Selected Areas in Information Theory (JSAIT): Special issue on Privacy and Security of Information Systems , 2021
2021
Closest in time.
C.-S. Yang and A. S. Avestimehr, “Coded computing for secure boolean computations,” IEEE Journal on Selected Areas in Information Theory , vol. 2, no. 1, pp. 326–337, 2021
2021
Closest in time.