The Algorithms and Complexity group of LIAFA (CNRS and University Paris
Diderot), 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, computational game theory, quantum computing,
computational applications of logic, randomness in computing, privacy.

LIAFA is a joint laboratory of the CNRS (the French National Center
for Scientific Research) and University Paris Diderot – Paris 7.
For more information about LIAFA, please see
http://www.liafa.univ-paris-diderot.fr ,
and for more information about the Algorithms and Complexity group
please see http://www.liafa.univ-paris-diderot.fr/algocomp .
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 2016
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:
http://www.liafa.univ-paris-diderot.fr/algocomp .

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
sources.

Applications should be received by November 15, 2015.