[DMANET] Short-term postdoc position at KTH in dynamic, distributed, and streaming graph algorithms (there are possibilities for staying longer)

A postdoctoral position is available in the Theoretical Computer Science
Department at KTH Royal Institute of Technology. A successful candidate
will work with Danupon Nanongkai (
https://sites.google.com/site/dannanongkai/), but is also encouraged to
persue his/her own research interest. The research focus for this position
will be on developing algorithms and hardness results for basic graph
problems in dynamic, distributed and streaming settings. Considered graph
problems include, but not limited to, shortest paths, maximum matching,
minimum cut, and routing. Candidates that have backgrounds related to these
areas and problems are encouraged to apply. Related areas do not only
include dynamic, distributed and streaming algorithms, but also online
algorithms, sublinear-time algorithms, property testing, and graph
algorithms in general.

This is a full-time position. It is initially available for 6 months. Those
who prefer a long-term position are encouraged to contact me to discuss the
possibilities. The successful candidate is expected to start in July 2015,
although this is to some extent negotiable.

To apply, send your CV and a list of references to danupon@gmail.com.

About KTH: KTH Royal Institute of Technology is the largest and oldest
technical university in Sweden. No less than one-third of Sweden's
technical research and engineering education capacity at university level
is provided by KTH. The School of Computer Science and Communication (KTH
CSC) is one of the leading research environments in Information Technology
in Sweden with activities at KTH and partly at Stockholm University. The
Theoretical Computer Science department (http://www.csc.kth.se/tcs/) offers
a strong research environment covering a wide range of research topics such
as complexity theory and approximation algorithms, computer and network
security, cryptography, formal methods and natural language processing. The
group has a consistent track record of publishing in the leading
theoretical computer science conferences and journals worldwide, and the
research conducted here has attracted numerous international awards and
grants in recent years.

**********************************************************
*
* 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/
*
**********************************************************