ConceptTheory & Algos
Cache-oblivious binary search running time
Cache-oblivious binary search achieves an optimal memory transfer bound without knowing the block size .
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.