Fetching the paper…
Reading the bibliography…
We consider the problem of massive matrix multiplication, which underlies many data analytic applications, in a large-scale distributed system comprising a group of worker nodes.
PhD thesis, Bozeman, MT, USA, 1969
L. E. Cannon, A Cellular Computer to Implement the Kalman Filter Algorithm · 1969
Earlier work this paper cites.
V. Strassen, “Gaussian elimination is not optimal,” Numerische Mathematik
1969
Earlier work this paper cites.
J. Hopcroft and L. Kerr, “On minimizing the number of multiplications necessary for matrix multiplication,” SIAM Journal on Applied Mathematics
1971
Earlier work this paper cites.
J. D. Laderman, “A noncommutative algorithm for multiplying 3 × \times 3 matrices using 23 multiplications,” Bulletin of the American Mathematical Society
1976
Earlier work this paper cites.
V. Y. Pan, “Strassen’s algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations,” in 19th Annual Symposium on Foundations of Computer Science (sfcs 1978)
1978
Earlier work this paper cites.
D. Bini, “Relations between exact and approximate bilinear algorithms. applications,” CALCOLO
1980
Earlier work this paper cites.
A. Schönhage, “Partial and total matrix multiplication,” SIAM Journal on Computing
1981
Earlier work this paper cites.
D. Coppersmith and S. Winograd, “On the asymptotic complexity of matrix multiplication,” in Proceedings of the 22Nd Annual Symposium on Foundations of Computer Science
1981
Earlier work this paper cites.
F. Romani, “Some properties of disjoint sums of tensors related to matrix multiplication,” SIAM Journal on Computing
1982
Earlier work this paper cites.
K.-H. Huang and J. A. Abraham, “Algorithm-based fault tolerance for matrix operations,” IEEE Transactions on Computers
1984
Earlier work this paper cites.
J.-Y. Jou and J. A. Abraham, “Fault-tolerant matrix arithmetic and signal processing on highly concurrent computing structures,” Proceedings of the IEEE
1986
Earlier work this paper cites.
V. Strassen, “The asymptotic spectrum of tensors and the exponent of matrix multiplication,” in Proceedings of the 27th Annual Symposium on Foundations of Computer Science
1986
Earlier work this paper cites.
Computational algebraic complexity editorial
D. Coppersmith and S. Winograd, “Matrix multiplication via arithmetic progressions,” Journal of Symbolic Computation · 1990
Earlier work this paper cites.
J. Choi, D. W. Walker, and J. J. Dongarra, “Pumma: Parallel universal matrix multiplication algorithms on distributed memory concurrent computers,” Concurrency: Practice and Experience
1994
Earlier work this paper cites.
R. A. Van De Geijn and J. Watts, “Summa: scalable universal matrix multiplication algorithm,” Concurrency: Practice and Experience
1997
Earlier work this paper cites.
M. Zaharia, A. Konwinski, A. D. Joseph, R. H. Katz, and I. Stoica, “Improving MapReduce performance in heterogeneous environments,” OSDI
2008
Earlier work this paper cites.
PhD thesis, University of Edinburgh, 2010
A. J. Stothers, On the complexity of matrix multiplication · 2010
Earlier work this paper cites.
E. Solomonik and J. Demmel, “Communication-optimal parallel 2.5d matrix multiplication and lu factorization algorithms,” in Proceedings of the 17th International Conference on Parallel Processing - Volume Part II
2011
Earlier work this paper cites.
C.-E. Drevet, M. Nazrul Islam, and E. Schost, “Optimization techniques for small matrix multiplication,” Theoretical Computer Science
2011
Earlier work this paper cites.
V. V. Williams, “Multiplying matrices faster than coppersmith-winograd,” in In Proc. 44th ACM Symposium on Theory of Computation
2012
Earlier work this paper cites.
J. Dean and L. A. Barroso, “The tail at scale,” Communications of the ACM
2013
Earlier work this paper cites.
No. 5 in Graduate Surveys, Theory of Computing Library, 2013
M. Bläser, Fast Matrix Multiplication · 2013
Cited alongside, same era.
Cambridge university press, 2013
J. Von Zur Gathen and J. Gerhard, Modern computer algebra · 2013
Cited alongside, same era.
A. V. Smirnov, “The bilinear complexity and practical algorithms for matrix multiplication,” Computational Mathematics and Mathematical Physics
2013
Cited alongside, same era.
2015
Cited alongside, same era.
S. Dutta, V. Cadambe, and P. Grover, “Short-dot: Computing large linear transforms distributedly using coded short dot products,” in Advances In Neural Information Processing Systems
2016
Cited alongside, same era.
A. Reisizadeh, S. Prakash, R. Pedarsani, and A. S. Avestimehr, “Coded computation over heterogeneous clusters,” IEEE Transactions on Information Theory
2019
Closest in time.
H. Yang and J. Lee, “Secure distributed computing with straggling servers using polynomial codes,” IEEE Transactions on Information Forensics and Security
2019
Closest in time.
R. G. L. D’Oliveira, S. El Rouayheb, and D. Karpuk, “Gasp codes for secure distributed matrix multiplication,” in 2019 IEEE International Symposium on Information Theory (ISIT)
2019
Closest in time.
2019
Closest in time.
M. Kim and J. Lee, “Private secure coded computation,” arXiv preprint arXiv:1902.00167
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
2016
Cited alongside, same era.
Q. Yu, M. Maddah-Ali, and S. Avestimehr, “Polynomial codes: an optimal design for high-dimensional coded matrix multiplication,” in Advances in Neural Information Processing Systems 30
2017
Cited alongside, same era.
S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “Coding for distributed fog computing,” IEEE Communications Magazine
2017
Cited alongside, same era.
S. Dutta, V. Cadambe, and P. Grover, “Coded convolution for parallel and distributed computing within a deadline,” in 2017 IEEE International Symposium on Information Theory (ISIT)
2017
Cited alongside, same era.
M. Fahim, H. Jeong, F. Haddadpour, S. Dutta, V. Cadambe, and P. Grover, “On the optimal recovery threshold of coded matrix multiplication,” in 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
2017
Cited alongside, same era.
K. Lee, C. Suh, and K. Ramchandran, “High-dimensional coded matrix multiplication,” in 2017 IEEE International Symposium on Information Theory (ISIT)
2017
Cited alongside, same era.
2019
Closest in time.
J. Kakar, S. Ebadifar, and A. Sezgin, “On the capacity and straggler-robustness of distributed secure matrix multiplication,” IEEE Access
2019
Closest in time.
2019
Closest in time.
S. Ebadifar, J. Kakar, and A. Sezgin, “The need for alignment in rate-efficient distributed two-sided secure matrix computation,” in ICC 2019 - 2019 IEEE International Conference on Communications (ICC)
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
R. G. D’Oliveira, S. El Rouayheb, D. Heinlein, and D. Karpuk, “Degree tables for secure distributed matrix multiplication,” 2019
2019
Closest in time.
M. Kim, H. Yang, and J. Lee, “Private coded matrix multiplication,” IEEE Transactions on Information Forensics and Security
2019
Closest in time.
2019
Closest in time.
Z. Jia and S. A. Jafar, “Generalized cross subspace alignment codes for coded distributed batch matrix multiplication,” 2019
2019
Closest in time.
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 Proceedings of Machine Learning Research
2019
Closest in time.
2019
Closest in time.
Q. Yu and A. S. Avestimehr, “Harmonic coding: An optimal linear code for privacy-preserving gradient-type computation,” in 2019 IEEE International Symposium on Information Theory (ISIT)
2019
Closest in time.