3 papers
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.DC2026
High-Performance Star-M SVD for Big Data Compression
Md Taufique Hussain, Grey Ballard, Aditya Devarakonda +3
In the era of big data, effectively compressing large datasets while performing complex mathematical operations is crucial. Tensor-based decomposition methods have shown superior c…
cs.DC2025
Distributed-memory Algorithms for Sparse Matrix Permutation, Extraction, and Assignment
Elaheh Hassani, Md Taufique Hussain, Ariful Azad
We present scalable distributed-memory algorithms for sparse matrix permutation, extraction, and assignment. Our methods follow an Identify-Exchange-Build (IEB) strategy where each…