Functions of Matrices - Lecture 5
Explore matrix functions with Nick Higham, covering algorithms, analysis, nonnormality bounds, and practical coding experiments for advanced mathematical understanding.
Matrix Equations and Model Reduction - Lecture 3
Explore matrix equations and model reduction techniques with Peter Benner, covering enrichment, polar residual form, transfer functions, and moment matching for efficient system analysis.
Graph Alignment: Informational and Computational Limits - Lecture 2
Explore graph alignment challenges, focusing on informational and computational limits. Gain insights into probabilistic and optimization methods for data science applications.
Matrix Data Structures
Explore efficient matrix data structures for fast algorithms, focusing on optimization techniques and their applications in computational mathematics.
Optimization: Higher-order Methods - Part 1
Explore advanced optimization techniques using higher-order methods, focusing on theoretical foundations and practical applications in algorithm design and data structures.
Optimization: First-order Methods - Part 2
Explore advanced first-order optimization techniques, focusing on accelerated gradient methods and their applications in solving complex algorithmic problems.
Alignment of Random Graphs: Informational and Computational Limits - Lecture 2
Explores informational and computational limits in aligning random graphs, focusing on advanced probabilistic techniques for data science and graph theory applications.
Alignment of Random Graphs: Informational and Computational Limits - Lecture 1
Explore informational and computational limits of random graph alignment in this lecture by Laurent Massoulié, part of a data science discussion on probabilistic and optimization methods.
Structure of Communication - Richard M. Karp Distinguished Lecture
Explore communication complexity, its applications, and structural conjectures in theoretical computer science with Shachar Lovett. Gain insights into efficient communication and its connections to various mathematical domains.
Graph Linear Algebra Part 3 - Data Structures and Optimization for Fast Algorithms
Explore advanced graph linear algebra concepts and optimization techniques for fast algorithms in data structures, building on previous parts.
Maths for Data Structures & Algorithms
Comprehensive overview of essential mathematical concepts for data structures and algorithms, covering prime numbers, Sieve of Eratosthenes, square roots, factors, modulo properties, HCF/LCM, and Euclidean algorithm.
Graph Traversal Techniques - Breadth First Search vs Depth First Search
Explore graph traversal techniques: BFS for level-wise exploration and DFS for deep path exploration. Learn implementation steps, applications, and differences between these fundamental algorithms.
Dynamic Algorithms for Center on Graphs
Efficient approximation algorithms for k-center problem on dynamic graphs with edge updates. Explores novel techniques in dynamic graph theory and algorithm design.
From Newton to Boltzmann - Fluctuations and Large Deviations in Hard Sphere Gas Dynamics
Explore macroscopic fluctuations in hard sphere gases, including deviations from the Boltzmann equation, central limit theorem, and large deviation bounds in the Boltzmann-Grad limit.
Sunflowers: From Soil to Oil
Explore the mathematical concept of sunflowers, from foundational principles to advanced applications, in this engaging lecture by Anup Rao at the Joint Mathematics Meetings.
Graph Algorithms and Coding - Session 5C
Explore advanced graph algorithms and coding techniques in this IEEE session, focusing on cutting-edge research and practical applications in computer science.
Matrix Methods in Computer Science - Session 4B
Explore advanced matrix methods and their applications in computer science, focusing on cutting-edge research and algorithmic developments.
Graph Algorithms and Graph Theory - Session 1B
Explore advanced concepts in graph algorithms and theory, delving into cutting-edge research and applications presented at FOCS 2020.
Graph Algorithms and Graph Theory - Session 7A
Explore advanced concepts in graph algorithms and theory, delving into cutting-edge research and applications presented at the FOCS 2020 conference.
Counting Small Induced Subgraphs Satisfying Monotone Properties
Explore techniques for enumerating small induced subgraphs with specific properties, focusing on algorithmic approaches and complexity analysis in graph theory.
Linear Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces
Explore efficient algorithms for list coloring graphs on surfaces, focusing on linear time complexity and distributed computing approaches.