Online Algorithmen

Semester:	Sommersemester 2017
Veranstalter:	PD Dr. Unger
Bemerkungen:	Passwortgeschützt. Passwort gibt es, wenn man in der Vorlesung ist. Aufzeichnung und Schnitt: Christoph Rackwitz

Videos

- Organisatorisches, Motivation, Vorschau
- Do, 27.04.2017, 08:30 Uhr
- not recorded
- no lecture
- Fr, 28.04.2017, 08:30 Uhr
- 1: Introduction, Knapsack, Paging.
- Do, 04.05.2017, 08:30 Uhr
- 1: Paging.
- Fr, 05.05.2017, 08:30 Uhr
- 1: Paging: Lookahead, Res. Augmentation.
  2: Randomization: Intro, Paging.
- Do, 11.05.2017, 08:30 Uhr
- Current Research
- Fr, 12.05.2017, 08:30 Uhr
- 2: Yao's Principle, Game Theory
- Do, 18.05.2017, 08:30 Uhr
- 2: Game Theory.
  3: Randomization II: Lower Bound for Randomized Paging.
- Fr, 19.05.2017, 08:30 Uhr
- 3: Randomization II.
  4: Advice, Encoding.
- Fr, 26.05.2017, 08:30 Uhr
- 4: Lower Bounds, for Paging
- Do, 01.06.2017, 08:30 Uhr
- 4: Paging, Randomization.
  5: k-Server Intro
- Fr, 02.06.2017, 08:30 Uhr
- 5: k-Server, Lower Bounds, Potential Function, on the Line
- Fr, 16.06.2017, 08:30 Uhr
- 5: Potential Functions, k-Server on the Line, on Trees...
  6: k-Server with Advice
- Do, 22.06.2017, 08:30 Uhr
- 6: k-Server with Advice, Optimality general, on the line, euclidean plane, randomized conjecture
- Fr, 23.06.2017, 08:30 Uhr
- 7: Job Shop Scheduling
- Do, 29.06.2017, 08:30 Uhr
- 8: The Knapsack Problem
- Fr, 30.06.2017, 08:30 Uhr
- 8: Advice Complexity, Randomized Algorithms, Resource Augmentation
- Do, 06.07.2017, 08:30 Uhr
- 9: Bit String Guessing Problem, known history, unknown history, det. algorithm, rand. algorithm, Advice Complexity
- Fr, 07.07.2017, 08:30 Uhr
- 9: Bit String Guessing, Advice Complexity, Advice-preserving Reductions
- Do, 13.07.2017, 08:30 Uhr
- no lecture
- Fr, 14.07.2017, 08:30 Uhr
- 9: Advice-Preserving Reductions
  10: Graph Coloring Problem
- Do, 20.07.2017, 08:30 Uhr
- 10: Graph Coloring Problem, Coloring Special Graph Classes
- Fr, 21.07.2017, 08:30 Uhr
- Q&A
- Do, 27.07.2017, 08:30 Uhr
- (recording not intended)
  if possible, send in your questions ahead of time
- Q&A continued, maybe
- Fr, 28.07.2017, 08:30 Uhr