ConceptTheory & Algos
Expected run length analysis
The expected run length in linear probing with totally random hash functions is bounded by a constant because long runs are super-geometrically unlikely.
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.
Chernoff bound1Hash table runs1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.