Credit points: 3.0
This is an advanced course, suitable for graduate students and
advanced undergraduates. It deals with advanced data structures,
analysis techniques, some design techniques, and applications.
The course presents and analyzes advanced data structures. Techniques: amortized time, backward analysis, dynamization, persistent data structures. Data structures: Fibonacci heaps, search trees, splay trees, treaps, universal and perfect hash tables, loglog N priority queues, dynamic trees. Applications: Minimum spanning trees, network flows, pattern matching, problems incomputational geometry.
The course info-page can be found under "Syllabus."