The LINKS team at Inria Lille is currently seeking PhD candidates to work on
the topic of "Efficient enumeration via edits". More information on the PhD
subject and the context follows. The deadline to apply is April 23.
Please circulate this offer to potential candidates and colleagues who are
looking for PhD positions (and don't hesitate to contact us to inquire
more).
PhD topic.
We are interested in designing efficient *enumeration algorithms*, i.e.,
algorithms that outputs the solutions to a problem one after another. Such
algorithms are typically used when the number of solutions is large. For this
thesis, we will focus on contexts in which the objects themselves to be
enumerated have a large size, and to tackle this we propose a new enumeration
model that we call "by edits", where the next item to be enumerated is not
written from scratch, but instead one wants to output the description of how to
obtain this item from the previous one. The topic is about designing
efficient algorithms for problems arising from automata theory, graph
theory, and databases. More details can be found here:
<https://phd.cristal.univ-lille.fr/index.cgi/b4eb3bf2291943c7a369595848c612d8/pdf>
Advisors and context.
The PhD will be carried out in LINKS, which is a joint research team
between Inria Lille, the University of Lille, and the CRIStAL
laboratory. The LINKS team offers a dynamic environment for research in
this area and a friendly atmosphere. The PhD will be co-supervised by
Antoine Amarilli (https://a3nm.net/) and Mikaël Monet
(https://mikael-monet.net/). Applications are open until April 23, and
the contract would start in fall 2025.
Candidates.
Candidates to this PhD proposal should have a good background in the
following areas of computer science: discrete mathematics, complexity
theory, formal languages, logic, and databases.
To apply, simply email us at mikael.monet@inria.fr and a3nm@a3nm.net !
Best regards,
Antoine Amarilli and Mikaël Monet
**********************************************************
*
* 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/
*
**********************************************************