ConceptTheory & Algos
2-Universal hash family
A family of hash functions where the collision probability of any two distinct keys is at most 1/m, providing pairwise independence.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.