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

[Pekka Orponen]

The algorithms and Complexity group ( 
https://www.irif.fr/en/equipes/algocomp/index ) of IRIF (CNRS and 
Université de Paris), Paris, France, ( https://www.irif.fr/en/index ) 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, communication complexity, 
query complexity, cryptography (including post-quantum cryptography), 
computational game theory, quantum computing, quantum algorithms, 
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 https://www.irif.fr/en/index , 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 2026 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. Please see more details about the application process 
at https://www.irif.fr/en/postes/postdoc .

Applications should be received by November 2, 2025.