Postdoctoral Fellow at Carnegie Mellon University (apply by February 28, 2019)

Postdoctoral Position at the computer science department, CMU. Hosted by Venkatesan Gurusawami and Pravesh Kothari. Start Date: Fall 2019 (Flexible)
Application Deadline: Feb 28, 2019 (earlier applications encouraged).

To apply, send CV, a research statement and arrange for 2 letters of recommendation to be set to be sent to bcook@cs.cmu.edu with subject line mentioning “CMU theory postdoc.”

Website: https://www.cs.princeton.edu/~kothari/theory-postdoc.html
Email: kothari@cs.princeton.edu

Postdoctoral Fellow at Carnegie Mellon University (apply by February 28, 2019)

Postdoc at Charles University in Prague (apply by February 28, 2019)

Several one‐year post‐doc positions are available at the Computer Science Institute of Charles University, with a possibility of one-year extension. The positions are in areas of algorithms, cryptography, computational complexity, combinatorics and graph theory. Starting date is in Fall 2019, and can be negotiated.

Website: https://iuuk.mff.cuni.cz/~koucky/iuuk-postdocs.html
Email: koucky@iuuk.mff.cuni.cz

Postdoc at Charles University in Prague (apply by February 28, 2019)

PhD student at Charles University in Prague (apply by February 28, 2019)

Positions for PhD students are available at the Computer Science Institute of Charles University within the framework of the project “Efficient approximation algorithms and circuit complexity” funded by the Grant Agency of the Czech Republic. Applications are invited from candidates who have strong background in theoretical computer science or discrete mathematics. Starting date: Fall 2019.

Website: https://iuuk.mff.cuni.cz/~koucky/EPAC/positions.html
Email: koucky@iuuk.mff.cuni.cz

PhD student at Charles University in Prague (apply by February 28, 2019)

Postdoc at Charles University in Prague (apply by February 28, 2019)

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. Starting date is in Fall 2019, and can be negotiated.

Website: https://iuuk.mff.cuni.cz/~koucky/EPAC/
Email: koucky@iuuk.mff.cuni.cz

Postdoc at Charles University in Prague (apply by February 28, 2019)