Lectures related to Dynamic Programming: Binomial Coefficients Calculation Complexity

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

Symmetry and Group Theory: Exercise Set 3

Covers Exercise Set 3 on Symmetry and Group Theory, focusing on chiral molecules, point groups, conjugacy, and group properties.

Wigner Theorem; Translation Symmetry

Explores the Wigner theorem, translation symmetry, eigenstates, and wave functions in quantum physics.

Equilibrium in Tension: Verification and Compatibility

Covers the verification of equilibrium equations and compatibility in tension scenarios, ensuring uniform stress distribution.

Symmetry in Modern Space

Explores the fundamental theorem of isometries in space and the modern definition of symmetry, emphasizing the complexities of determining symmetries in 3D objects.

Dynamic Programming: Shortest Paths Algorithms

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

Distinct Elements: Count and Hash Functions

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