Lectures related to The Science of Computation and Communication

Explores the history and societal impact of information, communication, and computation sciences in the digital era.

Neuromorphic Computing: Concepts and Hardware Implementations

Covers neuromorphic computing, challenges in ternary and binary computing, hardware simulations of the brain, and new materials for artificial brain cells.

Algorithmic Complexity: Travel Time Analysis

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

Statistical Physics of Clusters

Explores the statistical physics of clusters, focusing on complexity and equilibrium behavior.

Quantum Supremacy: Introduction

Introduces Quantum Supremacy, covering Google's 2019 achievement with 60 qubits and exploring quantum information and error correction.

Transition to Smart Cities: Complexity and Interdependencies

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

Smart Borders: General Issues and Concepts

Explores the definition, goals, and implications of smart borders, including data privacy concerns and the impact on migrants' rights.

Linear Systems: Convergence and Methods

Explores linear systems, convergence, and solving methods with a focus on CPU time and memory requirements.

Elements of computational complexity

Covers classical and quantum computational complexity concepts and implications.

Dynamic Programming: Shortest Paths Algorithms

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

Algorithmic Complexity: Definition and Examples

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

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.

Solving Parity Games in Practice

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

Complexity of Algorithms

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

Implementation Research: Concepts and Scope

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

Dynamic Programming: Pascal's Triangle & Floyd's Algorithm

Explores dynamic programming through Pascal's Triangle and Floyd's Algorithm.

Simon Problem 4: Quantum State and Complexity Analysis

Explores the Simon Problem 4, analyzing quantum states and algorithm complexity.

Linear Algebra Complexity

Explores the complexity of linear algebra operations and optimization methods, including Gaussian elimination and the simplex method.

Conclusions on Statistical Learning Theory

Explores conclusions from statistical learning theory, emphasizing function complexity, generalization, and the bias-variance trade-off.