学界招聘|牛津大学招募算法与复杂性理论博士后

We are looking for an excellent Researcher with specific interests in randomised algorithms, computational counting, or related topics.  Applicants will hold a PhD in the field of Computer Science, Mathematics, or closely related.

The post holder, reporting to Prof Leslie Goldberg, will benefit from a rich academic environment for computer science research, with many researchers working in closely related areas. Oxford’s Algorithms and Complexity Theory Group has an international reputation in many areas of the field, including algorithmic game theory and computational economics, circuit complexity, computational counting problems, constraint satisfaction problems, exact algorithms and fine-grained complexity, foundational issues in computational learning, online algorithms and randomised algorithms.

Applicants will hold a PhD in the field of Computer Science, Mathematics, or closely related.

Whilst the role is a grade 8 position, we would be willing to consider candidates with potential but less experience who are seeking a development opportunity, for which an initial appointment would be at grade 7 (£36,024 - £44,263 p.a.) with the responsibilities adjusted accordingly (for Grade 7, you would be expected to hold a doctoral degree in Computer Science or be close to completion). This would be discussed with applicants at interview/appointment where appropriate.

This post is a full time, fixed term contract until 30 September 2025.

Grade 8: Salary £45,585–£54,395 p.a. (note: post may be under-filled at grade 7: £36,024-£44,263 p.a.)

The closing date for applications is 12 noon on 17 January 2024. Online interviews are expected to be held on 9 February 2024.