Logic List Mailing Archive

Several postdoctoral positions in algorithms and complexity: Saarbruecken, Germany (deadline: Jan 31, 2006)

The Max-Planck-Institute for Computer Science seeks several Postdocs for
the Algorithms and Complexity Department (directed by Kurt Mehlhorn).

We are looking for applicants from all areas of algorithmics, e.g., data
structures, complexity theory, graphs, network flow, approximation,
parallel, distributed, external, online, probabilistic, certifying, or
geometric algorithms, communication algorithms for the internet or in
mobile networks, mechanism design, information retrieval, discrete
mathematics, discrepancy theory.

We are also explicitly looking for people interested in algorithm
engineering and the design and implementation of algorithm libraries.

The Max-Planck-Institute for Computer Science is located on the campus of
the Universit"at des Saarlandes in Saarbr"ucken, Germany. The Algorithms
and Complexity Department 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 the U.S. and
has a high international visibility. There is generous travel support
available for all group members. Postdoctoral fellowships are available
for one or two years.

Applications (including curriculum vitae, list of publications, research
plan (1 page is enough), names of references with their e-mail addresses,
intended period of stay, and your two most "interesting" papers
(preferably just URLs)) should be sent by January 31, 2006 to

Kurt Mehlhorn
Max-Planck-Institut f"ur Informatik
Stuhlsatzenhausweg 85
D-66123 Saarbr"ucken
Germany

Electronic applications (email to mayer@mpi-sb.mpg.de) are welcome,
too. For further information refer to
http://www.mpi-sb.mpg.de/units/ag1/offers.html