54:023SUM, All-Pairs Shortest Paths and Monochromatic Problems
A 54-minute video from IGAFIT: “3SUM, All-Pairs Shortest Paths and Monochromatic Problems”.
IGAFIT
28 subscribers on YouTube
Shorts, livestreams, trailers and promos are never listed. Unless a curator approved this channel in full, only individually picked videos appear.
54:02
53:58A (slightly) improved approximation algorithm for metric TSP
A 54-minute video from IGAFIT: “A (slightly) improved approximation algorithm for metric TSP”.
58:44Algorithms with Predictions: Simpler Analyses and Better Running Times
A 59-minute video from IGAFIT: “Algorithms with Predictions: Simpler Analyses and Better Running Times”.
1:00:32An almost-linear time deterministic algorithm for expander decomposition
A 61-minute video from IGAFIT: “An almost-linear time deterministic algorithm for expander decomposition”.
49:03An improved approximation algorithm for ATSP
A 49-minute video from IGAFIT: “An improved approximation algorithm for ATSP”.
1:14:31Beyond Worst-Case Analysis
A 75-minute video from IGAFIT: “Beyond Worst-Case Analysis”.
1:06:22Circulation control for faster minimum cost flow in unit-capacity graphs
A 66-minute video from IGAFIT: “Circulation control for faster minimum cost flow in unit-capacity graphs”.
49:41Deterministic Mincut in Almost-Linear Time
A 50-minute video from IGAFIT: “Deterministic Mincut in Almost-Linear Time”.
53:34Fine-Grained Complexity of Optimization Problems
A 54-minute video from IGAFIT: “Fine-Grained Complexity of Optimization Problems”.
56:22Fully online matching
A 56-minute video from IGAFIT: “Fully online matching”.
57:56Graph Clustering Algorithms: Theoretical Insights For Practice
A 58-minute video from IGAFIT: “Graph Clustering Algorithms: Theoretical Insights For Practice”.
55:37Local Computation Algorithms
A 56-minute video from IGAFIT: “Local Computation Algorithms”.
51:53New lower and upper bounds for quantile summary algorithms
A 52-minute video from IGAFIT: “New lower and upper bounds for quantile summary algorithms”.
54:25Paths, cycles and beyond
A 54-minute video from IGAFIT: “Paths, cycles and beyond”.
45:11Polyhedral Techniques in Combinatorial Optimization
A 45-minute video from IGAFIT: “Polyhedral Techniques in Combinatorial Optimization”.
51:47Prophet and Secretary Online Algorithms for Matching in General Graphs
A 52-minute video from IGAFIT: “Prophet and Secretary Online Algorithms for Matching in General Graphs”.
54:33When is Memorization of Irrelevant Training Data Necessary for High-Accuracy Learning?
A 55-minute video from IGAFIT: “When is Memorization of Irrelevant Training Data Necessary for High-Accuracy Learning?”.
25:37When is Memorization of Irrelevant Training Data Necessary for High-Accuracy Learning? part 1
A 26-minute video from IGAFIT: “When is Memorization of Irrelevant Training Data Necessary for High-Accuracy Learning? part 1”.
28:39When is Memorization of Irrelevant Training Data Necessary for High-Accuracy Learning? part 2
A 29-minute video from IGAFIT: “When is Memorization of Irrelevant Training Data Necessary for High-Accuracy Learning? part 2”.