Marco Pulimeno

activity

20142026

most citedA Parallel Space Saving Algorithm For Frequent Items and the Hurwitz zeta distribution

28 citations · 50 across the 9 of their papers we have counts for

collaborators

Showing cs.DCShow all

2 papers · 1 filter

cs.DC2018

Distributed mining of time--faded heavy hitters

Marco Pulimeno, Italo Epicoco, Massimo Cafaro

We present \textsc{P2PTFHH} (Peer--to--Peer Time--Faded Heavy Hitters) which, to the best of our knowledge, is the first distributed algorithm for mining time--faded heavy hitters…

cs.DC2016

Parallel Space Saving on Multi and Many-Core Processors

Massimo Cafaro, Marco Pulimeno, Italo Epicoco +1

Given an array $A$ of $n$ elements and a value $2 \leq k \leq n$ , a frequent item or $k$ -majority element is an element occurring in $A$ more than $n / k$ times.…