This is a block seminar on space-efficient algorithms and data structures. It is open to computer science and data science students of all levels, including bachelor and master students.

Contents

Despite growing memory sizes of computers, the fastest levels of the memory hierarchy remain limited in size. This seminar will cover recent advances in space-efficient algorithms and data structures that help to make the best use of this scarce resource.

The seminar is based on chapters from the book Compact Data Structures by Gonzalo Navarro and recent research papers.

Registration

Registration is on ILIAS. Topics will be assigned in a kickoff meeting in week 4 (w/c June 12).

Assessment

The module mark consists of the weighted average of an oral presentation (1LP) and a written report (2LP) about the seminar topic.

Relevant modules