[Job-offers-cs] Postdoc position in Algorithms and Complexity at Oxford

[Pekka Orponen]

-------- Forwarded Message --------
Subject: [DMANET] Postdoc position in Algorithms and Complexity at Oxford
Date: Sat, 18 Jan 2020 09:16:43 +0000
From: Standa Zivny <standa.zivny at cs.ox.ac.uk>
To: dmanet at zpr.uni-koeln.de

A postdoc position is available in the Department of Computer Science at 
the University of Oxford as part of the ERC Starting Grant Power of 
Algorithms in Discrete Optimisation (PowAlgDO) led by Standa Zivny. The 
project focuses on establishing the power of convex relaxations (such as 
linear and semidefinite programming) for various classes of constraint 
satisfaction problems (CSPs) with respect to exact and approximate 
solvability. Strong candidates with any background in maths and 
theoretical computer science will considered.

The initial appointment is for one year, with the possibility of an 
extension until December 2021. The starting date is flexible. The 
position comes with a travel support and no teaching duties. The 
postholder will be a member of Oxford's Algorithms and Complexity Theory 
Group. Salary £41,526 – £49,553 p.a.

The closing date is 12 noon on Friday 21 February UK time.

More details can be found at http://www.cs.ox.ac.uk/news/1777-full.html