Advanced Data Structures

Short Course Description

Data structures play a central role in modern computer science and are essential building blocks in obtaining efficient algorithms. The course covers major results and research directions in data structures, that (mostly) have not yet made it into standard computer science curriculum.

Weekly Schedule

Lectures

Weekly on Mondays, 10-12, in CAB G52 by

• [Lectures 1-12] Przemysław Uznański, przemyslaw.uznanski "A.T." inf.ethz.ch and
• [Lectures 13-14] Dan Alistarh, dan.alistarh "A.T" inf.ethz.ch

Problem Classes

Weekly:

• Tuesdays 13-15 in CAB G57
• Thursdays 13-15 in CHN D44

• Chih-Hung Liu, chih-hung.liu "A.T." inf.ethz.ch
• Giorgi Nadiradze, giorgi.nadiradze "A.T." inf.ethz.ch
• Przemysław Uznański, przemyslaw.uznanski "A.T." inf.ethz.ch

Topics

• Dictionaries
• Strings
• Static Trees
• Temporal
• Geometric
• Integers
• Succintness
• Concurrency

Problem Classes

Weekly exercise assignments will be published on this web page (shortly after each lecture). The solutions will be discussed during the corresponding exercise class (usually 1 week after lecture).

Exam/Grades

There will be a written exam on 10th of August (Thursday), in room CAB G61. It will take from 9am to 11am. It will be an open-book examination.

Your final grade will be based solely on the exam.

Following the new D-INFK guidelines for doctoral studies, PhD students get credit points according to the same rules that apply for Bachelor or Master students. That is, with a final grade of at least 4 doctoral students will receive 5KE, and 0KE otherwise.

Frequently Asked Questions

Will there be lecture notes provided?

For some lectures we will provide handwritten notes. You are strongly encouraged to take your own notes. You might find large parts of material covered here: MIT 6.851: Advanced Data Structures.

Are exercise classes mandatory?

Exercises cover an extension of material and application of, so attendance is strongly advised.

Schedule and Weekly Exercises