ConceptSystems & CS
Perfect hash function
A hash function that guarantees no collisions such that different keys always map to different values.
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
2Each in their own terms, from the easiest level.
Erik Demaine
A hash function that maps a given set of keys into a hash table with no collisions.
Connections
5The lectures that define it or assume it, and the concepts next to it.