Tuesday, February 5, 2019

Postdoc position in algorithms and complexity at Charles University in Prague

A postdoc position is available at the Computer Science Institute of Charles University in Prague. The position is supported by a five year project "EPAC: Efficient approximation algorithms and circuit complexity" funded by the Grant Agency of the Czech Republic. The project is focused on approximation algorithms in fine-grained and parameterized complexity and on lower bound techniques.

The candidates should have strong background in algorithms or computational complexity, 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 2019.

Application deadline is February 28, 2018. Starting date is in Fall 2019, and can be negotiated. Informal inquires by email to koucky@iuuk.mff.cuni.cz are welcome.

More information is available at: http://iuuk.mff.cuni.cz/~koucky/EPAC/