The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed...
Abstract. Modern computer graphics systems are able to render sophisticated 3D scenes consisting of millions of polygons. For most camera positions only a small collection of these...
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
Abstract. We study three comparison-based problems related to multisets in the cache-oblivious model: Duplicate elimination, multisorting and finding the most frequent element (th...
Arash Farzan, Paolo Ferragina, Gianni Franceschini...
Abstract. The construction of t-spanners of a given point set has received a lot of attention, especially from a theoretical perspective. In this paper we perform the first extens...
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
We consider a one dimensional storage system where each container can store a bounded amount of capacity as well as a bounded number of items k ≥ 2. This defines the (standard)...
Abstract. We present a software library Stxxl, that enables practiceoriented experimentation with huge data sets. Stxxl is an implementation of the C++ standard template library ST...