hide
Free keywords:
-
Abstract:
This text contains the lecture notes for the course
{\em Ausgew\"{a}hlte Kapitel aus Datenstrukturen},
which was given by the author at the Universit\"{a}t des
Saarlandes during the winter semester 1993/94.
The course was intended for 3rd/4th year students having some
basic knowledge in the field of algorithm design.
The following topics are covered: Skip Lists, the Union-Find
Problem, Range Trees and the Post-Office Problem, and
Maintaining Order in List.