A number of postdoc positions are available every year. Please contact the researcher or the head of the pole or thematic team you would like to work with. Have a look of our presentation of IRIF for more details.

We also advertise several related funding programs of the Foundation Sciences Mathématiques de Paris:

For an application through Marie Curie Individual Fellowships program contact us during the spring before the year of the target starting date.

Annual Postdoc Call (opens October - deadline mid-November)

Update: The annual call is closed, but specific openings may remain open for a longer period

IRIF (CNRS and université Paris Diderot), Paris, France, is seeking excellent candidates for about 10 postdoctoral positions in all areas of the Foundations of Computer Science.

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 Diderot created in 2016 as the merger of the previous laboratories LIAFA and PPS. Research in IRIF spans areas such as the design and analysis of algorithms, complexity, combinatorics, quantum computing, networks and complex systems, distributed computation, theory and algorithms of graphs, automata theory and applications, systems modeling and verification, foundations of programming languages, interactive proof assistance systems, computational formalisms. For further information about IRIF please see our presentation of IRIF.

The positions are financed either by the laboratory resources, group or personal grants, or by joint applications of IRIF members and the candidate to outside funding agencies. The starting date of the positions will be in the course of 2019, usually around September-October but that can depend on the financial support. For this call, the application deadline is November 15, 2018, but late applications might be considered for future calls or in case of unfilled positions.

Candidate must hold a Ph.D. degree before the start date of position. Knowledge of French is not required, and applications can be sent either in French or in English. 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.

To apply to the positions, please send a CV including a list of publications, a summary of research, and names and emails of at least three references. Please send your materials to with 1 to 3 keywords describing your main research topics in the subject of your email, and (the annual call is closed, but specific openings may remain open for a longer period) to the contact person(s) for specific application(s). Your application will be reviewed by a local committee and directed to one or more of IRIF’s research groups for consideration.

Specific openings

There is also the possibility to directly apply to one or more of the specific openings listed below. This list is not exhaustive and might be updated. In case of a specific application, it is better to send your email to both and the corresponding contact person(s).

Algorithms and Complexity Several openings are available in 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. Contact: Adi Rosén

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. Contact: Amos Korman

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. Contact: Constantin Enea

Graph Theory Strong candidates on all areas of graph theory are encouraged to apply. We are specially looking for candidates who are working on coloring and homomorphism problems and candidates to work on metric graph theory. For details of specific calls on the former subject see and on the latter subject see Contact: Reza Naserasr

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. Contact: Giuseppe Castagna

Quantum Computing We are looking for excellent candidates to work on quantum algorithms and complexity, in particular in quantum machine learning, optimization, quantum communications and cryptography. 3 years of postdoc are available. Contact: Frédéric Magniez