University, Saarbruecken, Germany.
We seek candidates with a strong research record in theoretical computer
science, with a focus on algorithms, computational complexity,
algorithmic game theory, algorithms engineering or related areas. We are
particularly interested in candidates whose work aligns with the core
topics addressed at top-tier conferences such as FOCS, STOC and SODA.
There are numerous opportunities for collaborative research with other
institutes on campus, in particular with the algorithms and complexity
group of the Max-Planck Institute. This is a permanent full
professorship (lifetime tenure) at the German academic salary scale W3.
Website:
https://www.uni-saarland.de/fileadmin/upload/verwaltung/stellen/Wissenschaftler/W2672_Professorship__W3__in_Algorithms_and_Complexity.pdf
Contact: Markus Blaeser, mblaeser@cs.uni-saarland.de
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
