• Lecture 1: Amortized complexity. Binomial heaps word postscript
• Lecture 2: Lazy melding-Fibonacci heaps word postscript
• Lecture 3: Applications of Fibonacci heaps (Dijkstra, MST) word postscript
• Lecture 4: QuickSort, Treaps, Backward analysis word postscript
• Lecture 5: Splay treesword postscript
• Lecture 7: Dynamic Trees word postscript
• An example of expose (postscript)
• Lecture 8: Dynamic Trees (cont.) word postscript
• Lecture 9: Hibbard's Theorem (postscript slides) 1 in a page, 4 in a page
• Lecture 10: Element Distinctness postscript word
• Lecture 12: Pattern Matching -- KMP postscript slides (1 in a page) The C program
• Lecture 13: log log N Priority Queue postscript slides (1 in a page) Word

2000 Lecture Notes

1. Amortized complexity. word postscript
2. Binomial Heaps and Fibonacci heaps. word postscript
3. Applications of Fibonacci heaps (Dijkstra and MST). word postscript
4. Red-black Trees word
5. Quick-Sort and backward analysis word
6. Perfect hashing via universal hashing (static and dynamic) postscript Dynamic Perfect hashing Hebrew Word
7. Union-Find word
8. Restircted Union-Find in linear time word
9. Splay trees word Accounting method (word) Melding (word)
10. Dynamic trees word postscript
11. Pattern Matching KMP , Boyer-Moore , Rabin-Karp , Lempel-Ziv
12. Persistent Data Structures word
13. Dynamic Programming word
14. Interval trees word
15. Dynamization word

2006 Lecture Notes

1. Suffix arrays power-point
2. log log N Priority Queue word
3. Merge in situ word
4. Restricted Union/Find pdf