ConceptTheory & Algos
Cache-oblivious search cost analysis
The memory transfer cost of a root-to-node path in a cache-oblivious search tree is bounded by twice the number of tree-sized subtrees (triangles) visited.
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.