Lectures related to Binary search tree

Provides a detailed review of the 2016 final exam, covering various algorithmic problems.

Algorithmic Paradigms for Dynamic Graph Problems

Covers algorithmic paradigms for dynamic graph problems, including dynamic connectivity, expander decomposition, and local clustering, breaking barriers in k-vertex connectivity problems.

Recursion and Binary Search

Introduces recursion and binary search algorithms for efficient problem-solving.

Implementing Combiners

Covers the implementation of combiners in parallel programming in Scala, including efficient combine methods and set data structures.

Soft-Output MIMO Detection

Explores the performance of soft-output linear detection in wireless communication systems and the complexity of MIMO detection algorithms.

Class Hierarchies

Covers abstract classes, class extensions, object definitions, companion objects, and dynamic binding in Scala.

Algorithm Analysis: Growth, Search, and Logarithm

Explores algorithm growth, search complexities, and logarithmic properties in depth, with practical exercises included.