|
Lecturer:
Prof. Dr. Ernst W. Mayr
|
|
|
Area:
4+2 SWS, four lectures per week in
area III (Theoretical Computer Science)
core course
, topic algorithms
|
|
|
Time and Place:
Wed 8:30 - 10:00, lecture hall 2750
Thu 10h c.t. - 11:45, lecture hall 2750
Start: 5. November
X-mas holidays: Dez 23 thru Jan 7
|
|
|
Exercises: (german)
2 hours per week exercises accompanying the lectures
Mon 8:30 - 10:00, lecture hall N1070
Start: 10. November
Teaching Assistant: Stefan Bischof
|
|
|
Audience:
graduate students of computer science
students with computer science as minor
|
|
|
Prerequisites:
1st and 2nd year courses
|
|
|
Recommended for:
Fundamental knowledge in topic Algorithms
|
|
|
Contents:
This lecture deals in particular with the following topics:
- Introduction
- Advanced Datastructures
- Selection
- Minimum Spanning Trees
- Shortest Paths
- Matchings
|
|
|
Related and Advanced Lectures:
Efficient Algorithms and Datastructures II
Randomized Algorithms
|
|
|
Lecture Notes:
The course notes
are provided by
von Martin Stumpf, Thomas Schöpf,
Martin Hans und Guido Wimmel.
For the second part of this course,
Advanced Datastructures,
extended course notes are available.
|
|
|
References:
-
Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
-
The design and analysis of computer algorithms
Addison-Wesley Publishing Company, Reading MA, 1976
-
Donald E. Knuth:
-
The art of computer programming Vol. 3 : Sorting and searching
Addison-Wesley Publishing Company, Reading MA, 1973
-
Kurt Mehlhorn:
-
Data structures and algorithms 1 : Sorting and searching
EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin - Heidelberg - New York - London - Paris - Tokyo - Hong Kong, 1984
-
Kurt Mehlhorn:
-
Data structures and algorithms 2 : Graph algorithms and NP-Completeness
EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin - Heidelberg - New York - London - Paris - Tokyo - Hong Kong, 1984
-
Christos H. Papadimitriou, Kenneth Steiglitz:
-
Combinatorial optimization : Algorithms and complexity
Prentice-Hall, Englewood Cliffs, NJ, 1982
-
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest:
-
Introduction to algorithms
McGraw-Hill Book Company,
New York - St. Louis - San Francisco - Montreal - Toronto, 1990
-
Bjarne Stroustrup
-
The C++ programming language
Third Edition,
Addison-Wesley Publishing Company, Reading, MA, 1997
-
Robert Endre Tarjan:
-
Data Structures and Network Algorithms
CBMS-NSF Regional Conference Series in Applied Mathematics, SIAM, Philadelphia, PA, 1983
|
|
|
Office Hours:
look here
|
|
