-----------------------------------------------------------------------------------------
Postdoc position on mathematics of constraint satisfaction in Paris
-----------------------------------------------------------------------------------------
A postdoc position is available at LIX, Ecole Polytechnique, France, supported by the ERC Starting Grant CSP-Complexity:
"Constraint Satisfaction Problems: Algorithms and Complexity" held by Manuel Bodirsky.
The goal of the project is to systematically study the computational complexity of CSPs for constraint languages over infinite domains.
Requirements are a PhD degree in Computer Science or Mathematics, and strong background in complexity, universal algebra, or model theory.
The postdoc will be employed by the CNRS and will receive around 2000 euros, free of charges, per month. The position will be for one year with the possibility of a prolongation by another year; the starting date is flexible. There are no teaching obligations, but researchers will have the opportunity to interact with students in the context of their projects. There is generous travel support.
Applications should be sent in electronic form, including a CV, publication list, motivation letter, and a copy or summary of the PhD thesis, to bodirsky@lix.polytechnique.fr. The review of applications begins immediately and continues until the position is filled. Informal inquires by email are welcome.
**********************************************************
*
* 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/
*
**********************************************************