University of Oxford

Open Data about the University of Oxford

data.ox.ac.uk

beta

Senior Research Associate on Power of Algorithms in Discrete Optimisation

Applications for this vacancy closed on 31 August 2020 at 12:00PM
<div xmlns="http://www.w3.org/1999/xhtml"> <p></p><p>We are pleased to announce the availability of a full-time (flexible options considered) Senior Research Associate, on the Power of Algorithms in Discrete Optimisation project, under the supervision of Professor Standa Zivny. This position is fixed-term for up to 1 year from 1 October 2020, with the possibility of an extension until 31 December 2021.</p><br> <p>The goal of the project is to investigate convex relaxations, such as linear (LP) and semidefinite (SDP) programming, and we seek to establish the power convex relaxations through the lens of, and with the extensions of methods designed for, non-uniform Constraint Satisfaction Problems (CSPs).</p><br> <p>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.</p><br> <p>You will have a doctoral degree in Computer Science/related mathematical discipline, together with a strong publication record and familiarity with the existing literature and research in algorithms, complexity, constraint satisfaction, optimisation or related areas, as witnessed by published, peer-reviewed work. Expertise in algorithm design, computational complexity, linear programming relaxations, semidefinite programming relaxations, or constraint satisfaction problems including algebraic methods for classifying their difficulty is highly desirable.</p><br> <p>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 (&#163;32,817 - &#163;40,322 p.a.) with the responsibilities adjusted accordingly (for Grade 7, you would be expected to hold a doctoral degree in Computer Science or a related discipline, or be close to completion). This would be discussed with applicants at interview/appointment where appropriate.</p><br> <p>Interested candidates may contact Professor Standa Zivny (<a rel="nofollow" href="mailto:standa.zivny@cs.ox.ac.uk">standa.zivny@cs.ox.ac.uk</a>) for more details.</p><br> <p>The closing date for applications is 12.00 noon on Monday 31 August 2020. We expect the interviews to take place in the first half of September.</p><br> <p>Our staff and students come from all over the world and we proudly promote a friendly and inclusive culture. Diversity is positively encouraged, through diversity groups and champions, for example <a rel="nofollow" href="http://www.cs.ox.ac.uk/aboutus/women-cs-oxford/index.html">http://www.cs.ox.ac.uk/aboutus/women-cs-oxford/index.html</a>, as well as a number of family-friendly policies, such as the right to apply for flexible working and support for staff returning from periods of extended absence, for example maternity leave.</p> </div>
dc:spatial
Department of Computer Science, Wolfson Building, Parks Road, Oxford.
Subject
oo:contact
oo:formalOrganization
oo:organizationPart
vacancy:applicationClosingDate
2020-08-31 12:00:00+01:00
vacancy:applicationOpeningDate
2020-08-03 09:00:00+01:00
vacancy:furtherParticulars
vacancy:internalApplicationsOnly
False
vacancy:salary
type
comment

We are pleased to announce the availability of a full-time (flexible options considered) Senior Research Associate, on the Power of Algorithms in Discrete Optimisation project, under the supervision of Professor Standa Zivny. This position is fixed-term for up to 1 year from 1 October 2020, with the possibility of an extension until 31 December 2021.


The goal of the project is to investigate convex relaxations, such as linear (LP) and semidefinite (SDP) programming, and we seek to establish the power convex relaxations through the lens of, and with the extensions of methods designed for, non-uniform Constraint Satisfaction Problems (CSPs).


You ...

We are pleased to announce the availability of a full-time (flexible options
considered) Senior Research Associate, on the Power of Algorithms in Discrete
Optimisation project, under the supervision of Professor Standa Zivny. This
position is fixed-term for up to 1 year from 1 October 2020, with the
possibility of an extension until 31 December 2021.



The goal of the project is to investigate convex relaxations, such as linear
(LP) and semidefinite (SDP) programming, and we seek to establish the power
convex relaxations through the lens of, and with the extensions of methods
designed for, non-uniform Constraint Satisfaction Problems (CSPs).



You ...
label
Senior Research Associate on Power of Algorithms in Discrete Optimisation
notation
147175
based near
page