▪ כאן אפשר למצוא את רוב חומר הקורס
הרצאות
|
|
|
|
|
|
יום שני 18/7 |
integers : Intro to course, Predecessor/Successor via y-fast trees and Van Emde Boas |
|
|
יום רביעי 20/7 |
dictionaries: Worst-case queries, via FKS and Cuckoo hashing, Bloom filters |
|
|
יום שני 25/7 |
self-adjusting data structures : Self-adjusting linked lists, Move To Front, static optimality |
|
|
יום רביעי 27/7 |
self-adjusting data structures: Splay trees, Bounds, Dynamic optimality conjecture |
|
|
יום שני 1/8 |
self-adjusting data structures: Wilber lower bounds, O(lg lg n)-competitive Tango trees |
|
|
יום רביעי 3/8 |
dynamic graphs: Dynamic trees (link-cut trees) |
|
|
יום שני 8/8 |
dynamic graphs: Euler tour trees, Dynamic connectivity |
|
|
יום רביעי 10/8 |
tree decompositions: Marked ancestor upper bound, Decremental connectivity in trees |
|
|
יום שני 15/8 |
strings: Suffix tree, Suffix array |
|
|
יום רביעי 17/8 |
strings: Document retrieval, Suffix tray, Searching with errors and wild cards |
|
|
יום שני 22/8 |
integers: Fusion trees |
|
|
יום רביעי 24/8 |
external memory / cache-oblivious (and exam review): Models, Static search trees, Matrix multiplication |
|
|
|
|
|
|
|
|
|
|