CS 598 TMC

CS 598 TMC - Advanced Data Structures

Fall 2023

TitleRubricSectionCRNTypeHoursTimesDaysLocationInstructor
Advanced Data StructuresCS598TMC70199S1541100 - 1215 W F  136 Loomis Laboratory Timothy Moon-Yew Chan

Official Description

Subject offerings of new and developing areas of knowledge in computer science intended to augment the existing curriculum. See Class Schedule or departmental course information for topics and prerequisites. Course Information: May be repeated in the same or separate terms if topics vary.

Section Description

This is a CS theory/algorithms course, covering selected topics in data structures, which go beyond what are typically taught in 2nd and 3rd-year undergraduate classes. Potential topics include: balanced search trees, priority queues (e.g., Fibonacci heaps), amortized analysis, the union-find problem, hashing, geometric data structures (e.g., range searching), approximate nearest neighbor search (e.g., locality-sensitive hashing), bit-packing techniques (e.g., fusion trees and succinct data structures), persistent data structures, dynamic graph algorithms (e.g., dynamic connectivity and shortest paths), distance oracles, strings and text indexing (e.g., suffix trees), I/O-efficient data structures, and (conditional) lower bounds. Prerequisites: a course like CS 473 or equivalent is recommended, but not required; algorithmically mature undergraduates are welcomed. For up-to-date information about CS course restrictions, please see the following link: http://go.cs.illinois.edu/csregist