activity
20112026
most citedFast Algorithms for the Computation of the Minimum Distance of a Random Linear Code

17 citations · 55 across the 19 of their papers we have counts for

collaborators
Showing 2018Show all

1 paper · 1 filter

cs.DC2018

Programming Parallel Dense Matrix Factorizations with Look-Ahead and OpenMP

Sandra Catalán, Adrián Castelló, Francisco D. Igual +2

We investigate a parallelization strategy for dense matrix factorization (DMF) algorithms, using OpenMP, that departs from the legacy (or conventional) solution, which simply extra…