Why it matters

Universal hashing gives collision bounds. Understanding shapes hashing.

Advertisement

The architecture

Family H with universal property.

Randomly choose h.

Expected O(1) per op.

Universal hashingFamily Hwith universal propertyChoose h randomlyat data structure initExpected O(1)operationsCarter + Wegman 1979; foundation for randomized hash tables + Cuckoo + more
Universal hashing.
Advertisement

How it works end to end

Linear + Multiply-shift families.

Amortized O(1) hash ops.

Adversary can't force collisions.