ConceptTheory & Algos
Key-independent optimality
A setting in dynamic optimality where input keys do not have semantic meaning and are instead generated randomly, meaning the optimal search cost equals the working-set bound.
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.
Dynamic optimality1Working-set bound1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.