3 citations · 3 across the 7 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
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…
cs.DS2020
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…
cs.DS2014★ 3 cited
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…