In an α-way set-associative cache, the cache is partitioned into
disjoin...
This paper shows how to achieve contention resolution on a shared
commun...
Modern hash table designs strive to minimize space while maximizing spee...
Randomized backoff protocols, such as exponential backoff, are a powerfu...
Finding the connected components of a graph is a fundamental problem wit...
The online list labeling problem is an algorithmic primitive with a larg...
This paper introduces a new data-structural object that we call the tiny...
For nearly six decades, the central open question in the study of hash t...
Despite being one of the oldest data structures in computer science, has...
For any forest G = (V, E) it is possible to orient the edges E so that n...
First introduced in 1954, linear probing is one of the oldest data struc...
In the unit-cost comparison model, a black box takes an input two items ...
This paper focuses on the contention resolution problem on a shared
comm...
The single- and multi- processor cup games can be used to model natural
...
Given a stream S = (s_1, s_2, ..., s_N), a ϕ-heavy hitter is an item
s_i...
Balls-and-bins games have been a wildly successful tool for modeling loa...
The Bloom filter---or, more generally, an approximate membership query d...
This paper presents new alternatives to the well-known Bloom filter data...