1 citations · 1 across the 2 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
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…
cs.DS2017
Tiered Sampling: An Efficient Method for Approximate Counting Sparse Motifs in Massive Graph Streams
Lorenzo De Stefani, Erisa Terolli, Eli Upfal
We introduce Tiered Sampling, a novel technique for approximate counting sparse motifs in massive graphs whose edges are observed in a stream. Our technique requires only a single…
cs.DS2016
The I/O complexity of Strassen's matrix multiplication with recomputation
Gianfranco Bilardi, Lorenzo De Stefani
A tight lower bound is derived on the \io complexity of Strassen's algorithm to multiply two matrices, in a two-level storage hierarchy w…