L. Stefani

activity

20162024

most citedCommunication-Optimal Parallel Standard and Karatsuba Integer Multiplication in the Distributed Memory Model

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2024

A universal bound on the space complexity of Directed Acyclic Graph computations

Gianfranco Bilardi, Lorenzo De Stefani

It is shown that $S (G) = O (m / lo g_{2} m + d)$ pebbles are sufficient to pebble any DAG $G = (V, E)$ , with $m$ edges and maximum in-degree $d$ . It was previously known that $S…

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 $I O_{A} (n, M)$ of a general class of hybrid algorithms computing the pr…