8 citations · 11 across the 8 of their papers we have counts for
10 papers
Is competitive online paging an artifact?
Enoch Peserico, Michele Scquizzato
In any real system a newly computed datum begins its existence in the processor rather than in external memory, and thus does not inevitably incur a cold miss. This was captured by…
Matching on the line admits no -competitive algorithm
Enoch Peserico, Michele Scquizzato
We present a simple proof that the competitive ratio of any randomized online matching algorithm for the line is at least for all $n=2^i\!-\!1: i\in\mat…
Deterministic oblivious distribution (and tight compaction) in linear time
Enoch Peserico
In an array of N elements, M positions and M elements are "marked". We show how to permute the elements in the array so that all marked elements end in marked positions, in time O(…
On approximating the stationary distribution of time-reversible Markov chains
Marco Bressan, Enoch Peserico, Luca Pretto
Approximating the stationary probability of a state in a Markov chain through Markov chain Monte Carlo techniques is, in general, inefficient. Standard random walk approaches requi…
Community structure and interaction dynamics through the lens of quotes
Mattia Samory, Enoch Peserico
This is the first work investigating community structure and interaction dynamics through the lens of quotes in online discussion forums. We examine four forums of different size,…
The Power of Local Information in PageRank
Marco Bressan, Enoch Peserico, Luca Pretto
How large a fraction of a graph must one explore to rank a small set of nodes according to their PageRank scores? We show that the answer is quite nuanced, and depends crucially on…