Showing cs.DCShow all
3 papers · 1 filter
cs.DC2026
Communication Lower Bounds and Algorithms for Sketching with Random Dense Matrices
Hussam Al Daas, Grey Ballard, Laura Grigori +4
Sketching is widely used in randomized linear algebra for low-rank matrix approximation, column subset selection, and many other problems, and it has gained significant traction in…
cs.DC2025
Minimizing Communication for Parallel Symmetric Tensor Times Same Vector Computation
Hussam Al Daas, Grey Ballard, Laura Grigori +3
In this article, we focus on the parallel communication cost of multiplying the same vector along two modes of a -dimensional symmetric tensor. This is a key computation in the…
cs.DC2024
Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations
Hussam Al Daas, Grey Ballard, Laura Grigori +3
In this article, we focus on the communication costs of three symmetric matrix computations: i) multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK) i…