<div dir="ltr">
<div id="gmail-:13j" class="gmail-Ar gmail-Au" style="display:block"><div id="gmail-:100" class="gmail-Am gmail-Al editable gmail-LW-avf gmail-tS-tW gmail-tS-tY" aria-label="Message Body" role="textbox" aria-multiline="true" style="direction:ltr;min-height:301px" tabindex="1" aria-controls=":1a4">
<div class="gmail-h7" role="listitem" aria-expanded="true" tabindex="-1"><div class="gmail-Bk"><div class="gmail-G3 gmail-G2"><div><div id="gmail-:2b5"><div><div class="gmail-adn gmail-ads"><div class="gmail-gs"><div class="gmail-"><div id="gmail-:2d8" class="gmail-ii gmail-gt"><div id="gmail-:2b8" class="gmail-a3s gmail-aiL"><div dir="ltr"><span style="color:rgb(0,0,0)">*******************************************************</span><br style="color:rgb(0,0,0)"><span style="color:rgb(0,0,0)">* </span><font color="#000000"><span>PhD positions in Combinatorics, Random Graphs, Logic, Complexity, and Semantics</span></font><br style="color:rgb(0,0,0)"><span style="color:rgb(0,0,0)">* University of Sheffield, UK</span><div><font color="#000000">* Fully funded for 3.5 years for both UK Home and Overseas students</font></div><div><div><font color="#000000">* Possible times to start: ASAP/Spring 2024</font></div><div><font color="#000000">* Deadline: 17th September 2023</font></div><div>* <span style="color:rgb(0,0,0)">Details: </span><a href="https://urldefense.com/v3/__https://www.jobs.ac.uk/job/DCG686/fully-funded-phd-positions-in-combinatorics-random-graphs-logic-complexity-and-semantics-at-university-of-sheffield__;!!IBzWLUs!QyOzq3D1xU_lLIsJCBb9BC8RpiopebcSrv1ACMeeFs91hsnLZGxGYhW154XeW-OTqj_KNbM0lX-nX4kDONDNVE_GkqdlNICgd-Y$" target="_blank">https://www.jobs.ac.uk/job/DCG686/fully-funded-phd-positions-in-combinatorics-random-graphs-logic-complexity-and-semantics-at-university-of-sheffield</a><br style="color:rgb(0,0,0)"><span style="color:rgb(0,0,0)">*******************************************************</span></div></div><div><br></div><div><div>Up
to four fully funded research positions with the opportunity of
undertaking a PhD are available within the Foundation of Computation
(FOX) Group, Department of Computer Science, at the University of
Sheffield: <a href="https://urldefense.com/v3/__http://www.sheffield.ac.uk/dcs/research/groups/foundations-computation__;!!IBzWLUs!QyOzq3D1xU_lLIsJCBb9BC8RpiopebcSrv1ACMeeFs91hsnLZGxGYhW154XeW-OTqj_KNbM0lX-nX4kDONDNVE_GkqdlZc2xX7U$" target="_blank">www.sheffield.ac.uk/dcs/research/groups/foundations-computation</a>.</div><div><br></div><div>The
FOX research group at Sheffield is growing rapidly. These posts provide
excellent opportunities for graduate students (UK and overseas) to
obtain a PhD in any active research area of the group (see below the
research interests of potential supervisors).</div><div><br></div><div>The
posts are fully funded for three and half years. Note that
exceptionally strong overseas candidates will be considered as well,
with full cover of tuition fees.</div><div><br></div><div>Dr. Charles
Grellois is mainly interested in the verification of functional
programs, would they be deterministic or probabilistic. He has worked on
higher-order model-checking in the deterministic case, and on
higher-order termination analysis in the probabilistic case. These
approaches use techniques from linear logic and its models, category
theory, (intersection) type theory, tree automata theory, probabilistic
semantics, realizability… Several interesting questions are still open
so that several different PhD projects could be discussed on these
topics; but he is also open to other research topics in this area, to be
discussed with the prospective student.</div><div><br></div><div>Dr.
Maksim Zhukovskii is interested in combinatorics, probability, logic,
computational and descriptive complexity. Currently Maksim is working on
variety of topics including extremal combinatorics (Turan-type
questions, saturation, colourings, etc), random graphs (thresholds,
limiting distributions, logical limit laws, almost sure theories),
average-case complexity (canonical labelling of random graphs, search
problems in random graphs, reconstruction problems), enumerative
combinatorics (random regular graphs, degree sequences), algebraic
combinatorics (Cayley graphs, isomorphism problem for abelian groups,
matroids), random walks, first order logic and expressive power of its
fragments, second order logic and modal logic. See <a href="https://urldefense.com/v3/__http://scholar.google.com/citations?user=sd_xBDQAAAAJ__;!!IBzWLUs!QyOzq3D1xU_lLIsJCBb9BC8RpiopebcSrv1ACMeeFs91hsnLZGxGYhW154XeW-OTqj_KNbM0lX-nX4kDONDNVE_GkqdlSEb82ls$" target="_blank">scholar.google.com/citations?user=sd_xBDQAAAAJ</a> for the list of publications.</div><div><br></div><div>Dr.
Jonni Virtema is keen to supervise students in any area of his current
research, which relate to the interplay of logic and complexity theory.
Current topics include logics and complexity theory related to numerical
data, and temporal logics designed to express so-called
hyperproperties, which are important in information flow and security. A
further emerging topic is to study foundations of neural networks using
the machinery of logics and complexity theory related to numerical
data. See <a href="https://urldefense.com/v3/__http://www.virtema.fi__;!!IBzWLUs!QyOzq3D1xU_lLIsJCBb9BC8RpiopebcSrv1ACMeeFs91hsnLZGxGYhW154XeW-OTqj_KNbM0lX-nX4kDONDNVE_GkqdlQD0G56c$" target="_blank">www.virtema.fi</a> for further details.</div><div><br></div><div>Dr.
Harsh Beohar is broadly interested in comparative concurrency semantics
and in the interplay of category theory, logic, and semantics. Current
topics include expressive modal logics, behavioural equivalence games,
synthesising distinguishing/characteristic formulae all at the level of
coalgebras. See <a href="https://urldefense.com/v3/__http://dblp.org/pid/13/7482.html__;!!IBzWLUs!QyOzq3D1xU_lLIsJCBb9BC8RpiopebcSrv1ACMeeFs91hsnLZGxGYhW154XeW-OTqj_KNbM0lX-nX4kDONDNVE_Gkqdl8QKM_50$" target="_blank">dblp.org/pid/13/7482.html</a> for an uptodate list of publications.</div></div><div class="gmail-yj6qo"></div><div class="gmail-adL">
</div></div><div class="gmail-adL">
</div></div></div><div class="gmail-hi"></div></div></div><div class="gmail-ajx"></div></div><div class="gmail-gA gmail-gt gmail-acV"><div class="gmail-gB gmail-xu"><div class="gmail-ip gmail-iq"></div></div></div></div></div></div></div></div></div><div class="gmail-kQ gmail-bg gmail-adv"><div class="gmail-Bk"><div class="gmail-G3 gmail-G2"><div><div id="gmail-:2bf"></div></div></div></div></div>
</div></div>
</div>