Positions at MPI for Computer Science - Algorithms Group

Peter Sanders sanders at mpi-sb.mpg.de
Wed Dec 13 16:36:11 PST 2000

                        P O S I T I O N S

         (Research Associates, Postdocs and PhD-Students) 

                             at the

              M A X - P L A N C K - I N S T I T U T E


                   C O M P U T E R   S C I E N C E

The Max-Planck-Institute for Computer Science is located on the
campus of the Universit"at des Saarlandes in Saarbr"ucken, Germany.
The institute was founded in 1990 and consists, at present, of
three research units: Algorithms and Complexity, Logic of
Programming, and Computer Graphics. 

The research group ALGORITHMS AND COMPLEXITY offers 

- Research Associate Positions
- a number of postdoctoral fellowships for the year 2001/2002
- PhD-Positions

We are looking for applicants from all areas of algorithmics, e.g.,
data structures, complexity theory, graph algorithms, approximation
algorithms, parallel, distributed, external, online, probabilistic or
geometric algorithms.
For national and European projects we are particularly looking 
for applicants interested in
- Design and implementation of algorithm libraries
- Algorithms and software for handling parallel disks
- Integer programming and constraint programming
- Internet routing and load balancing algorithms
- Geometric algorithms for curves and surfaces

The group consists mainly of young researchers of several
nationalities. Our working language is English.  The group
collaborates with several of the major research institutions in Europe
and USA and has a high international visibility.  There is generous
travel support available for all group members.

Applications (including curriculum vitae, list of publications,
research plan, names of references with their e-mail addresses, and
intended period of stay) should be sent by January 31, 2001 to

Kurt Mehlhorn
Max-Planck-Institut f"ur Informatik
Im Stadtwald
D-66123 Saarbr"ucken

Electronic applications (email to mayer at mpi-sb.mpg.de) are possible
but should consist of files easy to process on Unix systems (e.g.,
Postscript produced by dvips, pdf, ASCII, HTML). Please avoid MS Word
documents or unprintable Postscript. 

For further information refer to 
or contact Peter Sanders
(sanders at mpi-sb.mpg.de).

The compgeom mailing lists: see
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.

More information about the Compgeom-announce mailing list