ConceptTheory & Algos
Expander derandomization with random walks
Using a length-T random walk on an 8-regular expander graph to reduce the error of a randomized algorithm while using only N + O(T) random bits.
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
4The lectures that define it or assume it, and the concepts next to it.