Lectures related to FP-Growth: Itemset Mining

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

Covers Dijkstra's algorithm and its application to the all-pairs shortest path problem.

Introduces Dijkstra's algorithm and probabilistic analysis through the Hiring Problem.

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

Explores the hidden sub-group problem and Simon algorithm in quantum computing.

Explains the winning strategy in Connect Four by checking for winning combinations.

Introduces an improved algorithm for three-color parity games, focusing on progress measures, acceleration, and practical speed-up.

Covers search algorithms, focusing on abductive reasoning and heuristic search strategies.