Fetching the paper…
Reading the bibliography…
In distributed matrix multiplication, a common scenario is to assign each worker a fraction of the multiplication task, by partitioning the input matrices into smaller submatrices.
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.
S. Winograd, “On multiplication of 2 × \times 2 matrices,” Linear Algebra and its Applications
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.
L. Lamport, R. Shostak, and M. Pease, “The byzantine generals problem,” ACM Trans. Program. Lang. Syst
1982
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.
R. D. Schlichting and F. B. Schneider, “Fail-stop processors: An approach to designing fault-tolerant computing systems,” ACM Trans. Comput. Syst
1983
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.
M. Ben-Or, S. Goldwasser, and A. Wigderson, “Completeness theorems for non-cryptographic fault-tolerant distributed computation,” in Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing
1988
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. Landsberg, “The border rank of the multiplication of 2 × \times 2 matrices is seven,” Journal of the American Mathematical Society
2006
Earlier work this paper cites.
M. Zhou, R. Zhang, W. Xie, W. Qian, and A. Zhou, “Security and privacy in cloud computing: A survey,” in 2010 Sixth International Conference on Semantics, Knowledge and Grids
2010
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.
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.
Springer Science & Business Media, 2013
P. Bürgisser, M. Clausen, and M. A. Shokrollahi, Algebraic complexity theory · 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.
Cambridge university press, 2013
J. Von Zur Gathen and J. Gerhard, Modern computer algebra · 2013
Cited alongside, same era.
No. 5 in Graduate Surveys, Theory of Computing Library, 2013
M. Bläser, Fast Matrix Multiplication · 2013
Cited alongside, same era.
I. Tamo and A. Barg, “A family of optimal locally recoverable codes,” IEEE Transactions on Information Theory
2014
Cited alongside, same era.
2018
Later among the works it cites.
2019
Later among the works it cites.
H. Yang and J. Lee, “Secure distributed computing with straggling servers using polynomial codes,” IEEE Transactions on Information Forensics and Security
2019
Later among the works it cites.
M. Kim and J. Lee, “Private secure coded computation,” arXiv preprint arXiv:1902.00167
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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.
P. Mohassel and Y. Zhang, “Secureml: A system for scalable privacy-preserving machine learning,” in 2017 IEEE Symposium on Security and Privacy (SP)
2017
Cited alongside, same era.
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.
2017
Cited alongside, same era.
2017
Cited alongside, same era.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
Z. Jia and S. A. Jafar, “Generalized cross subspace alignment codes for coded distributed batch matrix multiplication,” 2019
2019
Later among the works it cites.
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
Later among the works it cites.
J. Kakar, S. Ebadifar, and A. Sezgin, “On the capacity and straggler-robustness of distributed secure matrix multiplication,” IEEE Access
2019
Later among the works it cites.
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
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
R. G. D’Oliveira, S. El Rouayheb, D. Heinlein, and D. Karpuk, “Degree tables for secure distributed matrix multiplication,” 2019
2019
Later among the works it cites.
M. Kim, H. Yang, and J. Lee, “Private coded matrix multiplication,” IEEE Transactions on Information Forensics and Security
2019
Later among the works it cites.
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
Later among the works it cites.
H. Jeong, Y. Yang, and P. Grover, “Systematic matrix multiplication codes,” in 2019 IEEE International Symposium on Information Theory (ISIT)
2019
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 Transactions on Information Theory
2020
Closest in time.