<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 positions in Algorithms and Complexity
              at Oxford</td>
          </tr>
          <tr>
            <th valign="BASELINE" nowrap="nowrap" align="RIGHT">Date: </th>
            <td>Wed, 3 Aug 2022 15:27:52 +0100</td>
          </tr>
          <tr>
            <th valign="BASELINE" nowrap="nowrap" align="RIGHT">From: </th>
            <td>Standa Zivny <a class="moz-txt-link-rfc2396E" href="mailto:standa.zivny@cs.ox.ac.uk">&lt;standa.zivny@cs.ox.ac.uk&gt;</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></td>
          </tr>
        </tbody>
      </table>
      <br>
      <br>
      Two postdoc positions are available in the Department of Computer
      Science at the University of Oxford as part of the UKRI
      Consolidator Grant (previously awarded as ERC CoG) New Approaches
      to Approximability of Satisfiable Problems led by Standa Zivny.
      The project focuses on Promise Constraint Satisfaction Problems
      (PCSPs) and their computational complexity. Strong candidates with
      any background in maths or theoretical computer science will be
      considered. Background in approximation algorithms, universal
      algebra, category theory, combinatorics, or topology would be
      particularly useful. <br>
      The starting date is flexible. The positions are for 2 years, with
      the possibility of extension until summer 2027, and come with
      travel support and no teaching duties. The postholders will be
      members of Oxford's Algorithms and Complexity Theory Group. Salary
      £42,149 - £50,296 p.a.<br>
      <br>
      The closing date is 12 noon on 12 September 2022 UK time.<br>
      <br>
      More details can be found at
      <a class="moz-txt-link-freetext" href="http://www.cs.ox.ac.uk/news/2075-full.html">http://www.cs.ox.ac.uk/news/2075-full.html</a>&gt;<br>
      For informal enquiries email <a class="moz-txt-link-abbreviated" href="mailto:standa.zivny@cs.ox.ac.uk">standa.zivny@cs.ox.ac.uk</a><br>
      <br>
    </div>
  </body>
</html>