I. Teaching Plan:
1. Comparison-based Dictionary (2 weeks)
linked List, Array, BST, B-Tree, Wavelet Tree
2. Word-RAM Dictionary (4 weeks)
Bit Vector, Hashing, veB tree, x-fast, y-fast, Succinct Dictionaries
3. Geometric Queries (3 weeks)
Range Search, Stabbing
4. Succinct Trees (3 weeks)
5. Strings (3 weeks)
Suffix Tree, Suffix Array, BWT, XBW, GBWT
---------------------------------------
II. Teaching Materials and References
1. Introduction to Algorithms, MIT Press
2. Research Papers
3. Web Resources: OCW, Wikipedia
---------------------------------------
III. Evaluation Method:
-- 4 to 6 Homeworks (100% in total)
---------------------------------------