PDRA in Algorithms and Hardness for Tarski and Banach Fixed Point Problems

Hours of work: Full-time

Tenure: Fixed term for 3 years, from 1st of January 2027

Hybrid Working: 2 days/week on Campus or minimum requirement of 40% on Campus, with 60% considered desirable where possible

We are seeking candidates for a three-year postdoctoral position funded by the EPSRC project Algorithms and Hardness for Tarski and Banach Fixed Point Problems.

The project will be led by John Fearnley ( https://cgi.csc.liv.ac.uk/~john/) and Rahul Savani ( http://www.csc.liv.ac.uk/~rahul) and will run for three years starting from the 1st of January 2027.

The project will explore the computational complexity of the Tarski problem (finding a fixed point of a monotone function) and the Banach problem (finding a fixed point of a contraction map).

The project aims to build new faster algorithms for solving these two problems, as well as the related monotone contraction problem.

It also aims to show lower bounds for the problems, including query complexity lower bounds, as well as computational complexity lower bounds with a particular focus on the complexity class UEOPL.

An ideal candidate will have a strong background in Theoretical Computer Science and an enthusiasm for working on these problems. The candidate will also have, or be close to completing, a PhD in Computer Science or a related area.

Informal enquiries are welcome, and should be directed to [email protected].

If you are still awaiting your PhD to be awarded you will be appointed at Grade 6, spine point 30. Upon written confirmation that you have been awarded your PhD, your salary will be increased to Grade 7, spine point 31.

Our commitment to Equality, Diversity and Inclusion

We are committed to enhancing a workforce as diverse as our community and particularly encourage applicants who are of minoritised genders and ethnic backgrounds, living with a disability, and/or are members of the LGBTQIA+ community.