ConceptTheory & Algos
Lovasz local lemma
A tool in probability theory for proving the existence of combinatorial objects with certain properties.
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.
Seth Pettie
A combinatorial lemma used in distributed computing that serves as a completeness result for sublogarithmic randomized time complexity.
Connections
3The lectures that define it or assume it, and the concepts next to it.