ConceptTheory & Algos
Chernoff bound analysis for hash collision
Applying the Chernhoff bound with a mean of log n to show that the probability of having more than twice the mean number of collisions is very small with high probability.
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.