15 citations · 20 across the 7 of their papers we have counts for
9 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…
Computable Bounds and Monte Carlo Estimates of the Expected Edit Distance
Gianfranco Bilardi, Michele Schimd
The edit distance is a metric of dissimilarity between strings, widely applied in computational biology, speech recognition, and machine learning. Let denote the average e…
The DAG Visit approach for Pebbling and I/O Lower Bounds
Gianfranco Bilardi, Lorenzo De Stefani
We introduce the notion of an -visit of a Directed Acyclic Graph DAG , a sequence of the vertices of the DAG complying with a given rule . A rule specifies for e…
Encrypted Data Processing
Jessica Tseng, Gianfranco Bilardi, Kattamuri Ekanadham +3
In this paper, we present a comprehensive architecture for confidential computing, which we show to be general purpose and quite efficient. It executes the application as is, witho…
A Lower Bound Technique for Communication in BSP
Gianfranco Bilardi, Michele Scquizzato, Francesco Silvestri
Communication is a major factor determining the performance of algorithms on current computing systems; it is therefore valuable to provide tight lower bounds on the communication…
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…
Network-Oblivious Algorithms
Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci +2
A framework is proposed for the design and analysis of \emph{network-oblivious algorithms}, namely, algorithms that can run unchanged, yet efficiently, on a variety of machines cha…
Optimal Eviction Policies for Stochastic Address Traces
Gianfranco Bilardi, Francesco Versaci
The eviction problem for memory hierarchies is studied for the Hidden Markov Reference Model (HMRM) of the memory trace, showing how miss minimization can be naturally formulated i…
QCD on the Cell Broadband Engine
F. Belletti, G. Bilardi, M. Drochner +16
We evaluate IBM's Enhanced Cell Broadband Engine (BE) as a possible building block of a new generation of lattice QCD machines. The Enhanced Cell BE will provide full support of do…