Offers
Postdoc
The Algorithms and Complexity group of LIAFA (CNRS and University Paris Diderot), Paris, France, is seeking excellent candidates for one or more postdoctoral positions in classical and quantum computing. 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.
To apply please send a CV, a summary of research and names of at least three references to . For a starting date of September 2012 applications should be received by February 1st, 2012.
PhD Thesis
We are happy to welcome motivated and strong students. Please contact one of the permanent members no later than spring, since scholarships are allocated just before summer.
Research
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, and communication complexity. 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.
Teaching
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, and Quantum information and applications, in the Paris Computer Science Master's Programme (MPRI).