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

Parallel Algorithms II (SS 99)

* Lecturer:

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

* Time and Place:
To be anounced.

* Exercises:
2 hours per week exercises accompanying the lectures
Time and place to be announced.
Teaching Assistant: N.N.
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 advantagious, but not necessary.

* Recommended for:
In-depth knowledge in topic Algorithms

* Contents:
Cf. http://wwwbrauer.in.tum.de/~rossmani/lehre/pa98/

* Related and Advanced Lectures:

* Lecture Notes:
Not available.

* References:
F. Thomson Leighton:
Introduction to Parallel Algorithms and Architectures: Arrays - Trees - Hypercubes
Morgan Kaufman Publishers, San Mateo, CA, 1992
Joseph JáJá:
Parallel Algorithms
Addison Wesley Publishing Company, 1992

* Office Hours:
look here