Lectures related to Average-case complexity

Complexity & Induction: Algorithms & Proofs

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Explores algorithm complexity, analyzing efficiency and worst-case scenarios of sorting algorithms.

Complexity & Induction: Algorithms & Proofs

Explores worst-case complexity, mathematical induction, and algorithms like binary search and insertion sort.

Introduces time complexity and worst-case analysis of algorithms, abstracting computational complexity from implementation details.

Introduction to Complexity

Introduces time complexity and worst-case analysis of algorithms, abstracting computational complexity from implementation details.

Algorithm Design: Time Complexity Analysis

Introduces algorithm design and time complexity analysis using examples and notations like n² and O(n).

Problem-solving Strategies: Sum of Integers (Recursive) Complexity

Discusses the complexity of a recursive algorithm to find the sum of integers.

Complexity Analyses: Linear and Binary Search, Sorting Algorithms

Covers the complexity analyses of search and sorting algorithms.

Algorithm Complexity Analyses

Covers the complexity analyses of algorithms and their worst-case time complexities.

Discussion of Complexity

Explores worst-case complexity in computer science and the importance of real-life complexity in algorithm selection.

Linear Algebra: Efficiency and Complexity

Explores constraints, efficiency, and complexity in linear algebra, emphasizing convexity and worst-case complexity in algorithm analysis.

Dynamic Programming: Binomial Coefficients Calculation Complexity

Explores the complexity of calculating binomial coefficients using dynamic programming.

Divide-and-Conquer: Merge Sort

Explores loop invariants, time analysis, and the Divide-and-Conquer approach with a focus on Merge Sort.

Prime Numbers: Deterministic Approaches

Introduces deterministic approaches to identify prime numbers and covers algorithms and modular arithmetic for prime number testing.

Master Theorem: Time Complexity Analysis

Introduces the Master Theorem for analyzing algorithm time complexity through problem subdivision and formula application.

Median Search Algorithm

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

Algorithmic Complexity: Theta Notation

Explores algorithmic complexity, comparing growth rates using Theta notation and characterizing different complexity classes.

Theory of Computation: NP Complexity

Delves into oracles, certificates, and the NP complexity class, raising the fundamental P versus NP question.

Stream Ciphers: Buteforce Inversion Algorithms

Explores stream ciphers, buteforce inversion algorithms, key recovery games, and attacks in cryptography.

Global Sensitivity Analysis in Stochastic Systems

On Variance-Based Sensitivity Analysis for Stochastic Systems covers the impact of parameters uncertainty and sensitivity indices in stochastic models.