ConceptTheory & Algos
Cache-oblivious analysis of divide and conquer
Analysis that knows B and M and focuses on the recursive levels where the problem fits into O(1) blocks or fits into cache.
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.