Lecture slides
- Sep 3 - Course organisation
- Sep 3 - Introduction
- Sep 5 - Big-Oh
- Sep 10, 12, 17 - Linear data, Sorting, Recurrences, Skip-Lists
- Sep 19, 24, - Trees, balancing, k-d trees, R-trees, union find, ...
- Oct 3., - Heaps
- Oct 10., - Succinct data structures
- Oct 17., - Hashing
- Oct 24., 29., 31., Nov 7, 12 - Graphs
- Nov 14 - Dynamic programming
- ( PDF , PDF 6up )
- Search using generalised edit distance - https://biit-dev.cs.ut.ee/~orasmaa/gen_ed_test/
- English pronunciation search - https://biit-dev.cs.ut.ee/~orasmaa/ing_ligikaudne/
- Generalised edit distance code and API - https://github.com/soras/genEditDist
- For the GIT project we are seeking for additional maintainers. :)
- ( PDF , PDF 6up )
- Nov 19,21,28 - Heuristic search
- Dec 3,5. - Clustering and Seriation
- Dec 10,12 - Parallel computing
- ( PDF , PDF 6up )
- Lock-free data structures: Slides by Eric Ruppert