In many networking systems, Bloom filters are used for high-speed set membership tests.
They permit a small fraction of false positive answers with very good space efficiency …

Modern key-value stores often use write-optimized indexes and compact in-memory indexes
to speed up read and write performance. One popular write-optimized index is the Log …

Matching recovery threshold for correlated random graphs Page 1 The Annals of Statistics
2023, Vol. 51, No. 4, 1718–1743 https://doi.org/10.1214/23-AOS2305 © Institute of …

The problem of detecting edge correlation between two Erdős-Rényi random graphs on
unlabeled nodes can be formulated as a hypothesis testing problem: under the null …

In dynamic load balancing, we wish to allocate a set of clients (balls) to a set of servers
(bins) with the goal of minimizing the maximum load of any server and also minimizing the …

Many tasks in computer systems could be abstracted as distributing items into buckets, so
that the allocation of items across buckets is as balanced as possible, and furthermore …

The emergence of large-scale dynamic sets in networking applications attaches stringent
requirements to approximate set representation. The existing data structures (including …

A minimal perfect hash function (MPHF) maps a set S of n keys to the first n integers without
collisions. There is a lower bound of n log2 ℓ—O (log n) bits of space needed to represent …

Multi-party set reconciliation is a key component in distributed and networking systems. It
naturally contains two dimensions, ie, set representation and reconciliation protocol …

In multiple-choice data structures each element x in a set S of m keys is associated with a
random set e (x)⊆[n] of buckets with capacity ℓ≥ 1 by hash functions. This setting is …