Sign inSign in

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.
Watch it explained

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

1

    Connections

    2

    The lectures that define it or assume it, and the concepts next to it.

    Concept1

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.