Content

In this lecture we consider modern data structures for fundamental objects such as integers, strings and graphs. These data structures are the basis for many applications and an important part of efficient algorithms. The course covers theoretical analysis but also aspects relevant for efficient performance in practice.

Data structures likely covered in the course are: rank-select, Elias Fano, succinct trees, segment trees, Cartesian tries, van Emde Boas trees, B-trees, fusion trees, y-fast-tries, set sketches, splay trees, absl::flat_hash_map funnel, funnel hashing.