1 citations · 1 across the 3 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.CC2019
On the I/O complexity of hybrid algorithms for Integer Multiplication
Lorenzo De Stefani
Almost asymptotically tight lower bounds are derived for the Input/Output (I/O) complexity of a general class of hybrid algorithms computing the pr…
cs.DS2019
The I/O complexity of hybrid algorithms for square matrix multiplication
Lorenzo De Stefani
Asymptotically tight lower bounds are derived for the I/O complexity of a general class of hybrid algorithms computing the product of square matrices combining ``\emph…