Machine Learning

• Home
• People
• Research
• Teaching
• Publications
• Jobs
• Contact

Advanced Algorithms (Vorlesung Algorithmik)

Department of computer science, University of Hamburg, Winter term 2012/13

Informationen zur Klausur

Bonus-Klausur vom 20.12.2012.

• Um Ihr Ergebnis zu erfahren, kommen Sie bitte in die Vorlesung oder Übung.
• Klausur-Einsicht: Donnerstag, 17.1., 15:45-16:15 (zwischen den Übungsgruppen), Raum D 220.

Endklausur: erster Termin 15.2.2013, zweiter Termin: 27.3.2013. Beide Endklausuren finden am Hauptcampus statt, Details kommen noch. Eine dritte Klausur wird es nicht geben.

When and where

Lecture / Vorlesung: Monday 10:15 - 12:00 (Room D 125, Informatikum) and Wednesday 10:15-12:00 (Room F009, Informatikum)

Tutorials / Übungen: two groups

• Thursday 14-16, D220, in german
• Thursday 16-18, D220, in english

First day of the lecture: 15.10.2012
First day of the tutorials: 25.10.2012

Course material:

Lecture Notes

• Complete version of August 2012: pdf
• Current update: pdf

Videos

The lectures are going to be video-recorded by lecture2go. Videos will be on this page.

Assignments

Solutions are always due on monday 10am. Either send them as a single pdf file to Felix Lindner and use the term [ALG] in the subject line. Or hand the printed / hand-written papers directly to Ulrike von Luxburg before the monday lecture starts.

• Assignment 1
• Assignment 2
  
• Assignment 3
  link to the paper
• Assignment 4
  
• Assignment 5
  
• Assignment 6
  
• Assignment 7
  
• Assignment 8
  link to the paper
• Assignment 9
  
• Assignment 10
  
• Assignment 11
  

Feedback

You want to give some feedback? You can use our online form.

General information:

Information sheet of the first lecture: pdf

Contents

In this course we are going to discuss topics in advanced algorithms and advanced data structures. The course partly builds on material that has been discussed in the Bachelor's courses on introduction to algorithms and data structures. Topics will include:

• Advanced shortest path algorithms
• Flow algorithms in graphs (Ford-Fulkerson, Push-Relabel)
• Graph cuts (algorithms by Stoer-Wagner, Karger-Stein, Spectral clustering)
• Linear programming
• Hashing algorithms
• Nearest neighbor algorithms (KD trees, random projections, locality sensitive hashing)
• Paradigms in algorithm design: dynamic programming, branch and bound, randomized algorithms, local search

Last year's table of contents (this course will be similar, but not identical)

Books

We are going to use three main books, and small pieces from many other books and papers:

• Jon Kleinberg, Eva Tardos: Algorithm Design. 2005
• Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani. Algorithms. McGraw-Hill, 200
• Thomas H. Cormen & Charles E. Leiserson & Ronald L. Rivest & Clifford Stein: Introduction to Algorithms, MIT-Press (2001), 3rd Edition

For fun reading I recommend:

• Vöcking et al.: Taschenbuch der Algorithmen. Springer, 2008.
• MacCormick: 9 Algorithms that changed the future. Princeton University Press, 2012
• Laakmann: Cracking the coding interview. 2010.

Link to more resources: here

Exams

... will be written! The day of the first exam is Feb 15, the day of the second one is Mar 27. There won't be a third exam. Both exams are going to take place on the main campus, details to come.