Lectures and tutorials will take place electronically.
By mutual agreement, the language of instruction can be changed to German.
In this semester communication will take place via website and e-mails. Please take a look at this website regularly. When sending e-mails to us please use your student e-mail address if possible. In the past, we experienced issues where messages ended in the junk folder.
Tuesday 12:00 - 14:00
Wednesday 12:00 - 14:00
Office hours: By appointment
Friday 16:00 - 18:00
Office hours: By appointment
We will issue problem sheets weekly on Tuesday; you have one week to complete the assignments and hand them in before Tuesday’s lecture electronically. Details will follow. The solutions will then be discussed in the following tutorial. The rules on bonification depend on the type of exam which will be announced in the near future. 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.
Algorithm engineering applies development cycles with a close coupling of design, analysis, implementation, and experimental evaluation in order to narrow the gap between theory and practice. A subset of the following topics will be covered in the lecture:
The exam type is to be determined.
|5||27.04.||Notes||Recording||SSSP Basic & Refined Algorithm|
|7||04.05.||Notes||Recording||SSSP Dijkstra II|
|8||05.05.||Notes||Recording||SSSP Glob-Criterion, ABI-Dijkstra|
|11||18.05.||Notes||Recording||SSSP Lower Bounds|
|13||25.05.||Notes||Recording||SSSP SP-S II, Smoothed Complexity|
|14||26.05.||Notes||Recording||Smoothed Complexity II|
|16||02.06.||Notes||Recording||Bidirectional search II|
|18||09.06.||Notes||Recording||Matrix Multiplication, Lower Bound Sorting|
|19||15.06.||Notes||Recording||Lower Bound Sorting II, EM Mergesort|
|20||16.06.||Notes||Recording||EM Mergesort 2|
|21||22.06.||Notes||Recording||EM Fifo & Dict|
|22||23.06.||Notes||Recording||(a, b)-trees, EM PQs|
|23||29.06.||Notes||Recording||B-Trees, Time Forward Processing (TFP)|
|24||30.06.||Notes||Recording||TFP Tree Expression Evaluation, Ind. Set|
|26||07.07.||Notes||Recording||List Ranking II / Euler Tours|
|27||13.07.||Recording||MSFs / Connected Components|
|28||14.07.||Recording||Random Graph Generation|
Assignments Algorithm Engineering
|Assignment 1||20.04.||27.04. 12 PM|
|Assignment 2||27.04.||04.05. 12 PM|
|Assignment 3||04.05.||11.05. 12 PM||template, sudoku_3.txt, sudoku_4.txt|
|Assignment 4||11.05.||18.05. 12 PM||template|
|Assignment 5||18.05.||25.05. 12 PM|
|Assignment 6||25.05.||02.06. 12 PM (sic!)|
|Assignment 7||01.06. (updated 11AM)||08.06. 12 PM|
|Assignment 8||15.06.||22.06. 12 PM|
|Assignment 9||22.06.||29.06. 12 PM|
|Assignment 10||29.06.||06.07. 12 PM|