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 November 30, 2022.
  • The MathInGreaterParis fellowship programme, cofunded by Marie Sklodowska-Curie Actions, grants around 12-13 post-doctoral positions annually in mathematics and in theoretical computer science, with a deadline of November 30, 2022.

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

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.
Soft deadline: August 21st, 2023. Apply at: Contact

VeSyAm research project

Position ​for full-time research associates is available to work on the ​VeSyAm research project​, which is a ​ANR grant. The positions ​can start on ​​July 1st, 2023​. Under the supervision of ​Dr ​Mahsa ​Shirmohammadi, you will have responsibility for carrying out research on ​algorithmic ​related to verification and synthesis of algebraic models​​, such as ​algebraic circuits​, ​algebraic power series​ and ​algebraic programs​​. This work draws on connections with a number of areas of computer science and mathematics, including ​verification​, ​​automata​, ​​number theory​​, ​algebraic geometry​​. ​To apply for this position, you will ​need a PhD in Computer Science​ or​ Mathematics​, or being in the process of submitting your PhD thesis​. ​A strong background or a strong interest in one or more of the following areas​ are required​: ​weighted ​automata​, ​holonomic sequences​, ​matrix semigroups​, ​​algebraic geometry​​, ​automata theory​ or ​circuit complexity​​. Applicants will be required to upload a supporting statement, setting out how you meet the selection criteria. The closing date for applications is ​12 noon on ​ 15 Feb 2023​​. Interviews are expected to be held in late ​February. 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:

Polymorphic records in Elixir

[14-month position available]
Elixir is a dynamic functional programming language that runs on the Erlang Virtual Machine. The language has been gaining adoption over the last years in areas such as web applications, embedded systems, data processing, distributed systems, and more. It is used by companies such as PagerDuty, Discord, and Pinterest.

The Research Institute on the Foundations of Computer Science (IRIF) in Paris has started a collaboration with Dashbit and José Valim, the author of Elixir, to define and implement a type system for the language. The system we are devising is a polymorphic type system featuring union and intersection types, occurrence typing, and gradual typing. Records play an important role in Elixir and, more generally, in dynamic languages. The goal of this post-doc position is to develop the polymorphic typing of Elixir records and possibly contribute to its implementation in the Elixir type checker.

Duration: 14 months (further extension is possible)
More information: Elixir post-doc
Application & Contact:

Graph algorithms

Applications for postdoc positions are welcome in the Theory and Algorithmics of Graphs group. Topics of interest include graph algorithms and structural aspect of graphs, with possible connections with temporal graphs. Application & Contact: