Algorithms and Complexity Group at IRIF


The theory of efficient algorithms is the common ground that brings together the research directions we investigate, in both classical computing and quantum computing.

In the area of classical computing, we study the complexity of various problems in several models of computation, designing efficient algorithms and proving lower bounds. The particular fields we study are approximation algorithms, property testing, streaming algorithms, online algorithms, algorithmic game theory, communication complexity, and theoretical cryptography. Many of the problems to be studied in these fields require, or can benefit from, probabilistic approaches.

In quantum computing our goals are to study the power of quantum algorithms, to enhance our understanding of the strength of quantum information for computational tasks, cryptography and interaction, and to explore the relation between classical and quantum communication complexity.

The flow of ideas and techniques between quantum and randomized computing, in the two directions, is an important characteristic of some of the research within our group.


We are seeking excellent candidates for permanent and postdoctoral positions in classical and quantum computing. We are also happy to welcome motivated and strong students to pursue a PhD or a Master thesis in our group.

Topics of interest include (but are not limited to): algorithms, online algorithms, streaming algorithms, approximation algorithms, communication complexity, cryptography, computational game theory, quantum computing, computational applications of logic, randomness in computing, privacy.

Further information may be obtained from any of the permanent members of the group.

Permanent positions

Every year, the CNRS (French National Center for Scientifc Research) has job openings, including some openings for researchers in Computer Science. The application deadline is usually in early January. Details are available on the CNRS website.

Faculty positions at the Université Paris Diderot may also be available. The application deadline is usually in March. Details are available on the University website.

We recommend that those who may be interested in applying to such positions in order to join our group to contact one permanent members at least two months before the deadline in order to discuss the possibilities and the application process.

Postdoctoral positions

Starting dates are usually in September but can be negotiated. To apply please send a CV, a summary of research and names of at least three references to [javascript protected email address]. Please arrange that the references send their letters to the same address. Applications and letters should be received by November 15th.

The position(s) will be financed either by group resources, or via joint applications of the candidate and the group to external funding sources.

PhD and Master Theses

For PhD applicants, please contact one of the permanent members no later than spring, since scholarships are allocated just before summer.

For Master internships, please contact permanent members individually with your CV, transcripts and a description of your research interests, at least three months before the start of the internship.


We actively participate in teaching algorithms, complexity and quantum computing at the undergraduate and masters level. Currently we are teaching three courses, Advanced algorithms, Randomness in Complexity (short, long), and Quantum information and applications, in the Paris Computer Science Master's Programme (MPRI).