2 citations · 4 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021★ 1 cited
A Heuristic for Direct Product Graph Decomposition
Luca Calderoni, Luciano Margara, Moreno Marzolla
In this paper we describe a heuristic for decomposing a directed graph into factors according to the direct product (also known as Kronecker, cardinal or tensor product). Given a d…
cs.DS2019★ 1 cited
Bloom filter variants for multiple sets: a comparative assessment
Luca Calderoni, Dario Maio, Paolo Palmieri
In this paper we compare two probabilistic data structures for association queries derived from the well-known Bloom filter: the shifting Bloom filter (ShBF), and the spatial Bloom…