<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 at Saarland University</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Date: </th>
<td>Thu, 16 Dec 2021 13:34:56 +0100</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">From: </th>
<td>Karl Bringmann <a class="moz-txt-link-rfc2396E" href="mailto:bringmann@cs.uni-saarland.de"><bringmann@cs.uni-saarland.de></a></td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Organization:
</th>
<td>Saarland University</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></td>
</tr>
</tbody>
</table>
<br>
<br>
Saarland University<br>
<br>
POSTDOC POSITION IN ALGORITHMS AND COMPLEXITY<br>
<br>
A full-time postdoc position is available in the research group
Algorithms & Complexity led by Professor Karl Bringmann at
Saarland University and affiliated to Max Planck Institute for
Informatics in Saarbrücken, Germany, see
<a class="moz-txt-link-freetext" href="http://people.mpi-inf.mpg.de/~kbringma/">http://people.mpi-inf.mpg.de/~kbringma/</a> The research group is
known for developing fine-grained complexity theory, the area of
theoretical computer science that proves conditional lower bounds
based on conjectures such as the Strong Exponential Time
Hypothesis. The group is both designing new efficient algorithms
and establishing their optimality by conditional lower bounds,
thus arriving at "best-possible" algorithms for problems from
various application areas such as: discrete optimization, string
algorithms, computational geometry, sublinear algorithms, graph
algorithms, database theory, algorithm engineering, and
algorithmic foundations of machine learning. We want to hire a
postdoc who either brings some knowledge in fine-grained
complexity theory or brings expertise in any of these application
areas and wants to explore the use of fine-grained complexity in
their area of expertise.</div>
<div class="moz-forward-container"><br>
</div>
<div class="moz-forward-container">The research group is partially
funded by an ongoing ERC Grant awarded to Karl Bringmann. It is
located on Saarland Informatics Campus, which is a vivid
environment hosting several renowned algorithms researchers
including:<br>
Daniel Marx <a class="moz-txt-link-freetext" href="https://people.mpi-inf.mpg.de/~dmarx/">https://people.mpi-inf.mpg.de/~dmarx/</a>></div>
<div class="moz-forward-container">Kurt Mehlhorn
<a class="moz-txt-link-freetext" href="https://people.mpi-inf.mpg.de/~mehlhorn/">https://people.mpi-inf.mpg.de/~mehlhorn/</a>></div>
<div class="moz-forward-container">Danupon Nanongkai
<a class="moz-txt-link-freetext" href="https://sites.google.com/site/dannanongkai/">https://sites.google.com/site/dannanongkai/</a>></div>
<div class="moz-forward-container">Raimund Seidel
<a class="moz-txt-link-freetext" href="http://www-tcs.cs.uni-sb.de/">http://www-tcs.cs.uni-sb.de/</a>></div>
<div class="moz-forward-container"><br>
</div>
<div class="moz-forward-container">The position has a flexible
starting date in 2022 and can last until end of 2024. If you are
interested, please send your application to
<a class="moz-txt-link-abbreviated" href="mailto:bringmann@cs.uni-saarland.de">bringmann@cs.uni-saarland.de</a> Your application should include a CV
with a list of publications, a research statement, and a short
paragraph describing possible connections to the research group.
To receive full consideration please send your application by
January 12, 2022.<br>
<br>
</div>
</body>
</html>