Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity-Reference-Cited by-同舟云学术

Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity

Published:2024-06-17 Issue: Volume: Page:305-307
ISSN:
Container-title:Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Gupta Chetan¹^ORCID,Korhonen Janne H.²^ORCID,Studený Jan³^ORCID,Suomela Jukka³^ORCID,Vahidi Hossein³^ORCID

Affiliation:

1. IIT Roorkee, Roorkee, India

2. Unaffiliated, Helsinki, Finland

3. Aalto University, Espoo, Finland

Funder

Research Council of Finland

Publisher

ACM

Link

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

Reference11 articles.

1. John Augustine, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Christian Scheideler, Fabian Kuhn, and Jason Li. 2019. Distributed Computation in Node-Capacitated Networks. In SPAA 2019.

2. Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, and Dean Leitersdorf. 2021. Fast approximate shortest paths in the congested clique. Distributed Computing (2021).

3. Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, and Jukka Suomela. 2019. Algebraic methods in the congested clique. Distributed Computing (2019).

4. Keren Censor-Hillel, Dean Leitersdorf, and Elia Turner. 2018. Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model. In OPODIS 2019.

5. Klaus-Tycho Foerster, Juho Hirvonen, Stefan Schmid, and Jukka Suomela. 2019a. On the Power of Preprocessing in Decentralized Network Optimization. In INFOCOM 2019.

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

1. Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17