Graduate Course
"Algorithms Theory"
Winter Term 2011/12
Alexander Souza
Recordings and Slides
| Recordings | normal Slides | annotated Slides | |
| Introduction - Part1 |
|
|
|
| Introduction - Part2 |
|
|
|
| Fast Fourier Transformation - Part1 |
|
|
|
| Fast Fourier Transformation - Part2 |
|
|
|
| Fast Fourier Transformation - Part3 |
|
|
|
| Randomization - Part1 |
|
|
|
| Randomization - Part2 |
|
|
|
| Randomization - Part3 |
|
|
|
| Treaps - Part1 |
|
|
|
| Treaps - Part2 |
|
|
|
| Treaps - Part3 |
|
|
|
| Hashing - Part1 |
|
|
|
| Hashing - Part2 |
|
|
|
| Hashing - Part3 |
|
|
|
| Amortized Analysis - Part1 |
|
|
|
| Amortized Analysis - Part2 |
|
|
|
| Amortized Analysis - Part3 |
|
|
|
| Binomial Queues - Part1 |
|
|
|
| Binomial Queues - Part2 |
|
|
|
| Fibonacci Heaps - Part1 |
|
|
|
| Fibonacci Heaps - Part2 |
|
|
|
| Fibonacci Heaps - Part3 |
|
|
|
| Union Find Data Structures - Part1 |
|
|
|
| Union Find Data Structures - Part2 |
|
|
|
| Greedy Algorithms - Part1 |
|
|
|
| Greedy Algorithms - Part2 |
|
|
|
| Shortest Paths - Part1 |
|
|
|
| Shortest Paths - Part2 |
|
|
|
| Shortest Paths - Part3 |
|
|
|
| Minimum Spanning Trees - Part1 |
|
|
|
| Minimum Spanning Trees - Part2 |
|
|
|
| Bin Packing - Part1 |
|
|
|
| Bin Packing - Part2 |
|
|
|
| Dynamic Programming: Introduction |
|
|
|
| DP: Matrix-chain Multiplication - Part1 |
|
|
|
| DP: Matrix-chain Multiplication - Part2 |
|
|
|
| DP: Optimal Binary Search Trees |
|
|
|
| DP: Edit Distance and String Matching - Part1 |
|
|
|
| DP: Edit Distance and String Matching - Part2 |
|
|
|
| Text Search |
|
|
|