Lectures related to Exam Q&A Session

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.

Coin Rendering: Part 1

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

Introduction to Reliable Distributed Programming

Covers the basics of distributed algorithms and their importance in building reliable and secure systems.

Factoring Polynomials: Complexity and Algorithms

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

Improved Algorithm: Three-Color Parity Games

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

Dijkstra's Algorithm: All-Pairs

Covers Dijkstra's algorithm and its application to the all-pairs shortest path problem.

Randomized Algorithms: Median Search

Explores how randomness and recursion can be used to efficiently find the median of a list.

Theory of Computation: Undecidable Problems

Explores the existence of functions that cannot be computed, illustrated by famous paradoxes and the concept of undecidable problems.

Linear Programming: Optimization and Constraints

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

Algorithmic Complexity: Visualization and Analysis

Explores algorithmic complexity, visualization of functions, and algorithm efficiency analysis using Python.

Complexity & Induction: Algorithms & Proofs

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

Algorithmic Complexity: Travel Time Analysis

Covers control operations, algorithmic complexity, function calls, and travel time analysis.

Group Membership and View Synchrony

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

Testing of VLSI Systems

Explores defects, errors, and fault models in VLSI systems, emphasizing fault collapsing and dominance.

Calcul and Algorithms: What is an Algorithm?

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

Basic Ingredients of Algorithms

Covers the basic elements of algorithms, including data handling, instructions, and control structures.

Support Vector Machines: Formulation and Complexity

Explores the formulation and complexity of Support Vector Machines, including primal and dual forms, geometric interpretation, and algorithmic implications.

Dynamic Programming: Shortest Paths Algorithms

Explores dynamic programming strategies for finding shortest paths in networks with various algorithms and complexities.