The Algorithms and Complexity group of IRIF – previously LIAFA –
(CNRS and University Paris Diderot), Paris, France, is seeking excellent
candidates for one or more postdoctoral positions. The financing of this position
is provided by the ANR grant RDAM joint to that group and the Talgo team of the
Computer Science Department at the Ecole Normale Superieure, Paris.
Topics of interest include (but are not limited to):
algorithms, streaming algorithms, approximation algorithms, online algorithms,
computational game theory; and the application to those areas, or the
development, of complexity tools such as communication complexity or
information theory.
The successful candidate will be based at the Algorithms and Complexity
group of IRIF, but will be expected to interact also with the Talgo team
(located just 15 minutes away), and to work jointly with members of
both teams.
IRIF is a joint laboratory of the CNRS (the French National Center
for Scientific Research) and University Paris Diderot – Paris 7.
For more information about IRIF, please see
http://www.irif.univ-paris-diderot.fr/en/index ,
and for more information about the Algorithms and Complexity group
please see https://www.irif.univ-paris-diderot.fr/en/equipes/algo/index .
The Computer Science Department of the Ecole Normale Superieure
is a joint laboratory of the ENS, the CNRS, and INRIA. For more informations
about that department please see:
http://www.di.ens.fr/WebHome.html.en ,
and for more information about the Talgo team please see:
http://www.di.ens.fr/TalgoTeam.html.en .
The starting date of the position will usually be in September 2016
but can be negotiated.
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:
http://algo.irif.univ-paris-diderot.fr/ .
Due to a tight schedule, applications should be received by March 31, 2016.