HEINZ NIXDORF INSTITUT
UNI

Algorithms and Complexity

Friedhelm Meyer auf der Heide

Home
Research
Teaching
Institutions
Members
Links

back to HNI:
Home
  Working Groups

Webmaster

Date: September 6th, 2003

»Communication in Networks«


Welcome to the »Communication in Networks« website for the WS 2003/2004.

Something interesting:

An article in »Informatik-Spektrum«: Parallelrechner und wissenschaftliches Rechnen from M. Dal Cin und S. Kindermann. © Springer-Verlag, Informatik-Spektrum 19 (1996) 91-92
An article in »ForschungsForum Paderborn«: Von der Hollerith-Maschine zum Parallelrechner from F. Meyer auf der Heide und R. Wanka. © ForschungsForum Paderborn 3 (2000) 112-116.
A paper from AG Meyer auf der Heide »Minimizing Congestion in General Networks« H. Räcke
In: Proc. of the 43rd FOCS (Vancouver), pp. 43-52. 2002.
Abstract or compressed postscript.
Script from AG Monien »Parallele Algorithmen« Prof. Dr. B. Monien, Jürgen Schulze, Sven Grothklags Script.

Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.
Frank Thomson Leighton;.
Morgan Kaufmann, 1992.
Parallel Complexity Theory.

Ian Parberry.
Pitman/Wiley, 1987. (WWW)

Literature from the university library
Author Title Signature
JaJa An Introduction to Parallel Algorithms 41 TVI 2330
Leighton Introduction to Parallel Algorithms and Architectures: Array, Trees, Hypercubes 41 TVH 2204
van Leeuwen Handbook of Theor. Comp. Science, Chapter 17: Parallel Algorithms for Shared Memory Machines 40 TVA 2136
Gibbons, Rytter Efficent Parallel Algorithms 41 TVI 1855
Chaudhuri Parallel Algorithms, Design and Analysis 41 TVI 2364
Reif Synthesis of Parallel Algorithms 41 TVM 2982
Lynch Distributed Algorithms 41 TVI 3174
Kumar, Grama, Gupta, Karypis Introduction to Parallel Computing: Design and Analysis of Algorithms 41 TWT 3173
Graham, Knuth, Patashnik Concrete Mathematics 41 TPC 1413
Motwani, Raghavan Randomized Algorithms 41 TVI 3051



If you have any comments or corrections, please contact: vodisek@upb.de