Lectures related to Basic Ingredients of Algorithms

Solving Parity Games in Practice

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

Untitled

Algorithmic Complexity: Definition and Examples

Explores algorithm correctness, worst-case complexity analysis, and efficiency comparison based on input size.

Algorithm Design: Time Complexity Analysis

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

Complexity & Induction: Algorithms & Proofs

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

Improved Algorithm: Three-Color Parity Games

Introduces an improved algorithm for three-color parity games, focusing on progress measures, acceleration, and practical speed-up.

Coin Rendering: Part 1 MOOC: Information, Computation, Communication: Introduction to computational thinking

Covers coin rendering and the limitations of the greedy algorithm in finding optimal solutions.

Transition to Smart Cities: Complexity and Interdependencies MOOC: Smart Cities, Management of Smart Urban Infrastructures

Delves into the complexity and interdependencies of transitioning to smart cities, emphasizing the importance of a holistic approach.

Gitlab Agent for Kubernetes (`agentk`)

Covers the setup of a Gitlab agent for Kubernetes, focusing on installation, version control, and troubleshooting.

Algorithmic Complexity: Travel Time Analysis

Covers algorithmic complexity and travel time analysis, focusing on measuring the time taken by algorithms and evaluating their performance.

Algorithmic Complexity: Theta Notation

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

Processor Architecture

Covers processor architecture, evolution of performance, algorithms to computers transition, registers, instructions, arithmetic unit, and memory management.

Calcul and Algorithms: What is an Algorithm?

Covers the basics of algorithms in computer science, including their formalization and complexity.

Implementation Research: Concepts and Scope

Explores Implementation Research, addressing challenges in implementing health interventions and developing effective strategies for infectious diseases of poverty.

Constraint Satisfaction Problem

Covers the Random Constraint Satisfaction Problem and explores methods for solving constraint satisfaction problems.

Algorithms: Summary of the week

Covers algorithms for searching, sorting, optimization, and the Halting Problem.

VLIW Architectures: Compilers and Instruction Level Parallelism Log in to Mediaspace to watch this video

Covers VLIW architectures and compilers, focusing on instruction level parallelism and optimization techniques.

Elements of computational complexity Log in to Mediaspace to watch this video

Covers classical and quantum computational complexity concepts and implications.

Linear Programming: Optimization and Constraints Log in to Mediaspace to watch this video

Explores linear programming optimization with constraints, Dijkstra's algorithm, and LP formulations for finding feasible solutions.

Computation & Algorithms II: Sorting and Recursive Algorithms Log in to Mediaspace to watch this video

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