The Department of Computer Science at Durham University is inviting
applications for the position of Postdoctoral Research Associate in
Algorithms, with a particular emphasis on the design and analysis of online
algorithms, approximation algorithms, and algorithms for query-based models of
computing (specifically, computing with explorable uncertainty).
The post is funded by the EPSRC grant "Algorithms for Computing with
Uncertainty: Theory and Experiments". The successful applicant will be
expected to work with Thomas Erlebach and external collaborators in Paris
and Bremen on the research objectives of this EPSRC project.
The main aim of the project is to study algorithms and lower bounds for
the model of explorable uncertainty, where queries can be made to obtain
additional information about an initially uncertain input. This includes
scenarios where a number of queries can be made in parallel, scheduling
problems where the queries are part of the schedule, and problems where the
query cost and solution cost are combined into a single objective.
The research groups ACiD (Algorithms and Complexity in Durham) and NESTiD
(Network Engineering, Science, and Theory in Durham) provide a vibrant
research environment for research in algorithms and networks.
Job Number: 21001510
Salary: Grade 7 (£34,304 to £40,927 per annum)
Application Deadline: 3rd January 2022
Start Date: 1st February 2022, or soon thereafter
Fixed Term Contract initially until 31/10/2022, with a possible extension
by up to 9 months (subject to approval by EPSRC)
For informal enquiries, please contact Prof Thomas Erlebach (e-mail:
thomas.erlebach@durham.ac.uk).
We anticipate that interviews will take place online around 12th January 2022.
Apply here:
https://durham.taleo.net/careersection/du_ext/jobdetail.ftl?job=21001510
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************