21 citations · 27 across the 7 of their papers we have counts for
10 papers
A universal bound on the space complexity of Directed Acyclic Graph computations
Gianfranco Bilardi, Lorenzo De Stefani
It is shown that pebbles are sufficient to pebble any DAG , with edges and maximum in-degree . It was previously known that $S…
On the I/O Complexity of the CYK Algorithm and of a Family of Related DP Algorithms
Lorenzo De Stefani, Vedant Gupta
Asymptotically tight lower bounds are derived for the Input/Output (I/O) complexity of a class of dynamic programming algorithms including matrix chain multiplication, optimal poly…
Communication-Optimal Parallel Standard and Karatsuba Integer Multiplication in the Distributed Memory Model
Lorenzo De Stefani
We present COPSIM a parallel implementation of standard integer multiplication for the distributed memory setting, and COPK a parallel implementation of Karatsuba's fast integer mu…
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…
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…
VizRec: A framework for secure data exploration via visual representation
Lorenzo De Stefani, Leonhard F. Spiegelberg, Tim Kraska +1
Visual representations of data (visualizations) are tools of great importance and widespread use in data analytics as they provide users visual insight to patterns in the observed…