DD2442 Seminars on Theoretical Computer Science 7.5 credits
Seminariekurs i teoretisk datalogi
This is an advanced course in theoretical computer science with varying content which is given every second year (alternating with DD2445 Complexity Theory).
The general idea is to cover some area of active research in theoretical computer science. Lectures are often based on research or survey papers in that area, and/or on lecture notes from other advanced courses, since the material might be so recent that there are no good textbooks yet.
Education cycleSecond cycle
Main field of studyComputer Science and Engineering
Grading scaleA, B, C, D, E, FX, F
Autumn 18 P1 (7.5 credits)
Language of instruction
Form of study
Number of places
P1: F1, G2. more info
Johan Håstad <firstname.lastname@example.org>
Part of programme
- Master's Programme, Computer Science, 120 credits, year 1, CSTC, Conditionally Elective
- Master's Programme, Computer Science, 120 credits, year 2, CSTC, Conditionally Elective
- Master's Programme, Mathematics, 120 credits, year 1, Optional
- Master's Programme, Mathematics, 120 credits, year 2, Optional
Intended learning outcomes
On completion of the course, a student should be able to: discuss advanced concepts within the field of the course, attack problems within the area of the course actively, both through own work and through search of relevant information, profit by the essential contents of scientific articles within the area of the course.
Course main content
The contents of the course may vary from one year to another. Example on topics is approximation algorithms, data mining, cryptography, parallel computations and probabilistic algorithms.
May vary from one year to another, but knowledge equivalent to one of the courses DD1352 Algorithms, data structures and complexity and DD2352 Algorithms and complexity will always be required. The course co-ordinator can give more instructions.
The course is open to anyone, but the main target audience are advanced Master's students and PhD students in computer science and mathematics.
The formal requirements are that students should have taken DD1352 Algorithms, Data Structures, and Complexity or DD2352 Algorithms and Complexity or corresponding courses at other universities, but quite likely most of what we do will not be too dependent on this material. Although the formal prerequisites are quite limited, students will need mathematical maturity and a willingness to learn new stuff. It should be noted that this will be a somewhat demanding course. (But hopefully even more fun!)
The lectures will be given in English.
Will be announced no later than 4 weeks before the start of the course on the course web.
- ÖVN1 - Exercises, 7.5, grading scale: A, B, C, D, E, FX, F
Requirements for final grade
ÖVN1 - Practical assignments, 7.5 credits, grading scale: A, B, C, D, E, FX, F
Johan Håstad e-post: email@example.com
Johan Håstad <firstname.lastname@example.org>
This course is given at somewhat irregular intervals, usually every second year. The language of tuition is English.
Course syllabus valid from: Autumn 2014.
Examination information valid from: Spring 2019.