ConceptSystems & CS
Valiant's algorithm
An oblivious routing algorithm that balances network load by routing packets through a randomly chosen intermediate destination first.
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
2Each in their own terms, from the easiest level.
Barna Saha
A divide-and-conquer algorithm for computing transitive closure using overlapping submatrices even when the underlying operation is non-associative.
Connections
5The lectures that define it or assume it, and the concepts next to it.