ConceptTheory & Algos
Cache-oblivious searching
The analogue of binary search using a recursive layout like van Emde Boas layout to achieve optimal query bounds without knowing B.
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
1Connections
3The lectures that define it or assume it, and the concepts next to it.