<html><head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
</head>
<body>
<p><br>
</p>
<div class="moz-forward-container"><br>
<br>
-------- Forwarded Message --------
<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] Algorithms research positions within ERC
project in Venice, Italy</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">Date: </th>
<td>Fri, 8 Apr 2022 09:19:44 +0200</td>
</tr>
<tr>
<th valign="BASELINE" nowrap="nowrap" align="RIGHT">From: </th>
<td>Nicola Prezza <a class="moz-txt-link-rfc2396E" href="mailto:nicola.prezza@unive.it"><nicola.prezza@unive.it></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 colleagues,<br>
<br>
I'm looking to recruit one assistant professor (3+2 years; RTD-A
in Italian<br>
regulation) and several postdocs (up to 3 years each) starting as
soon as<br>
September 1st, 2022 (or later) within my ERC StG project REGINDEX
(<br>
<a class="moz-txt-link-freetext" href="https://pric.unive.it/projects/regindex">https://pric.unive.it/projects/regindex</a> A PhD in Computer Science
or<br>
Mathematics is preferred (but not strictly required) for the
postdocs,<br>
while a PhD in Computer Science is required for the assistant
professor.<br>
The research will take place in the scientific campus of Ca'
Foscari<br>
University, Venice (<a class="moz-txt-link-freetext" href="https://apps.unive.it/mappe/sede/990025">https://apps.unive.it/mappe/sede/990025</a> The
salary is<br>
competitive: about 28k net per year for the postdocs (these
positions are<br>
tax-free), and 25k net per year for the assistant professor.<br>
<br>
The research fits into the broad area of graph algorithms. The
project<br>
introduces a new technique for sorting the nodes of graphs and
finite<br>
automata in order to solve efficiently hard problems including
graph<br>
isomorphism, NFA equivalence, and compression (see<br>
<a class="moz-txt-link-freetext" href="https://epubs.siam.org/doi/pdf/10.1137/1.9781611975994.55">https://epubs.siam.org/doi/pdf/10.1137/1.9781611975994.55</a> and<br>
<a class="moz-txt-link-freetext" href="https://epubs.siam.org/doi/pdf/10.1137/1.9781611976465.153">https://epubs.siam.org/doi/pdf/10.1137/1.9781611976465.153</a> for
more<br>
details). Applications include computational pan-genomics, graph
databases,<br>
and regular expression matching. The ideal candidate should be
skilled in<br>
at least one of the following topics: algorithms, data structures,
C++<br>
programming, formal languages, data compression, bioinformatics.<br>
Familiarity with the project's topics and techniques is not a
requirement:<br>
anyone interested in the broad topics of graph algorithms and/or
formal<br>
languages is welcome to apply.<br>
<br>
If you are interested in the positions or know anyone that might
be, do not<br>
hesitate to send me an email: <a class="moz-txt-link-abbreviated" href="mailto:nicola.prezza@unive.it">nicola.prezza@unive.it</a><br>
<br>
thanks!<br>
Nicola<br>
<br>
<pre class="moz-signature">--
Nicola Prezza
Assistant Professor
Dipartimento di Scienze Ambientali, Informatica e Statistica
Università Ca' Foscari
Via Torino, 155 - 30170 Mestre, Venezia (VE), Italia
nicola.prezza@ <a class="moz-txt-link-rfc2396E" href="mailto:nprezza@luiss.it"><nprezza@luiss.it></a>unive.it
</pre>
</div>
</body>
</html>