Basic Information
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 In Computational Geometry.