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

[Pekka Orponen]

-------- Forwarded Message --------

Subject: 	[DMANET] Postdoc positions in Algorithms and Complexity at Oxford
Date: 	Wed, 3 Aug 2022 15:27:52 +0100
From: 	Standa Zivny <standa.zivny at cs.ox.ac.uk>
To: 	dmanet at zpr.uni-koeln.de



Two postdoc positions are available in the Department of Computer 
Science at the University of Oxford as part of the UKRI Consolidator 
Grant (previously awarded as ERC CoG) New Approaches to Approximability 
of Satisfiable Problems led by Standa Zivny. The project focuses on 
Promise Constraint Satisfaction Problems (PCSPs) and their computational 
complexity. Strong candidates with any background in maths or 
theoretical computer science will be considered. Background in 
approximation algorithms, universal algebra, category theory, 
combinatorics, or topology would be particularly useful.
The starting date is flexible. The positions are for 2 years, with the 
possibility of extension until summer 2027, and come with travel support 
and no teaching duties. The postholders will be members of Oxford's 
Algorithms and Complexity Theory Group. Salary £42,149 - £50,296 p.a.

The closing date is 12 noon on 12 September 2022 UK time.

More details can be found at http://www.cs.ox.ac.uk/news/2075-full.html>
For informal enquiries email standa.zivny at cs.ox.ac.uk
-------------- next part --------------
An HTML attachment was scrubbed...
URL: https://list.aalto.fi/pipermail/job-offers-cs/attachments/20220805/5d702315/attachment.htm