Thesis : The Combinatorics of Binary Decision DiagramsPhD school thesis
A line of studies is based on a constructive way to handle the dags. The term constructive here means that no use of the inclusion-exclusion principle is necessary. The first paper by De Felice and Nicaud [FN13] aims at deriving an efficient algorithm to sample objects in the special class of deterministic acyclic automata. Another paper by Genitrini et al. [GPV21] presents another constructive enumeration and an effective uniform sampling for dags.
Using all these notions together, we are now ready to analyze properties of large random dags used at different places in computer science. Our expertise lies in analysis of algorithms using analytic and enumerative combinatorics in order to structurally describe combinatorial objects, to find new specifications and to exhibit universal properties of data structures.
In this Phd project we aim at studying dags structures obtained through the compaction of trees using common substructures sharing. We plan to extend the general methodology to classical families of dags, that can still be seen as compacted structures. Our main focus is on studying typical structure of dags obtained by compaction from a combinatorial point of view. Thus we are interested in enumeration, random sampling and probabilistic analysis with the help of tools from combinatorics and probability theory.
This PhD research project has been submitted for a funding request to “Ecole Doctorale d‘Informatique, Télécommunication et d‘Electronique (EDITE)”. The PhD candidate selected by the project leader will therefore participate in the project selection process (including a file and an interview) to obtain funding.
Contact :Antoine Genitrini