ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2408.14558
  4. Cited By
A sparsity-aware distributed-memory algorithm for sparse-sparse matrix
  multiplication

A sparsity-aware distributed-memory algorithm for sparse-sparse matrix multiplication

26 August 2024
Yuxi Hong
A. Buluç
ArXivPDFHTML

Papers citing "A sparsity-aware distributed-memory algorithm for sparse-sparse matrix multiplication"

2 / 2 papers shown
Title
Communication-Avoiding and Memory-Constrained Sparse Matrix-Matrix
  Multiplication at Extreme Scale
Communication-Avoiding and Memory-Constrained Sparse Matrix-Matrix Multiplication at Extreme Scale
Md Taufique Hussain
Oguz Selvitopi
A. Buluç
A. Azad
MoE
26
15
0
16 Oct 2020
Scaling betweenness centrality using communication-efficient sparse
  matrix multiplication
Scaling betweenness centrality using communication-efficient sparse matrix multiplication
Edgar Solomonik
Maciej Besta
Flavio Vella
Torsten Hoefler
51
77
0
22 Sep 2016
1