<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] Assistant professor position on Algorithms and
Complexity Theory, KTH, Sweden</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Date: </th>
<td>Wed, 9 Nov 2022 15:40:09 +0000</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">From: </th>
<td>Aristides Gionis <a class="moz-txt-link-rfc2396E" href="mailto:argioni@kth.se"><argioni@kth.se></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>
KTH Royal Institute of Technology has a vacancy for one assistant
professor position in Computer Science with specialization in
Algorithms and Complexity Theory. <br>
The subject consists of foundational theoretical computer science.
It covers research in all areas of algorithms and complexity
theory such as circuit complexity, combinatorial optimization,
communication complexity, distributed algorithms, graph
algorithms, quantum algorithms and proof complexity. <br>
Applications must be made online through the KTH job portal. Full
position details, including how to apply online can be found at: <br>
<a class="moz-txt-link-freetext" href="https://www.kth.se/en/om/work-at-kth/lediga-jobb/what:job/jobID:508144/type:job/where:4/apply:1">https://www.kth.se/en/om/work-at-kth/lediga-jobb/what:job/jobID:508144/type:job/where:4/apply:1</a>
<br>
The deadline for online applications is November 28, 2022. <br>
Job reference number: VL-2022-0057<br>
<br>
</div>
</body>
</html>