Our project consists of an algorithmic and quantitative study of classical data structures from computer science under the prism of combinatorics. In the last decade many improvements have been achieved in order to characterize the modeling of these data structures as directed acyclic graphs (or DAGs) combinatorially, paving the way for the analysis of objects induced by compaction procedures: in particular, we will focus on Boolean circuits and decision diagrams.
The project thus focuses on considering new types of objects in the combinatorial setting. For some of them, even a proper specification is missing and it could be a major challenge to find one. A further challenge is to extend the generating function algebra to these new settings. We propose next natural challenges we address along the project:
For a deeper presentation of our project, please refer to the presentation of the project we gave for the ANR: expose_Genitrini.
The team has increased.
In Austria:
- Bernhard Gittenberger (PI)
- Nadja Azzouz (Phd student)
- Neena Mary Mathew (Phd student)
- Benedikt Stufler
- Michael Wallner
In France:
- Antoine Genitrini (PI)
- Olivier Bodini
- Julien Clément
- Julien Courtiel
- Amaury Curiel (Phd student)
- Mathieu Dien
- Francis Durand (Phd student)
- Rémi Maréchal (Postdoc)
- Mehdi Naima
- Khaydar Nurligareev (Postdoc)
- Martin Pépin
This project is supported by 
and by 
.