Tue 10:15 - 12:00 in SR 11
Wed 12:15 - 14:00 in SR 307
Office hours: By appointment
Default is Wednesday 14:15 - 16:00 in SR 307, but upon mutual agreement we can try to find another slot.
Office hours: By appointment
We will issue problem sheets weekly on Tue; you have one week to complete the assignments and can hand them in before Thursday’s lecture electronically. Details will follow. The solutions will then be discussed in the following tutorial. Working in groups is recommended however if assignments are found to have been plagiarized we remove all points from the assignment on the first occurrence and the whole bonification on the second occurrence.
The lecture is held in English. By mutual agreement, the language of instruction can be changed to German, too.
You can solve the assignments in German or in English.
In the first part we will consider classic and new algorithms for memory hierarchies
In the second part we will deal with streaming algorithms and their connection to other models of computation (external-memory, parallelism, power-aware computing). Lower bounds. Initial references:
Lecture notes by Amit Chakrabarti at Dartmouth College from 2020. We will follow them rather closely for the first weeks of the second part.
M. Garofalakis, J. Gehrke, and R. Rastogi (eds) “Data Stream Management: Processing High-Speed Data Streams”, Springer, 2016.
The exam type is to be determined.
tba
tba
| Download | Issued | Due | Comments |
|---|---|---|---|
| tba | tba | tba |