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 II (SS 99)


* Lecturer:
Prof. Dr. Ernst W. Mayr

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

* Time and Place:
Mon 8:30 - 10:00, lecture hall S1128
Thu 8:30 - 10:00, lecture hall S1128
Start: 3. May

* Exercises:
2 hours per week exercises accompanying the lectures
Mon 10h c.t. - 11:45, room S2229
Start: 17. May
Teaching Assistant: Martin Raab
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
Course Efficient Algorithms and Datastructures I advantageous, but not necessary.

* Recommended for:
In-depth knowledge in topic Algorithms

* Contents

* Related and Advanced Lectures:

* Lecture Notes:
Not 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
Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin:
Network Flows: Theory, Algorithms, and Applications
Prentice Hall, Englewood Cliffs, NJ, 1993
Robert Endre Tarjan:
Data Structures and Network Algorithms
CBMS-NSF Regional Conference Series in Applied Mathematics, SIAM, Philadelphia, PA, 1983
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

* Interesting links
* Office Hours:
look here


mayr@informatik.tu-muenchen.de