ConceptTheory & Algos
Wilber 1 bound
A lower bound method based on a fixed binary tree over keys that counts alternations between left and right subtrees for each node.
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.