Lectures related to Group Membership and View Synchrony

Dynamic Programming: Shortest Paths Algorithms

Explores dynamic programming strategies for finding shortest paths in networks with various algorithms and complexities.

Connect Four: Winning Strategy

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

Graph Algorithms II: Traversal and Paths

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

Introduction to Algorithms

Introduces the importance of studying algorithms, presents a clever algorithm for calculating an arithmetic series, and discusses efficiency and correctness in algorithms.

Untitled

Hidden Subgroup Algorithm

Continues the discussion on Simon's hidden subgroup problem, focusing on finding a basis.

Algorithms for Big Numbers: Z_n and Orders

Covers algorithms for big numbers, Z_n, and orders in a group, explaining arithmetic operations and cryptographic concepts.

Hidden Sub-group Problem and Simon Algorithm

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

Median Search Algorithm

Covers the median search algorithm and the Hoare algorithm for finding the smallest element in a list.