ConceptTheory & Algos
Universal hashing
A randomized hashing technique where the hash function is chosen randomly from a family of hash functions to guarantee a low collision probability for any two distinct keys.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Erik Demaine
Lectures that assume it
1Connections
14The lectures that define it or assume it, and the concepts next to it.