Senior Research Associate on New Approaches to Approximability of Satisfiable Problems

www.findapprenticeship.service.gov.uk - Jobboard; Oxford; On-site; GBP 48,000 - 58,000; Full time

Job summary

A leading educational institution in Oxford is seeking a Senior Research Associate to work on new approaches to approximability of satisfiable problems. Candidates should hold a doctoral degree in Computer Science with a strong publication record. This role offers a competitive salary and excellent benefits, including a generous pension scheme and annual leave. The position requires on-site work but allows for remote working arrangements by agreement.

Benefits

Excellent contributory pension scheme

38 days annual leave

Comprehensive childcare services

Family leave schemes

Cycle loan scheme

Discounted bus travel

Qualifications

• Strong publication record in relevant fields.
• Familiarity with literature in algorithms or complexity.
• Postdoctoral experience preferred but not essential.

Responsibilities

• Conduct research on CSPs and develop new algorithms.
• Write research articles for peer-reviewed journals.
• Organise and delegate work among team members.

Skills

Research in computational complexity

Knowledge of combinatorics

Publication record

Education

Doctoral degree in Computer Science or related discipline

Job description

Department of Computer Science, Parks Road, Oxford
Senior Research Associate on New Approaches to Approximability of Satisfiable Problems
Fixed-term contract for 12 months starting in January 2026
Grade 08RS: £48,235-£57,255 per annum inclusive of Oxford University weighting
Potential to under fill at grade 07RS: £38,674-£46,913 per annum inclusive of Oxford University weighting

The Department of Computer Science has a new opening for Postdoctoral Researchers on New Approaches to Approximability of Satisfiable Problems. The post holder will work with the Principal Investigator, Professor Standa Zivny to investigate:

• computational complexity of constraint satisfaction problems (CSPs), and
• combinatorics related to CSPs.

The goal of this project is to investigate structural properties of CSPs, develop novel approaches for proving hardness, and devise new algorithms.
You will be expected to conduct individual research and develop research questions, regularly write research articles at a national level for peer-reviewed journals, agree clear task objectives, organise, and delegate work to other members of the team, and share responsibility for shaping the research group’s plans.
You will have a doctoral degree in Computer Science or related mathematical discipline together with a strong publication record and familiarity with the existing literature in the area of algorithms, or complexity, or combinatorics. Knowledge of mathematics relevant to the study of constraint satisfaction, postdoctoral experience, and experience working in collaborative environments is desirable but not essential.
This post is based at the Department of Computer Science and on-site working is required. Remote working is possible in agreement with Professor Standa Zivny.
What We Offer
As an employer, we genuinely care about our employees’ wellbeing and this is reflected in the range of benefits that we offer including:
• An excellent contributory pension scheme
• 38 days annual leave (pro-rata for part-time jobs)
• A comprehensive range of childcare services
• Family leave schemes
• Cycle loan scheme
• Discounted bus travel and Season Ticket travel loans
• Membership to a variety of social and sports clubs

Diversity
Committed to equality and valuing diversity.

Application Process
You will be required to upload an up-to-date CV and a supporting statement as part of your online application.

Your supporting statement must clearly demonstrate how you meet each of the essential selection criteria listed in the job description. Applications that do not include a supporting statement or CV, or fail to address the criteria in sufficient detail, will not be considered.

While we recognise the value of AI tools in assisting with application preparation, submissions that are clearly AI-generated without personalisation or insight will be rejected. It's crucial that your application reflects your own experiences and understanding of the role.
The closing date for applications is 12 noon on Wednesday 17 September 2025. Interviews are expected to be held in early-October 2025.