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

by , under Positions

The Algorithms and Complexity group of IRIF – previously LIAFA –
(CNRS and University ParisDiderot), and 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.

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

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.

Applications should be received by November 15, 2016.