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. 2205.13407
  4. Cited By
Tight Memory-Independent Parallel Matrix Multiplication Communication
  Lower Bounds

Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds

26 May 2022
Hussam Al Daas
Grey Ballard
L. Grigori
Suraj Kumar
Kathryn Rouse
ArXiv (abs)PDFHTML

Papers citing "Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds"

2 / 2 papers shown
Title
Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix
  Computations
Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations
Hussam Al Daas
Grey Ballard
L. Grigori
Suraj Kumar
Kathryn Rouse
Mathieu Verite
13
1
0
17 Sep 2024
Communication Lower Bounds and Optimal Algorithms for Multiple
  Tensor-Times-Matrix Computation
Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation
Hussam Al Daas
Grey Ballard
L. Grigori
Suraj Kumar
Kathryn Rouse
30
4
0
21 Jul 2022
1