The open-source rsync utility reduces the time and bandwidth required to update a file across a network. Rsync uses an interactive protocol that detects changes in a file and se...
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
—In this paper, we introduce a sparse approximation property of order s for a measurement matrix A: xs 2 ≤ D Ax 2 + β σs(x) √ s for all x, where xs is the best s-sparse app...
We present Anticipatory Memory Allocation (AMA), a new method to build kernel code that is robust to memoryallocation failures. AMA avoids the usual difficulties in handling allo...
In [AKL10], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms....