Friday, November 27, 2015

[DMANET] Postdoc position in complexity at Charles University in Prague

Two postdocs positions are available at the Computer Science Institute of
Charles University in Prague. The position are supported by the European
Research Council (ERC) Consolidator Grant LBCAD: "Lower bounds for
combinatorial algorithms and dynamic problems" held by Michal Koucky. The
goal of the project is to provide lower bounds on the complexity of
algorithmic problems in various settings.

The candidates should have strong background in computational complexity,
algorithms or data structures, and should have completed their Ph.D.
degree in theoretical computer science or mathematics within the last 4
years or will complete their Ph.D. degree by Fall 2016.

Application deadline is January 21, 2016. Starting date is in Fall 2016
or beginning of 2017, and can be negotiated. Informal inquires by email
are welcome.

More information is available at:

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