<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] 1.5-Year Post-Doc Position in Algorithms at
Durham University</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Date: </th>
<td>Fri, 25 Mar 2022 13:29:46 +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>
We are seeking candidates for a 1.5-year postdoctoral position
funded<br>
by the EPSRC project "Algorithms for Computing with Uncertainty:
Theory<br>
and Experiments"
(<a class="moz-txt-link-freetext" href="https://sites.google.com/view/thomas-erlebach/home/acute">https://sites.google.com/view/thomas-erlebach/home/acute</a></div>
<div class="moz-forward-container"><br>
</div>
<div class="moz-forward-container">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.<br>
<br>
The successful applicant will work with Thomas Erlebach and
Amitabh Trehan<br>
at Durham University (<a class="moz-txt-link-freetext" href="https://www.durham.ac.uk/">https://www.durham.ac.uk/</a> and with external<br>
collaborators in Bremen and Paris.<br>
<br>
Profile: Candidates should have a PhD in Computer Science or a
related<br>
discipline and a strong research profile in theoretical computer
science<br>
(design and analysis of algorithms, especially online or
approximation<br>
algorithms) or discrete mathematics (graph algorithms,
combinatorial<br>
optimization).<br>
<br>
Application Deadline: 14th April 2022<br>
<br>
Start Date: 3rd May 2022, or soon thereafter<br>
<br>
End Date: 31 October 2023<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></div>
<div class="moz-forward-container"><br>
</div>
<div class="moz-forward-container">For informal enquiries, please
contact Prof Thomas Erlebach<br>
(e-mail: <a class="moz-txt-link-abbreviated" href="mailto:thomas.erlebach@durham.ac.uk">thomas.erlebach@durham.ac.uk</a>).<br>
<br>
</div>
</body>
</html>