Faster Matrix Multiplication via Sparse Decomposition-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Faster Matrix Multiplication via Sparse Decomposition

Published:2019-06-17 Issue: Volume: Page:
ISSN:
Container-title:The 31st ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Beniamini Gal¹,Schwartz Oded¹

Affiliation:

1. The Hebrew University of Jerusalem, Jerusalem, Israel

Funder

United States - Israel Binational Science Foundation

The Federman Cyber Security Center in conjunction with the Israel national cyber directorate

Israel Science Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3323165.3323188

Reference37 articles.

1. On the exact and approximate bilinear complexities of multiplication of 4×2 and 2×2 matrices

2. Communication-optimal parallel algorithm for strassen's matrix multiplication

3. A framework for practical parallel fast matrix multiplication

4. Dario Andrea Bini Milvio Capovani Francesco Romani and Grazia Lotti. 1979. O(n^2.7799) Complexity for nxn approximate matrix multiplication. Information processing letters Vol. 8 5 (1979) 234--235. Dario Andrea Bini Milvio Capovani Francesco Romani and Grazia Lotti. 1979. O(n^2.7799) Complexity for nxn approximate matrix multiplication. Information processing letters Vol. 8 5 (1979) 234--235.

5. A Strassen-like matrix multiplication suited for squaring and higher power computation

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Alternative Basis Matrix Multiplication is Fast and Stable;2024 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2024-05-27

2. A Multilinear Generalization of Yates's Algorithm;2024

3. Minimizing I/O in Toom-Cook Algorithms;Lecture Notes in Computer Science;2024

4. Pebbling Game and Alternative Basis for High Performance Matrix Multiplication;SIAM Journal on Scientific Computing;2023-11-15

5. Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation;Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation;2023-07-24

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3