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 20 post-doctoral positions annually in mathematics and in theoretical computer science).
  • The DIM MathInnov Postdoctoral program (granting around 5 post-doctoral positions annually with specific focus on emerging topics in mathematics and computer science).
  • The Paris Region Fellowship (granting around 26 post-doctoral positions annually in all research topics in the Paris Region).

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 3rd, 2019 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 3rd, 2019 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 15, 2019, 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.

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 (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. Apply at: Contact: Adi Rosén.

Combinatorics A postdoc position (up to two years) is available to work with Guillaume Chapuy, supported by the ERC Grant CombiTop. Themes of research include enumerative and algebraic combinatorics, random maps and random trees, discrete probability, or anything that both of us find interesting to think about. The starting date is flexible. Deadline: December 15, 2019. More details here. Application & Contact: (please include “CombiTop2019” in the subject line).

Distributed Biological Algorithms A postdoc position is available under the supervision of Amos Korman, supported by an ERC Consolidator Grant. The topic concerns the study of algorithmic game theoretical principles with a focus on animal behavior contexts. The candidates should have a solid background in the following subjects (1) probability theory (2) programming skills (3) game theory (4) love of animals (5) ability to connect theory with experiments. 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 timed and hybrids systems, programming abstractions for concurrent and distributed software. Application & Contact:

Theory and algorithmics of graphs In the Theory and algorithmics of graphs group, two postdoc positions are available on the following subjects: (1) We need a postdoc to investigate metrics in graphs, either practical problems related to computations of distances in graphs (spanners, eccentricities, diameter) or multimodal shortest paths in road networks, or else more theoretical problems related to delta-hyperbolicity of networks. Further description of the project; (2) We are looking for a researcher with experience of graph coloring, homomorphism and graph minor to work on extension of theory of homomorphisms from graphs to signed graphs. More details. Application & Contact:

Programming Languages An 18-month position is available to work on type systems for programming languages. Candidates must have or be soon to have a PhD in Computer Science with a strong background in type theory, design and implementation of programming languages in particular functional, object-oriented, and/or dynamic ones. Skills in gradual typing and abstract machines will be highly appreciated. Application & Contact:

Quantum Computing We are looking for excellent candidates to work on quantum algorithms and complexity, in particular in optimization, communications and cryptography. Several years of postdoc are available. Apply at: Contact