ConceptTheory & Algos
Pointer machine model bounds
The search bound achievable on a pointer machine is when pointers to items are given.
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.