Parallel Algorithms

Efficiently parallelizable strassen-based multiplication of a matrix by its transpose
An efficient algorithm for computing the multiplication of a matrix by its transpose, exploiting Strassen-like recursions. The algorithm is designed to be parallelized with multiple paradigms, from multi-threading to distributed computing.
Cite PDF GitHub
Efficiently parallelizable strassen-based multiplication of a matrix by its transpose