ConceptTheory & Algos
RAM model
A formally defined pseudocode model with random access, ifs, and loops used in algorithm analysis.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Ryan O'Donnell
Lectures that assume it
11- Decision-Tree Ω(n log n) Lower Bound, Counting Sort & Radix Sort
- Integer Models
- Randomization: Universal & Perfect Hashing
- Integer Lower Bounds
- Dynamic Connectivity Lower Bound
- History of Memory Models
- Time/Space Tradeoffs for SAT
- Complexity of Basic Arithmetic
- Fusion Trees
- Memory Hierarchy Models
- Quasilinear Cook–Levin Theorem
Connections
22The lectures that define it or assume it, and the concepts next to it.