WIDE Distributed Algorithms team at INRIA/IRISA in Rennes, France.
Funding will be provided by Inria project DisEvo: Distributed Algorithms
on Evolving Data, which focuses on the design and analysis of
distributed algorithm for dynamic graph models. The position is
available immediately, and the initial length of the offer is 1.5 years.
Candidates must hold a Ph.D. degree in Computer Science or a related
area before the starting date of the position. Knowledge of French is
not required.
Candidate profile:
* PhD Degree in Computer Science (or a related area).
* Specialization in Graph Algorithms (online, approximation,
randomized, or distributed algorithms).
* Demonstrated capacity to conduct research at the international level.
Candidates should submit, via email, a CV, a research statement, and
names/emails of two academic references to George Giakkoupis at
george.giakkoupis@inria.fr
--
George GIakkoupis
**********************************************************
*
* 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/
*
**********************************************************