Advanced Algorithms (Winter 2025/26)
This course will focus on the design and analysis of algorithms, with topics including:
- general principles of algorithm design,
- randomized algorithms,
- dynamic programming,
- flow problems on graphs,
- amortized analysis and advanced data structures,
- theory of NP-completeness,
- approximation methods for hard problems,
- other topics.
Prerequisites are basic knowledge of algorithms and relevant mathematics. All bachelor/master/diploma students interested in advanced algorithmic techniques are welcome. The lectures will be in English.
Organization
Lectures take place every Tuesday and Thursday from 1 pm to 2:30 pm in APB/E005/U, starting October 14.
Tutorials take place every Wednesday from 9:20 am to 10:50 am in APB/E005/U, starting October 22.
Exercises and other material
Exercises are uploaded each week to this folder also mirrored here.
Material from earlier year, notes, videos are uploaded as we go to this folder.
(Let me know if any of these are not accessible for technical reasons.)
Literature
- Cormen, T.H., Leiserson, C.E., Rivest, R.L., and Stein, C. 2022. Introduction to Algorithms. MIT Press.
- Erickson, J. 2023. Algorithms. . [url]
- Kleinberg, J. and Tardos, E. 2005. Algorithm Design. Addison-Wesley.
Kontakt
-
Prof. Dr.
László Kozma
Tel.: +49 (0) 351 463-38232