<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 in Computational Complexity in Lisbon</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Date: </th>
<td>Tue, 18 Oct 2022 16:55:41 +0100</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">From: </th>
<td>Bruno Loff <a class="moz-txt-link-rfc2396E" href="mailto:bruno.loff@gmail.com"><bruno.loff@gmail.com></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>
Dear all,<br>
<br>
I'm looking for two or three postdoctoral researchers to join me
at the<br>
University of Lisbon, as part of the ERC Starting Grant "The
Hardness of<br>
Finding Good Algorithms".<br>
<br>
The project focuses on metacomplexity and unconditional
lower-bounds. We<br>
will study problems around formula complexity, circuit complexity,<br>
communication complexity, data structures, etc, both classical and
quantum<br>
(but with more emphasis on classical).<br>
<br>
I'm looking for strong candidates with a background in maths and<br>
theoretical computer science, and I'm particularly interested in
people who<br>
have proven unconditional lower-bounds (of any kind). Papers on
CCC, but<br>
also STOC/FOCS/SODA/ICALP/RANDOM/STACS/MFCS/CSR (track A) are a
sign you<br>
are likely a good fit for the project.<br>
<br>
The following topics currently appear to be relevant to different
parts of<br>
the project, so if you are knowledgeable of and/or interested in
learning<br>
about some of them, all the better:<br>
* communication complexity<br>
* representation theory of finite groups<br>
* convex optimization,<br>
* interior-point methods<br>
* stochastic games<br>
* data-structure lower-bounds<br>
* algebraic complexity<br>
<br>
The starting date is flexible, between March-September 2023. The
position<br>
is for 2 years, with the possibility of extension until March
2028. There<br>
is generous travel support available and no teaching duties (but
frequent<br>
contributions to our seminar are expected). Gross salary is
45.000-49.000<br>
EUR/year (depending on experience), which, if I computed
correctly, should<br>
amount to ca. 2300-2500/month net salary.<br>
<br>
I expect two of the positions to be filled by mid-late January
2023, at the<br>
latest. A decision on individual applicants will not be made
before<br>
November 1, so you may think of that as a soft deadline for
applying. After<br>
November 1, someone may have filled the position already, but
there is<br>
flexibility in the number of positions, so you may apply anyway.<br>
<br>
You may see a longer description of the project at:<br>
<a class="moz-txt-link-freetext" href="https://brunoloff.wordpress.com/hofga/">https://brunoloff.wordpress.com/hofga/</a>><br>
If you wish to apply, please send me your CV, a short cover
letter, and two<br>
references.<br>
<br>
If you have any questions, feel free to contact me:
<a class="moz-txt-link-abbreviated" href="mailto:bruno.loff@gmail.com">bruno.loff@gmail.com</a>.<br>
<br>
See you,<br>
Bruno Loff<br>
<br>
<br>
</div>
</body>
</html>