Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Coin Rendering: Part 1
Graph Chatbot
Related lectures (41)
Solving Parity Games in Practice
Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Improved Algorithm: Three-Color Parity Games
Introduces an improved algorithm for three-color parity games, focusing on progress measures, acceleration, and practical speed-up.
Untitled
Minimum Spanning Trees: Prim's Algorithm
Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.
Complex Systems: Critical Phenomena
Explores critical phenomena in complex systems, including stochastic objects, percolation, and combinatorial optimization.
Complexity & Induction: Algorithms & Proofs
Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.
Greedy Algorithms & Matroids
Introduces greedy algorithms and matroids, highlighting their efficiency in solving optimization problems.
Algorithmic Complexity: Definition and Examples
Explores algorithm correctness, worst-case complexity analysis, and efficiency comparison based on input size.
Algorithms & Growth of Functions
Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.
Distinct Elements: Count and Hash Functions
Covers counting distinct elements using hash functions and the median trick.
Dynamic Programming: Pascal's Triangle & Floyd's Algorithm
Explores dynamic programming through Pascal's Triangle and Floyd's Algorithm.
Dynamic Programming: Shortest Paths Algorithms
Explores dynamic programming strategies for finding shortest paths in networks with various algorithms and complexities.
Search Algorithms: Abductive Reasoning
Covers search algorithms, focusing on abductive reasoning and heuristic search strategies.
Tower of Hanoi: Recursion and Dynamic Programming
Explores the Tower of Hanoi algorithm, recursion, and dynamic programming in solving problems efficiently.
Strategies to Break Linear Scaling Relationships in Catalysis
Explores breaking linear scaling relationships in catalysis through strategies like controlling ensembles, using ligands, and introducing complexities to enhance performance.
Dijkstra's Algorithm: All-Pairs
Log in to Mediaspace to watch this video
Covers Dijkstra's algorithm and its application to the all-pairs shortest path problem.
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.
Linear Algebra: Efficiency and Complexity
Log in to Mediaspace to watch this video
Explores constraints, efficiency, and complexity in linear algebra, emphasizing convexity and worst-case complexity in algorithm analysis.
Algorithmic Complexity: Visualization and Analysis
Log in to Mediaspace to watch this video
Explores algorithmic complexity, visualization of functions, and algorithm efficiency analysis using Python.
Integer Optimization: Theory and Applications
Log in to Mediaspace to watch this video
Covers the fundamentals of integer optimization, including integer programming, dynamic programming, and approximation algorithms.
Previous
Page 1 of 3
Next
