Monday, November 7, 2016

[DMANET] postdoctoral positions at IRIF (prev., LIAFA), Paris, France

The Algorithms and Complexity group of IRIF - previously LIAFA -
(CNRS and University ParisDiderot), Paris, France, is seeking excellent
candidates for one or more postdoctoral positions in classical and quantum
computing. Topics of interest include (but are not limited to): algorithms,
streaming algorithms, approximation algorithms, online algorithms, communication
complexity, cryptography (including post-quantum cryptography), computational
game theory, quantum computing, computational applications of logic, randomness
in computing.

IRIF is a joint laboratory of the CNRS (the French National Center
for Scientific Research) and University Paris Diderot - Paris 7.
For more information about IRIF, please see ,
and for more information about the Algorithms and Complexity group
please see .
Further information may be obtained from any of the permanent
members of the group.

The starting date of the position(s) will usually be in September 2017
but can be negotiated.

The application should include a CV, a summary of research and
names of at least three references. For further instructions on how to
submit applications, please visit the "openings" sections at: .

The position(s) will be financed either by the team's own resources, or
via joint applications of the candidate and the team to external funding

Applications should be received by November 15, 2016.
* Contributions to be spread via DMANET are submitted to
* 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.