and Complexity at Sapienza University in Rome.
Under the National PRIN project "Logical Methods in Combinatorics"
we are looking for an excellent junior researcher with a recent PhD
in Computer Science, Mathematics or Logic whose research interests
can complement and interact with the research profile of the group of
the project which is made by Nicola Galesi, Lorenzo Carlucci e Massimo
Lauria.
Research interests include (but are not limited to) Proof Complexity,
theoretical aspects of SAT-solving, Reverse Mathematics,
Computability.
The position will be available for one year and half starting
presumably in January 2024. The postdoc (In Italy called "Assegno di
ricerca") will be formally based at the Department of Computer,
Control and Management Engineering (DIAG) of Sapienza (N. Galesi),
but in collaboration with the Department of Mathematics (L. Carlucci )
and that of Statistics (M. Lauria).
Sapienza is the major Italian university and one of the biggest
all over Europe. For research in Theory of Computing Sapienza is the
first Italian university according to CS rankings
(https://csrankings.org/) and the Department of Mathematics received
the Italian award of "Dipartimento di Eccellenza" in 2023-2027. Rome
is the capital of Italy and a vibrant cultural city well connected
with the rest of the world and with a reasonable cost of living.
If interested please send as soon as possible a detailed CV to
nicola.galesi@uniroma1.it with SUBJECT: LCC-PD
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
