Lectures related to Parallel Programming in Scala: Performance Analysis

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

Explores sorting and recursive algorithms, including complexity analysis, maximal value, and binary search.

Delves into the complexity of factoring polynomials and the implications for security.

Explains the Quantum Phase Estimation (QPE) algorithm and its complexity using two registers and SWAP gates.

Explores algorithm complexity, big-O notation, induction, recursion, and analysis of running times, covering NP problems and complexity classes.

Explores parallel programming in Scala, functional operations on collections, and parallel map functions on arrays and trees.