The Algorithms and Complexity group of LIAFA (CNRS and University Paris Diderot, Paris, France) is seeking excellent candidates for permanent and 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.
Interested candidates should consult the group webpage ( http://www.liafa.univ-paris-diderot.fr/algocomp/ ) for details on the positions available and the application process.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************