Lectures related to Untitled | EPFL Graph Search

Covers counting distinct elements using hash functions and the median trick.

Explores group membership and view synchrony in distributed systems, ensuring accurate knowledge and coordinated views.

Explores latent tree learning, covering node properties, sibling relationships, and algorithmic structure.

Explores total order broadcast and its equivalence to consensus in reliable systems.

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.

Covers coin rendering and the limitations of the greedy algorithm in finding optimal solutions.

Explores reliable broadcast in distributed systems, presenting specifications, algorithms, and properties for different types of broadcast.