20:575.1 Elementary Data structures: Introduction and Stacks (old version)
A 21-minute video from Algorithms Lab: “5.1 Elementary Data structures: Introduction and Stacks (old version)”.
Algorithms Lab
8.27K subscribers on YouTube
Shorts, livestreams, trailers and promos are never listed. Unless a curator approved this channel in full, only individually picked videos appear.
20:57
16:525.2 Elementary Data Structures: Resizing Growable Arrays (old version)
A 17-minute video from Algorithms Lab: “5.2 Elementary Data Structures: Resizing Growable Arrays (old version)”.
1:07:40Algorithm Efficiency
A 68-minute video from Algorithms Lab: “Algorithm Efficiency”.
38:41Amortized Analysis: Aggregate Analysis and Accounting Method
A 39-minute video from Algorithms Lab: “Amortized Analysis: Aggregate Analysis and Accounting Method”.
58:33Analyzing recursive algorithms: how to solve recurrences
A 59-minute video from Algorithms Lab: “Analyzing recursive algorithms: how to solve recurrences”.
48:48Applications of LP Duality: Matchings, Flows and Shortest Path
A 49-minute video from Algorithms Lab: “Applications of LP Duality: Matchings, Flows and Shortest Path”.
45:11Approximation Algorithm for Metric k-Center using Parametric Pruning
A 45-minute video from Algorithms Lab: “Approximation Algorithm for Metric k-Center using Parametric Pruning”.
12:45Approximation Algorithm for Multiway Cut
A 13-minute video from Algorithms Lab: “Approximation Algorithm for Multiway Cut”.
23:07Approximation Algorithms: Introduction by the Example of Vertex Cover
A 23-minute video from Algorithms Lab: “Approximation Algorithms: Introduction by the Example of Vertex Cover”.
17:58Approximation algorithm for vertex cover using local ratio (aka layering)
A 18-minute video from Algorithms Lab: “Approximation algorithm for vertex cover using local ratio (aka layering)”.
50:28Approximations algorithms for the Steiner Tree Problem and the Traveling Salesperson Problem (TSP)
A 50-minute video from Algorithms Lab: “Approximations algorithms for the Steiner Tree Problem and the Traveling Salesperson Problem (TSP)”.
36:05Binary Search Trees
A 36-minute video from Algorithms Lab: “Binary Search Trees”.
19:41Binomial Heaps (part 2/3): Amortized Analysis of Insert
A 20-minute video from Algorithms Lab: “Binomial Heaps (part 2/3): Amortized Analysis of Insert”.
29:50Binomial heaps (part 1/3): Introduction and worst-case analysis
A 30-minute video from Algorithms Lab: “Binomial heaps (part 1/3): Introduction and worst-case analysis”.
18:02Binomial heaps (part 3/3): Lazy Union
A 18-minute video from Algorithms Lab: “Binomial heaps (part 3/3): Lazy Union”.
16:12Breadth-First Search (Elementary Graph Algorithms, part 2)
A 16-minute video from Algorithms Lab: “Breadth-First Search (Elementary Graph Algorithms, part 2)”.
16:11CCCG 2020: Restricted-Weight Minimum-Dilation Spanners on Three Points
A 16-minute video from Algorithms Lab: “CCCG 2020: Restricted-Weight Minimum-Dilation Spanners on Three Points”.
39:52Convex Hull Algorithms
A 40-minute video from Algorithms Lab: “Convex Hull Algorithms”.
41:53Delaunay triangulations (Delaunay triangulations and Voronoi diagrams, part 2)
A 42-minute video from Algorithms Lab: “Delaunay triangulations (Delaunay triangulations and Voronoi diagrams, part 2)”.
22:54Depth-First Search (Elementary Graph Algorithms, part 3)
A 23-minute video from Algorithms Lab: “Depth-First Search (Elementary Graph Algorithms, part 3)”.
8:30Djikstra's algorithms and priority queues (recap)
A 8-minute video from Algorithms Lab: “Djikstra's algorithms and priority queues (recap)”.
13:37Doubly-connected edge lists for planar subdivisions
A 14-minute video from Algorithms Lab: “Doubly-connected edge lists for planar subdivisions”.
8:54Dynamic Program for Rod Cutting
A 9-minute video from Algorithms Lab: “Dynamic Program for Rod Cutting”.
43:33Elementary Data Structures (part 1): Stacks and Dynamic Arrays
A 44-minute video from Algorithms Lab: “Elementary Data Structures (part 1): Stacks and Dynamic Arrays”.
30:15Elementary Data Structures (part 2): Queues and Linked Lists
A 30-minute video from Algorithms Lab: “Elementary Data Structures (part 2): Queues and Linked Lists”.
39:04Fibonacci Heaps
A 39-minute video from Algorithms Lab: “Fibonacci Heaps”.
7:45Folding Free-Space Diagrams
A 8-minute video from Algorithms Lab: “Folding Free-Space Diagrams”.
19:52From Dijkstra's algorithm to route planning (incl. bidirectional search & transit node routing)
A 20-minute video from Algorithms Lab: “From Dijkstra's algorithm to route planning (incl. bidirectional search & transit node routing)”.
16:46From Set Cover to Shortest Superstring
A 17-minute video from Algorithms Lab: “From Set Cover to Shortest Superstring”.
33:46Fully Polynomial-Time Approximation Scheme for the Knapsack Problem
A 34-minute video from Algorithms Lab: “Fully Polynomial-Time Approximation Scheme for the Knapsack Problem”.
24:20Geometric Duality
A 24-minute video from Algorithms Lab: “Geometric Duality”.
19:26Graphs and Graph Representation (Elementary Graph Algorithms, part 1)
A 19-minute video from Algorithms Lab: “Graphs and Graph Representation (Elementary Graph Algorithms, part 1)”.
21:55Greedy Approximation Algorithm for Set Cover
A 22-minute video from Algorithms Lab: “Greedy Approximation Algorithm for Set Cover”.
19:42Hash Tables (part 1): Introduction
A 20-minute video from Algorithms Lab: “Hash Tables (part 1): Introduction”.
38:34Hash Tables (part 2): Resolving Collisions
A 39-minute video from Algorithms Lab: “Hash Tables (part 2): Resolving Collisions”.
23:42Heaps (part 1): Priority Queues and Introduction to Max-Heaps
A 24-minute video from Algorithms Lab: “Heaps (part 1): Priority Queues and Introduction to Max-Heaps”.