Lectures related to Computation & Algorithms I

Algorithms & Growth of Functions

Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.

Noncommutative Smith Form

Covers the computation of the Smith Form for noncommutative systems.

Complexity & Induction: Algorithms & Proofs

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

Scripts and Algorithms: MATLAB and Octave Basics

Introduces the basics of scripts and algorithms using MATLAB and Octave for beginners.

Introduction to Information, Computation, and Communication

Introduces the fundamental principles of Information, Computation, and Communication theory, covering genomics, medical imaging, and assistive technology.

Solving Parity Games in Practice

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

Graph Matching Entropy

Explores the relationship between matchings, entropy, and Bethe free entropy in random graphs.

Theory of Computation: Problems Definition and Counting (Denumerability)

Explores the theory of computation, emphasizing problems definition, counting, and the limits of algorithmic computation.

Variance Reduction Techniques

Covers variance reduction techniques in optimization, focusing on gradient descent and stochastic gradient descent methods.

Introduction to Algorithms: Basics and Importance

Covers the basics of algorithms, the importance of studying them, data structures, and the impact of algorithms on various fields.

Elements of computational complexity

Covers classical and quantum computational complexity concepts and implications.

Search Algorithms: Abductive Reasoning

Explores abductive reasoning, search algorithms, and heuristic search for problem-solving.

Untitled

Double Descent Curves: Overparametrization

Explores double descent curves and overparametrization in machine learning models, highlighting the risks and benefits.

Search Algorithms: Two Examples

Covers basic algorithm ingredients, search algorithms, control structures, and algorithm correctness.

Search Algorithms: Abductive Reasoning

Covers search algorithms, focusing on abductive reasoning and heuristic search strategies.

Theory of Computation: Complexity of Problems

Explores the theory of computation, undecidable problems, complexity measurement, and the P complexity class.

Connect Four: Alpha-Beta Pruning and Monte-Carlo Tree Search

Explores solving Connect Four using game theory algorithms and compares Alpha-Beta pruning with Monte-Carlo tree search.

Conditional Branching in C++

Covers conditional branching in C++, focusing on if-else and switch-case statements, logical operators, and control structures.

Theory of Computation: Decidability and Complexity

Delves into the theory of computation, covering decidability, complexity, P vs. NP, and reductions.