University of Oxford

Open Data about the University of Oxford

data.ox.ac.uk

beta

Researcher on Algorithms and Lower Bounds: A Unified Approach (ALB)

Applications for this vacancy closed on 13 May 2016 at 12:00PM
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, parameterised 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 closing date for applications is 12.00 noon on 13 May 2016.

dc:spatial
Department of Computer Science, Wolfson Building, Parks Road, Oxford.
Subject
oo:contact
oo:formalOrganization
oo:organizationPart
vacancy:applicationClosingDate
2016-05-13 12:00:00+01:00
vacancy:applicationOpeningDate
2016-04-13 09:00:00+01:00
vacancy:furtherParticulars
vacancy:internalApplicationsOnly
False
vacancy:salary
type
comment

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, parameterised algorithms, proof complexity and communication complexity.


You will collaborate with the principal investigator as well as other researchers, ...

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, parameterised algorithms,
proof complexity and communication complexity.



You will collaborate with the principal investigator as well as other
researchers, ...
label
Researcher on Algorithms and Lower Bounds: A Unified Approach (ALB)
notation
123081
based near
page