A number of PhD positions are available every year. Please contact the researcher or the head of the pole or thematic team you would like to work with.

IRIF depends on the graduate school ED 386 - École doctorale de Sciences Mathématiques de Paris Centre. Several scholarships are allocated directly from that school every year.

We also advertise several related funding programs of the Foundation Sciences Mathématiques de Paris and of Université Paris Diderot, which allow conducting doctoral research in one of the associated labs, including IRIF:

An application through Campus France is also possible for individual fellowships.

Description of PhD studies and applications at IRIF

IRIF (CNRS / U. Paris Diderot), Paris, France, is seeking excellent candidates for PhD fellowships 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. Currently, it employs about 90 permanent faculty members, 40 non-permanent full-time researchers, and 50 Ph.D. students.

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.

In France Ph.D. studies are typically of 3 years, and can be extended in some cases to 4 years. Ph.D. fellowships are full time contracts with some optional additional activities such as teaching. Funding Ph.D. studies at IRIF can also be done by an application of the candidate to another institution independent from IRIF (such as his/her current institution, campus France, …), or by an application to a scholarship through IRIF and its related partners (such as IRIF research grants, Paris Diderot University, regional programs, …). About 10 such scholarships are funded through IRIF each year.

Strong candidates with a master degree (or an equivalent degree) are encouraged to contact directly one or more faculty members on the area of their interest. In case there is no clear choice of contact for you, you may write to the leader of the thematic team you would like to join.

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.

We strongly recommend that the first contact is made before March 1st, and even earlier for international fellowships, but late contacts may also be considered for certain scholarships. Ph.D. programs usually start at the beginning of the academic year, but some scholarships can be negotiated to start at a different date.

Specific openings

Algorithms for transportation networks A PhD position is available around the conception of efficient algorithms for transportation networks and more generally graph related data, including robustness aspects with respect to dynamicity. Contact: Laurent Viennot

Biological Game Theory A PhD position is available under the guidance of Amos Korman, supported by an ERC Consolidator Grant. The topic concerns the study of algorithmic game theoretical principles with a special focus on animal behavior, and specifically concerning bats. Corresponding experiments will be conducted by a collaborating group at Tel-Aviv University. The candidate should feel comfortable doing probability theory, programming, game theory, and should love animals. Contact: Amos Korman

Formal Methods for the Analysis of Distributed Algorithms We are looking for a PhD student interested in developing formal techniques to ease the design of distributed algorithms. The PhD will be funded by the project Fredda ( and the student will be co-supervised by Arnaud Sangnier and Benedikt Bollig (LSV-Ens Cachan). The candidates should have a strong background in distributed systems, in logic and automata. Abilities to develop prototypes would be appreciated. Contact: Arnaud Sangnier

Graph Theory We look for strong candidates to do research on various areas of graph theory: Structural graph theory, algorithmic approaches and probabilistic methods. For a particular subject see Contact: Reza Naserasr

Quantum Computing PhD positions are available in area of quantum algorithms for processing massive data sets. The topic includes applications of quantum algorithms to machine learning and the design of quantum algorithms in the context of restricted access to data. Contact: Frédéric Magniez