In the course we will build on the things learnt in the introductory algorithmic courses.
The course is for ph.d. students and students pursuing their masters degree, who wants to learn the most present research results within the field of algorithms. The course is planned in such a way that it can be followed by students that have followed "Advanced Datastructures" or just an introductory course in algorithms.
The aim of the course is to make you confident in theoretical problems as well as challenging practical problems within the field of algorithms. You must be able to learn new research-results within the subject and furthermore learn to use several of the newest techniques and methods. The course will touch on different techniques such as radomization, approximation, and complex analysing methods.
The course will provide a foundation for doing your own research within the field.
Examples of subjects we might touch are:
Introductory course in algorithms such as Introduction to Algorithms and Datastructures at IT-C or DAT 2A at DIKU. That is you are familiar with subjects such as priority queues, union-find, search-trees, simple graph algorithms, sorting etc.
Lectures and seminars as well as mandatory assignments.
The exam is passed/failed based on an oral examination with external censor. You can only enter exam if you have solved some assignments satisfactory.
Stephen Alstrup
Theis Rauhe
As well as guest teachers