Sign inSign in
ConceptSystems & CS

Valiant's algorithm

An oblivious routing algorithm that balances network load by routing packets through a randomly chosen intermediate destination first.
Watch it explained

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

2

Each in their own terms, from the easiest level.

  • Barna Saha

    UC Berkeley · Graduate

    A divide-and-conquer algorithm for computing transitive closure using overlapping submatrices even when the underlying operation is non-associative.
    • 23:35Efficient Fine-Grained Algorithms

Connections

5

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.