Selected Topics in Algorithms II - NTIN111
Title: Selected Topics in Algorithms II
Guaranteed by: Computer Science Institute of Charles University (32-IUUK)
Faculty: Faculty of Mathematics and Physics
Actual: from 2024
Semester: summer
E-Credits: 3
Hours per week, examination: summer s.:2/0, Ex [HT]
Capacity: unlimited
Min. number of students: unlimited
4EU+: no
Virtual mobility / capacity: no
State of the course: taught
Language: English
Teaching methods: full-time
Additional information: https://iuuk.mff.cuni.cz/~vesely/vyuka/jaro23/privacy.html
Guarantor: prof. RNDr. Jiří Sgall, DrSc.
Teacher(s): Mgr. Pavel Hubáček, Ph.D.
Mgr. Pavel Veselý, Ph.D.
Class: Informatika Mgr. - volitelný
Classification: Informatics > Theoretical Computer Science
Opinion survey results   Examination dates   Noticeboard   
Annotation -
This course covers advanced topics in theory of algorithms. Different years will be devoted to a different topic.
Last update: Koucký Michal, prof. Mgr., Ph.D. (15.01.2020)
Aim of the course -

Teach the students selected topics in theory of algorithms.

In the winter of 2019 we will study parameterized algorithms for integer programming.

Last update: Koucký Michal, prof. Mgr., Ph.D. (15.01.2020)
Course completion requirements -

The exam is oral preceded by a written preparation.

Last update: Koucký Michal, prof. Mgr., Ph.D. (15.01.2020)
Literature -

Current research papers

Last update: Koucký Michal, prof. Mgr., Ph.D. (15.01.2020)
Syllabus -

In summer semester 22/23 we will focus on Algorithmic Data Privacy

Last update: Veselý Pavel, Mgr., Ph.D. (01.02.2023)