Logic List Mailing Archive

Postdoctoral positions in classical and quantum computing, Paris (France), Deadline: 1 Feb 2013

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.

LIAFA is a joint laboratory of the CNRS (the French National Center for 
Scientfic Research) and University Paris Diderot - Paris 7. For more 
information about LIAFA, please see http://www.liafa.univ-paris-diderot.fr 
, and for more information about the Algorithms and Complexity group 
please see http://www.liafa.univ-paris-diderot.fr/algocomp . 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 algocomp-apply@liafa.univ-paris-diderot.fr. For a 
starting date of September 2013, applications should be received by 
February 1st, 2013.