Lectures related to Dynamic Programming: Financial Adviser's Prediction

Tower of Hanoi: Recursion and Dynamic Programming

Explores the Tower of Hanoi algorithm, recursion, and dynamic programming in solving problems efficiently.

Delves into dynamic programming with a focus on Matrix Chain Multiplication and the longest common subsequence problem.

Longest Common Subsequence: Dynamic Programming Algorithm

Explores the Longest Common Subsequence concept and its dynamic programming algorithm, emphasizing optimal substructure and efficient problem-solving.

Dynamic Programming: Bellman-Ford and Dijkstra

Explores dynamic programming with Bellman-Ford, Dijkstra, greedy strategies, and activity scheduling problems.

Untitled

Knapsack Problem: Dynamic Programming

Explores dynamic programming for the Knapsack Problem, optimizing weight accumulation and profit subsets efficiently.

Dynamic Programming: Binomial Coefficients Calculation Complexity

Explores the complexity of calculating binomial coefficients using dynamic programming.

Quantum Jump: Theory and Algorithms

Explores the theory of quantum jumps in open quantum systems and their simulation.

Total Order Broadcast: Basics and Consensus Equivalences

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

Group Membership and View Synchrony

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

Untitled

Distinct Elements: Count and Hash Functions

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

Connect Four: Winning Strategy

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

Search Algorithms: Abductive Reasoning

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

Solving Parity Games in Practice

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

Latent Tree Learning

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

Set Cover: Integrality Gap

Explores the integrality gap concept in set cover and multiplicative weights algorithms.

Dynamic Programming: Pascal's Triangle & Floyd's Algorithm

Explores dynamic programming through Pascal's Triangle and Floyd's Algorithm.

LLL Algorithm

Covers the LLL algorithm for reducing lattice bases to shorter and more orthogonal forms through iterative transformations.

Hidden Sub-group Problem and Simon Algorithm

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