postdoctoral positions at IRIF (prev., LIAFA), Paris, France

The Algorithms and Complexity group of IRIF – previously LIAFA –
(CNRS and University ParisDiderot), and 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,
streaming algorithms, approximation algorithms, online algorithms, communication
complexity, cryptography (including post-quantum cryptography), computational
game theory, quantum computing, computational applications of logic, randomness
in computing.

The application should include a CV, a summary of research and
names of at least three references. For further instructions on how to
submit applications, please visit the “openings” sections at:
algo.irif.univ-paris-diderot.fr .

For more information about IRIF, please see
http://www.irif.univ-paris-diderot.fr ,
and for more information about the Algorithms and Complexity group
please see http://algo.irif.univ-paris-diderot.fr .
Further information may be obtained from any of the permanent
members of the group.

Applications should be received by November 15, 2016.

Submit a post

You can use the anonymous submission form to upload information about an event, a blog post or a job posting. It will be published when it is approved by the moderator.

Calendar

May 2024
M T W T F S S
 12345
6789101112
13141516171819
20212223242526
2728293031  

Other Posts