ConceptTheory & Algos
Divide and conquer in cache-oblivious algorithms
The central idea in cache-oblivious algorithms where problems are recursively split into non-overlapping subproblems down to a base case.
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.