This video lecture, part of the series 18.410J Introduction to Algorithms (SMA 5503) by Prof. Erik Demaine, does not currently have a detailed description and video lecture title. If you have watched this lecture and know what it is about, particularly what Mathematics topics are discussed, please help us by commenting on this video with your suggested description and title. Many thanks from,

- The CosmoLearning Team

1. Administrivia - Introduction - Analysis of Algorithms, Insertion Sort, Mergesort
2. Asymptotic Notation - Recurrences - Substitution, Master Method
3. Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication
4. Quicksort, Randomized Algorithms
5. Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort
6. Order Statistics, Median
7. Hashing, Hash Functions
8. Universal Hashing, Perfect Hashing
9. Relation of BSTs to Quicksort - Analysis of Random BST
10. Red-black Trees, Rotations, Insertions, Deletions
11. Augmenting Data Structures, Dynamic Order Statistics, Interval Trees
12. Skip Lists
13. Amortized Algorithms, Table Doubling, Potential Method
14. Competitive Analysis: Self-organizing Lists
15. Dynamic Programming, Longest Common Subsequence
16. Greedy Algorithms, Minimum Spanning Trees
17. Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search
18. Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints
19. Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson
20. Advanced Topics
21. Advanced Topics (cont.)
22. Advanced Topics (cont.)
23. Advanced Topics (cont.) - Discussion of Follow-on Classes

This course features a complete set of lecture notes and videos. Homework assignments with solutions are also available in the assignments section. In addition, an extensive bibliography of assigned and recommended readings is provided in the readings section. The course textbook was co-written by Prof. Leiserson.

Tags: Math, Math Algorithms

	Post comment as a guest user. Click to login or register:
Your name:
Your email: (will not appear)
Your comment: (max. 1000 characters)
Are you human? (Sorry)