LEA
Department of Computer Science at the Technische Universität München
Chair for Efficient Algorithms
Postal address: 80290 München; Premises: Arcisstr.21, 80333 München
deutsch

Efficient Algorithms and Datastructures (WS 98/99)


* Lecturer:
Prof. Dr. Ernst W. Mayr

* Area:
4+2 lectures per week in area III (Theoretical Computer Science)
core course , topic algorithms

* Time and Place:
Mon 8:30 - 10:00, lecture hall S1128
Wed 8:30 - 10:00, lecture hall S1128
Start: 2. November

* Exercises:
2 hours per week exercises accompanying the lectures
Time and place to be announced.
Teaching Assistant: Jens Ernst
Course Certificate: To get a course certificate students must get at least 40% on the homework assignments and pass the final exam.

* Audience:
graduate students of computer science
students with computer science as minor

* Prerequisites:
1st and 2nd year courses

* Recommended:
Fundamental knowledge in topic Algorithms

* Contents:
This lecture deals in particular with the following topics:
  1. Introduction
  2. Advanced Datastructures
  3. Selection
  4. Minimum Spanning Trees
  5. Shortest Paths
  6. Graph Connectivity
  7. Planar Graphs

* Related and Advanced Lectures:
Efficient Algorithms and Datastruktures II
Randomized Algorithms

* Lecture Notes:
See Lecture Notes

* 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


mayr@informatik.tu-muenchen.de