Skip to main content

Researcher on Algorithms and Lower Bounds: A Unified Approach

Posted: 13th April 2016

Department of Computer Science, Wolfson Building, Parks Road, Oxford.
Researcher on Algorithms and Lower Bounds: A Unified Approach
Fixed term for up to 2 years (with possibility of extension)
Grade 7: £30,738 - £37,768 p.a.

The department has a new opening for a full-time Researcher on the Algorithms and Lower Bounds: A Unified Approach project, fixed-term for up to 2 years, and reporting to Professor Rahul Santhanam.

The project aims to use recently-discovered connections between complexity lower bound techniques and algorithmic design and analysis to design new and improved algorithms for SAT and other NP-hard problems, and to prove new complexity lower bounds. This requires using techniques from various areas such as structural complexity, exact algorithms, parameterized algorithms, proof complexity and communication complexity. 

You will collaborate with the principal investigator as well as other researchers, students and visitors on the project, and will also have the opportunity to develop and propagate your own research ideas on related topics as a member of one of the largest and most active Algorithms groups in the UK.

The primary selection criteria are a doctoral degree (or very close to completion) in theoretical Computer Science or mathematics together with extensive knowledge of computational complexity theory and/or the theory of exact algorithms for NP-hard problems, and the ability to design and theoretically analyse relevant algorithms.

The post, which is a full-time appointment is funded by ERC, is available for up to 2 years, and has a salary on the University grade 07S scale (currently £30,738 - £37,768 p.a.) This includes membership of the Universities Superannuation Scheme (USS) and has an annual leave entitlement of 38 days per year (inclusive of all public holidays and university closed periods).

The closing date for applications is 12 noon on 13 May 2016.

For further details and to apply please visit: