052111 VU Advanced Algorithms (2016W)
Continuous assessment of course work
Labels
Registration/Deregistration
Note: The time of your registration within the registration period has no effect on the allocation of places (no first come, first served).
- Registration is open from Mo 19.09.2016 09:00 to Su 25.09.2016 23:59
- Deregistration possible until Su 16.10.2016 23:59
Details
max. 25 participants
Language: English
Lecturers
Classes
Wed 9:45 - 11:15, Fri 13:15 - 14:45
Location: Seminarraum 11, Waehringerstrasse 29
Begin: Oct 5, 2016
Information
Aims, contents and method of the course
Assessment and permitted materials
There will be two written exams (50 points each) and 6 exercise sheets (= homework sets to be solved at home, 10 points each). The best 5 exercise sheets are counted for the grade.
Presence in class is required, but you can miss up to three lectures without reason. Note that, for each additional lecture you miss, we will subtract 5 points from your points achieved so far.
Presence in class is required, but you can miss up to three lectures without reason. Note that, for each additional lecture you miss, we will subtract 5 points from your points achieved so far.
Minimum requirements and assessment criteria
Grading scale: 100% = 150 points
89% <= P <= 100% Sehr Gut (1)
76% <= P < 89% Gut (2)
63% <= P < 76% Befriedigend (3)
50% <= P < 63% Genügend (4)
0% <= P < 50% Nicht Genügend (5)
89% <= P <= 100% Sehr Gut (1)
76% <= P < 89% Gut (2)
63% <= P < 76% Befriedigend (3)
50% <= P < 63% Genügend (4)
0% <= P < 50% Nicht Genügend (5)
Examination topics
The exams cover all the material presented in class, in the exercise sheets, and in the reading material.
Reading list
Literature will be announced in class and (as far as possible) made available on Moodle.
Association in the course directory
Last modified: Mo 07.09.2020 15:30
PART 1:
Introduction to game theory. The complexity of computing an equilibrium. Social choice theory. Mechanism design. Sponsored search. Combinatorial auctions. Price of anarchy.
PART 2:
Algorithmic techniques for large data sets
Advanced algorithmic models: Randomized algorithms, online algorithms, streaming algorithms, external memory algorithms, distributed algorithms
Latest research topic in graph algorithms