<html><head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
</head>
<body>
<p>-------- Forwarded Message --------</p>
<div class="moz-forward-container">
<table class="moz-email-headers-table" cellspacing="0" cellpadding="0" border="0">
<tbody>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Subject:
</th>
<td>[DMANET] Postdoc position in Algorithms for Computing
with Uncertainty at Durham University</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Date: </th>
<td>Thu, 9 Dec 2021 11:24:28 +0000</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">From: </th>
<td>ERLEBACH, THOMAS <a class="moz-txt-link-rfc2396E" href="mailto:thomas.erlebach@durham.ac.uk"><thomas.erlebach@durham.ac.uk></a></td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">To: </th>
<td><a class="moz-txt-link-abbreviated" href="mailto:DMANET@zpr.uni-koeln.de">DMANET@zpr.uni-koeln.de</a> <a class="moz-txt-link-rfc2396E" href="mailto:DMANET@zpr.uni-koeln.de"><DMANET@zpr.uni-koeln.de></a></td>
</tr>
</tbody>
</table>
<br>
<br>
The Department of Computer Science at Durham University is
inviting<br>
applications for the position of Postdoctoral Research Associate
in<br>
Algorithms, with a particular emphasis on the design and analysis
of online<br>
algorithms, approximation algorithms, and algorithms for
query-based models of<br>
computing (specifically, computing with explorable uncertainty).<br>
<br>
The post is funded by the EPSRC grant "Algorithms for Computing
with<br>
Uncertainty: Theory and Experiments". The successful applicant
will be<br>
expected to work with Thomas Erlebach and external collaborators
in Paris<br>
and Bremen on the research objectives of this EPSRC project.<br>
<br>
The main aim of the project is to study algorithms and lower
bounds for<br>
the model of explorable uncertainty, where queries can be made to
obtain<br>
additional information about an initially uncertain input. This
includes<br>
scenarios where a number of queries can be made in parallel,
scheduling<br>
problems where the queries are part of the schedule, and problems
where the<br>
query cost and solution cost are combined into a single objective.<br>
<br>
The research groups ACiD (Algorithms and Complexity in Durham) and
NESTiD<br>
(Network Engineering, Science, and Theory in Durham) provide a
vibrant<br>
research environment for research in algorithms and networks.<br>
<br>
Job Number: 21001510<br>
Salary: Grade 7 (£34,304 to £40,927 per annum)<br>
Application Deadline: 3rd January 2022<br>
Start Date: 1st February 2022, or soon thereafter<br>
Fixed Term Contract initially until 31/10/2022, with a possible
extension<br>
by up to 9 months (subject to approval by EPSRC)<br>
<br>
For informal enquiries, please contact Prof Thomas Erlebach
(e-mail:<br>
<a class="moz-txt-link-abbreviated" href="mailto:thomas.erlebach@durham.ac.uk">thomas.erlebach@durham.ac.uk</a>).<br>
<br>
We anticipate that interviews will take place online around 12th
January 2022.<br>
<br>
Apply here:<br>
<a class="moz-txt-link-freetext" href="https://durham.taleo.net/careersection/du_ext/jobdetail.ftl?job=21001510">https://durham.taleo.net/careersection/du_ext/jobdetail.ftl?job=21001510</a>><br>
<br>
</div>
</body>
</html>