Literature
A prime source of information is
Weiss, Data Structures and Algorithm Analysis,
Addison-Wesley, 1999
In this book you can find all discussed data structures and
programming methods. Many of the examples though are drawn from other
sources, other books and scientific litterature. Other useful books
are the following:
-
Brassard and Bratley, Fundamentals of Algorithmics,
Prentice-Hall, 1996. This book contains understandable sections
on solving recurrence relations, on primality testing and NP
completeness.
-
Heun, Grundlegende Algorithmen, Vieweg, 2003. This book contains
nice sections on text algorithms and numerics.
-
Papadimitriou and Steiglitz, Combinatorial Optimization,
Prentice-Hall, 1982. This is a classical text on combinatorial
optimization. It provides many of the simpler algorithms and
uses them to illustrate the primal-dual method.
-
Sahni, Data Structures, Algorithms and Applications in Java,
Mc Graw Hill, 2000. This book provides a welth of algorithms and
data structures and their implementation in Java.
The lecture is supported by a good script. It is nevertheless
strongly recommended to also use the suggested additional sources.
This page was created by Jop Sibeyn.
Last update Sunday, 05 December 04 - 12:45.
For any comments:
send an email.