Date: 03 Oct 2001
From: sanders@mpi-sb.mpg.de
Subject: Offerings in Saarbrücken
Meeting in Dagstuhl might be a good idea.
...
So I would like to ask you for some time to get a more complete
picture in mid November. It might also be good if you find good
students at your university who might be interested.
For further information (this time in English)
refer to.
http://www.mpi-sb.mpg.de/~sanders/gisem/
...
Best regards
Peter
P.S. Or was it my job advertisement that I mistankenly sent
in German? Just to make sure here it is again.
The working group Algorithms and Complexity at the M M PPP I I
MM MM P P I I
Max-Planck-Institut f"ur Informatik, Saarbr"ucken M M M PPP I I
M M P I I
is offering PhD / Postdoc Positions, M M P I I
for candidates interested in research linking practical and theoretical
computer science. For national and international projects we are currently
particularly interested in candidates for the following areas:
----------------------------------------------------------------------
GRAPH ALGORITHMS BETWEEN THEORY AND PRACTICE
-----------------------http://www.mpi-sb.mpg.de/~sanders/jobgraph.html
Basic graph algorithms for depth first search, breadth first search,
shortest paths, spanning trees or network flows are well established
compenents of every algorithms course and many applications.
Theory has produced advanced algorithms for these problems
that should theoretically be superior to the simple text book methods.
The subject of the project is to explore the possibility to
transform such advanced approaches in to practicable algorithms
and implementations. We also have the opportunity to
consider algorithms for advance machines models that take
cache efficiency, parallel processing etc. into account.
----------------------------------------------------------------------
HIGH PERFORMANCE I/O:
------------------------http://www.mpi-sb.mpg.de/~sanders/jobdisk.html Connecting many hard disks to a high performance computer in principle
allows to efficiently process huge amounts of data. We want to make it
easy to program such systems. Details like data placement, load
balancing and fault tolerance should be hidden in lower levels
of a software library. On the upper levels frequently needed
algorithmic components such as sorting or search trees should be
available.
Our project is sufficiently flexible so that we could also
tackle other interesting challenges such as
* Innovative file servers
* Parallel file systems
* The Elephant-PRAM: Shared memory for large data sets
* Simple high performance data base kernels
----------------------------------------------------------------------
What we offer
* you work in an international cooperation of renown groups
in the area of algorithms and software libraries
* Generous travel budget
* No teaching obligations
* Internationally competitive payment
What we want
* A MSc in computer science or equivalent
* Basic competence in algorithms and data structures
* Good programming skills, e.g., in C/C++
* Fluency in English (no German required)
* For high performance I/O:
Interest in programming close to the operating system
For more information contact Peter Sanders, sanders@mpi-sb.mpg.de.
Applications (including a covering letter indicating your motivation,
a short curriculum vitae, transcripts documenting your
studies, names of 2-3 people whom we may ask for letters of
recommendation)
should be sent as soon as possible to
Peter Sanders, Dr. rer. nat.
Max-Planck-Institut für Informatik
Stuhlsatzenhausweg 85
66123 Saarbrücken
Germany
Email: sanders@mpi-sb.mpg.de
Phone: ++49 681-9325 115
Fax: ++49 681-9325 199
WWW: http://www.mpi-sb.mpg.de/~sanders/ The Max-Planck-Society intends to increase the number of women in
those areas where they are underrepresented. Women are therefore
explicitly encouraged to apply.