Thursday, March 15, 2018

[DMANET] Postdoc at KTH, Sweden, on "Distributed and Dynamic Graph Algorithms and Complexity"

[Please note that the deadline for this position is very soon: *March 24,

Applications are invited for a Postdoc position in the group of Danupon
Nanongkai at the Theoretical Computer Science department, KTH Royal
Institute of Technology, Stockholm, Sweden. We are looking for people who
want to work on one or more aspects of the project "Distributed and Dynamic
Graph Algorithms and Complexity", supported by the ERC starting grant and
the Swedish Research Council grant.

While we are open for candidates with expertise from all areas,
candidates who have strong interests in exploring the impact of the
following techniques in the fields of distributed and dynamic graph
algorithms are especially desired: (i) algebraic techniques (e.g. fast
algorithms for matrix multiplication and computing ranks), (ii) spectral
techniques (e.g. fast algorithms for computing maximum flow, sparsest cut,
and tree embedding), (iii) communication complexity, (iv) fine-grained

For more information and how to apply, please visit

* Contributions to be spread via DMANET are submitted to
* 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.