IRIF (CNRS and Université de Paris), Paris, France, is seeking excellent candidates for postdoctoral positions in all areas of the Foundations of Computer Science. Every year, about 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é de Paris created in 2016 as the merger of the previous laboratories LIAFA and PPS. 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 based 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 it 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 (granting around 10 post-doctoral positions annually in mathematics and in theoretical computer science, with a deadline of December 1st).
  • The Paris Region Fellowship (granting around 26 post-doctoral positions annually in all research topics in the Paris Region, with a deadline of October 21st).

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 1st 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, and should be sent, by November 1st 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 20th, a draft of their application to


  • 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.
  • To add an opening, please contact

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


Applications for postdoc positions are welcome in the Combinatorics group. Topics of interest include enumerative, algebraic and analytic combinatorics as well as interactions with analysis of algorithms, number theory, combinatorial physics or probability theory.
Application & Contact:

Formal Verification

Several postdoc positions are available in the Modeling and Verification Group. We are looking for exceptional candidates with a strong, internationally competitive track record of research on algorithmic approaches to system verification and/or programming languages. This includes, but not limited to: model checking, synthesis, software verification and analysis, infinite-state verification, verification of cyber-physical,timed and hybrids systems, programming abstractions for concurrent and distributed software.
Application & Contact:

Quantum computing

Several years of postdoc are available, especially for working on quantum algorithms for massive data, optimization, machine learning, and cryptography. In case of interest, there will be also opportunities to collaborate with industrial partners.
Apply at: Contact