The following two computational problems are studied: Duplicate grouping: Assume that n items are given, each of which is labeled by an integer key from the set {0, . . . , U − 1}. Store the items in… (More)

The dynamic dictionary problem is considered: provide an algorithm for storing a dynamic set, allowing the operations insert, delete, and lookup. A dynamic perfect hashing strategy is given: a… (More)

A hash function h, i.e., a function from the set U of all keys to the range range [m] = {0, . . . , m− 1} is called a perfect hash function (PHF) for a subset S ⊆ U of size n ≤ m if h is 1–1 on S.… (More)

We study a particular aspect of the balanced allocation paradigm (also known as the “two-choices paradigm”): constant sized bins, packed as tightly as possible. Let d ≥ 1 be fixed, and assume there… (More)

Consider the set <inline-equation> <f> <sc>H</sc> </f> </inline-equation> of all linear (or affine) transformations between two vector spaces over a finite field <italic>F</italic>. We study how good… (More)

We describe a simple randomized construction for generating pairs of hash functions h1,h2 from a universe U to ranges V = [m] = (0,1,...,m-1) and W = [m] so that for every key set S ⊆ U with n = |S|… (More)

Abstract. We settle the question of tight thresholds for offline cuckoo hashing. The problem can be stated as follows: we have n keys to be hashed into m buckets each capable of holding a single key.… (More)