252-4230-00L Advanced Algorithms and Data Structures
| Semester | Autumn Semester 2018 |
| Lecturers | P. Widmayer, S. Leucci, P. Uznanski |
| Periodicity | yearly recurring course |
| Language of instruction | English |
| Comment | Number of participants limited to 24. As a prerequisite, students must have more than just basic knowledge on algorithms and data structures. If you have enjoyed the class "Algorithms, Probability and Computing", this seminar is just right for you! The deadline for deregistering expires at the end of the second week of the semester. Students who are still registered after that date, but do not attend the seminar, will officially fail the seminar. Takes place for the last time! |
| Abstract | We will look into modern approaches of algorithms and data structures. A few breakthrough and highly influential papers from the general area of algorithms, from the past 20 years will be selected for students to study. |
| Learning objective | Develop an understanding of modern techniques and paradigms in the design of algorithms and data structures. |
| Content | Topics include (but are not exhausted by): -graph algorithms, -text algorithms, -approximation algorithms, -algebra in algorithms, -streaming algorithms, -conditional lower bounds, -sparsification, -randomness in algorithms, -sampling. |
| Prerequisites / Notice | Algorithms and Data Structures, or equivalent. |