<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 IDSIA, Switzerland</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Date: </th>
<td>Thu, 13 Apr 2023 06:36:11 +0000</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">From: </th>
<td>Mastrolilli Palmo Monaldo <a class="moz-txt-link-rfc2396E" href="mailto:monaldo@idsia.ch"><monaldo@idsia.ch></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>
PostDoc position in Algorithms at IDSIA, USI-SUPSI, Lugano,
Switzerland<br>
<br>
The Algorithms and Complexity Group of IDSIA, USI-SUPSI, Lugano
(Switzerland), opens 1 postdoc position for up to 4 years
supported by the Swiss National Science Foundation project "Ideal
Membership Problems and the Bit Complexity of Sum of Squares
Proofs", project n. no 200021_207429 / 1.<br>
<br>
The group currently consists of 2 PhD students, an IDSIA
researcher, Prof. Mastrolilli, and we collaborate with 2
well-known researchers in the field. The ideal candidate will be
expected to collaborate and work within this group.<br>
<br>
<br>
THE PROJECT<br>
<br>
The project is on the interface of three very active areas of
research in theoretical computer science and mathematics.<br>
The first one deals with polynomial ideals and their properties
and goes all the way back to David Hilbert. The second one is a
widely used tool in complexity, algebraic and semi-algebraic proof
systems such as Sum-of-Squares (SoS), where the main question is
when a proof of a certain property of a polynomial can be
efficiently found. The third area is the analysis of the
complexity of constraint satisfaction problems (CSPs), mainly
through the universal-algebraic approach. These areas address key
problems in theoretical computer science, they produce a very
significant amount of world class research, with many publications
in world-leading venues in theoretical computer science. The
proposed project is about a new direction of research combining
these three areas mentioned above.<br>
More information available here:<br>
<a class="moz-txt-link-freetext" href="https://people.idsia.ch/~monaldo/positions/positions.html">https://people.idsia.ch/~monaldo/positions/positions.html</a>><br>
<br>
OPEN POSITION<br>
<br>
1 PostDoc position for up to 4 years starting as soon as possible.
The position will be filled as soon as eligible candidates with an
appropriate background apply. The gross salary is around 80.000
CHF per year, with low taxes (about 12%). There are no teaching
duties and there is travel support. Candidates should hold (or be
close to obtaining) a Ph.D. in Computer Science, Math, or related
areas, and should have a solid publication record and a solid
background in at least one of the areas mentioned above.<br>
<br>
<br>
IDSIA offers an international working environment. Lugano is a
tidy and lively town, with a wonderful view on Ceresio lake and
mountains around. Ticino Canton offers many opportunities for
hiking, biking, skiing, etc. Local restaurants serve very good
food.<br>
<br>
The interested candidates should email a detailed CV and contact
details of 2-3 references to Prof. Monaldo Mastrolilli.<br>
<br>
<br>
For any question, do not hesitate to contact:<br>
Prof. Monaldo Mastrolilli<br>
monaldo at idsia.ch<br>
<a class="moz-txt-link-freetext" href="http://people.idsia.ch/~monaldo/">http://people.idsia.ch/~monaldo/</a>><br>
<br>
</div>
</body>
</html>