Sign inSign in

Simple uniform hashing

An assumption that any given key is equally likely to hash to any of the mm slots, independently of where other keys hash.
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Erik Demaine

    MIT · Undergraduate

    • 34:25Hashing with Chaining, Simple Uniform Hashing & Universal Families

Lectures that assume it

1

Connections

9

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

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.