[Job-offers-cs] postdoc positions in Algorithms and Complexity at IRIF, Paris, France

[Pekka Orponen]

The Algorithms and Complexity group of IRIF (CNRS and Universite Paris 
Cite), 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, distributed 
algorithms, biological algorithms, communication complexity, 
cryptography (including post-quantum cryptography), computational game 
theory, quantum computing, quantum algorithms (in particular machine 
learning and optimization), quantum communication, computational 
applications of logic, randomness in computing.

IRIF is a joint laboratory of the CNRS (French National Center for 
Scientific Research) and Universite Paris Cite. For more information 
about IRIF, please see http:http://www.irif.fr/ , and for more 
information about the Algorithms and Complexity group please see 
https://www.irif.fr/en/equipes/algocomp/index . 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-October 2023 but may be negotiated.

The position(s) will be financed either by the group's own resources, or 
via joint applications of the candidate and the group to external 
funding sources. Applications should consist of a CV including list of 
publications, a summary of research, and names and emails of at least 
three references and should be emailed to algocomp-apply at irif.fr . For 
further information about the application process please visit 
https://www.irif.fr/en/postes/postdoc . Applications should be received 
by December 15, 2023.