Efficient Algorithms

Lecturer:
Stefan Schirra

Lectures:
Thursday 15-17, G22A-105

Exercises:
Tuesday, 17-19, G29-E037

Exercise 1 (pdf)   (1.3)
Exercise 2 (pdf)   (2.2)
Exercise 3 (pdf)   (3.2)
Exercise 4 (pdf)   
Exercise 5 (pdf)   
Exercise 6 (pdf)   
Exercise 7 (pdf)   
Exercise 8 (pdf)   

Purpose:
The purpose of this course is to give an introduction to the design and analysis of efficient algorithms and data structures for selected combinatorial problems.

Audience:
computer science (Hauptstudium and master), computational visualistics (Hauptstudium and master)

Prerequisites:
Basic knowledge in algorithms and data structures (such as sorting algorithms, balanced binary search trees, lists, and stacks), and in asymptotic analysis using the Big-Oh notation.

Literature:

Required:



Michael Goodrich, Roberto Tamassia
Algorithm Design
Wiley


Further reading:

Thomas H. Cormen, Charles E. Leiserson, Ron Rivest, Clifford Stein
Introduction to Algorithms
MIT Press

Kurt Mehlhorn
Data Structures and Algorithms Vol. 1-3
Springer Verlag

Kurt Mehlhorn, Stefan Näher
LEDA: A Platform for Combinatorial and Geometric Computing
Cambridge University Press

Thomas Ottmann, Peter Widmayer
Algorithmen und Datenstrukturen (in German)
Spektrum Verlag

Uwe Schöning
Algorithmik (in German)
Spektrum Verlag