Context

IRIF (CNRS and Université Paris Cité), Paris, France, is seeking excellent candidates for postdoctoral positions in all areas of the Foundations of Computer Science. Every year, about 5-10 new postdocs join IRIF.

IRIF (Institute for Research in Foundations of Computer Science) is a joint laboratory of the CNRS (French National Center for Scientific Research) and Université Paris Cité. Currently, it hosts about 90 permanent faculty members, 40 non-permanent full-time researchers, and 50 Ph.D. students.

The research conducted at IRIF is focused on the study and understanding of the foundations of all areas of computer science. Such research work relies on mathematical concepts developed and studied within it, but also contributes directly to mathematics. Typical areas include, but are not limited to: algorithms, their design and analysis, automata theory and applications, combinatorics, complex systems, complexity, computational formalisms, distributed computation, foundations of programming languages, interactive proof assistants, graph theory and its algorithms, logic, networks, quantum computing, software development, systems modeling and verification. For further information about IRIF please see our presentation of IRIF.


How to Apply

The starting date of the positions is usually in September-October, but this may sometimes vary. The postdoc positions at IRIF are financed either by IRIF research grants, or by joint applications of IRIF members and the candidate to outside funding agencies with which IRIF is affiliated. These are, for example,

  • The FSMP Postdoctoral programme grants around 10 post-doctoral positions annually in mathematics and in theoretical computer science, with a deadline of December 1, 2025.

An application through the Marie Curie Individual Fellowships program is also possible for individual fellowships (Please contact us about six months before the intended application date).

Candidates must hold a Ph.D. degree in Computer Science or a related area before the starting date of the position. Knowledge of French is not required, and applications can be sent either in French or in English.

Applications to outside funding agencies such as those listed above should be made directly to the relevant program. However, it is strongly recommended to contact by November 15th one or more of the permanent members of IRIF, those closest to the potential candidate's area, in order to coordinate the application.

Applications to the openings listed below should include a CV with list of publications, a summary of research and names and emails of at least three references. They should be sent by November 2, 2025 to the relevant email listed below for each opening (late applications may be considered if positions are not filled). It is recommended, prior to applying, to contact one or more of the permanent members of IRIF, those closest to the potential candidate's area, in order to get more information.

Note that one may apply to more than one postdoc position at IRIF. Potential candidates who consider applying for a postdoctoral position at IRIF, but are not sure to which position(s) to apply, are invited to get advice on this issue by sending, by October 26, 2025, a draft of their application to postdoc-advice@irif.fr.


Openings

  • Please note that members of IRIF may publish additional calls for postdoc openings which are not part of this joint call.
  • In addition to the openings listed below and the outside funding agencies listed above, one may contact the head(s) of the team(s) of IRIF closest to the potential candidate's area, in order to inquire about possible additional options, adding one's CV to the email.

Algorithms and Complexity

Several openings are available in the Algorithms and Complexity group. Topics of interest include, but are not limited to: algorithms, streaming algorithms, approximation algorithms, online algorithms, distributed algorithms, communication complexity, cryptography, computational game theory, quantum computing, computational applications of logic, randomness in computing.
Apply at: algocomp-apply@irif.fr. Contact: adi.rosen@irif.fr.

Theory of quantum programming languages

The Proofs and Programmes team at IRIF is inviting applications for a post-doctoral position to work on (logical and formal) principles of quantum programming languages and quantum processes. Open call.

Contact: faggian@irif.fr Apply at: faggian@irif.fr

Quantum computing

The Algorithms & Complexity group at IRIF (CNRS, Université Paris-Cité) in Paris (France) invites applications for multiple fully funded postdoc positions (1-3yrs) to work on the theory of quantum computing. Candidates with expertise in quantum computing or theoretical computer science more broadly are encouraged to apply.
The group has expertise in quantum algorithms and quantum complexity theory, and includes permanent members such as Simon Apers, Geoffroy Couteau, Pierre Fraigniaud, Iordanis Kerenidis, Sophie Laplante, Frédéric Magniez, Claire Mathieu, Miklos Santha and Adrian Vladu.
Open call. Apply at: algocomp-apply@irif.fr. Contact simon.apers@irif.fr.

Imperative languages and process calculi

The team lead by Giovanni Bernardi welcomes post-doctoral applications to extend the theory and/or the implementation of contextual preorders and observational refinements for non-deterministic imperative languages and for process calculi. Possible avenues of research include, in the imperative setting, accounting for stacks and queues, and, in the process algebraic setting, accounting for dynamic binding (i.e. scope extrusion).

Contact: gio@irif.fr Apply at: gio@irif.fr