Thèse de Doctorat (2009) : Expressions Booléennes aléatoires : probabilité, complexité et comparaison quantitative de logiques propositionnelles. [pdf]

Mémoire d'HDR (2017) : Combinatoire énumérative et analytique en Logique Propositionnelle et en Théorie de la Concurrence : Vers une quantification de l'expressivité des modèles. [pdf]


Asymptotic Enumeration of Compacted Binary Trees of Bounded Right Height. [arXiv]
A. Genitrini, B. Gittenberger, M. Kauers and M. Wallner. Submitted to a Revue.
28. Extended boxed product and application to synchronized trees. [pdf][bib]
O. Bodini, A. Genitrini, and N. Rolin. ENDM.
27. Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets. [pdf][bib]
O. Bodini, M. Dien, A. Genitrini and F. Peschanski. Accepted for CSR'17.
26. The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes. [pdf][bib]
O. Bodini, M. Dien, A. Genitrini and F. Peschanski. In proc. 14th SIAM Meeting on Analytic Algorithmics and Combinatorics (ANALCO'17), pp 16-30, 2017..
25. The relation between tree size complexity and probability for Boolean functions generated by uniform random trees. [arXiv]
V. Daxner, A. Genitrini, B. Gittenberger and C. Mailler. In journal Applicable Analysis and Discrete Mathematics, pp 408-446, vol. 10, no. 2, 2016.
24. Full asymptotic expansion for Polya structures. [arXiv]
A. Genitrini. In proc. 27th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA'16), pp 151-162, 2016.
23. Generalised and Quotient Models for Random And/Or Trees and Application to Satisfiability. [pdf][bib]
A. Genitrini and C. Mailler. In journal Algorithmica, vol. 76, no. 4, pp 1106-1138, 2016.
22. A quantitative study of pure parallel processes. [pdf][bib]
O. Bodini, A. Genitrini and F. Peschanski. In Electronic Journal of Combinatorics (EJC), vol. 23, no. 1, P1.11, 39 pages, (electronic), 2016.
21. Increasing Diamonds. [pdf][bib]
O. Bodini, M. Dien, X. Fontaine, A. Genitrini and H.-K. Hwang. In proc. 12th. Latin American Theoretical INformatics Symposium. (LATIN), pp 207-219, 2016.
20. Pointed versus Singular Boltzmann Samplers: a Comparative Analysis. [pdf][bib]
O. Bodini, A. Genitrini, and N. Rolin. In journal PUre Mathematics and Application, vol. 25, no. 2, pp 115-131, 2015.
19. Associative and commutative tree representations for Boolean functions. [pdf][bib]
A. Genitrini, B. Gittenberger, V. Kraus and C. Mailler. In Theoretical Computer Science Journal, vol 570, pp 70-101, 2015.
18. Associativity for Binary Parallel Processes: a Quantitative Study. [pdf][bib]
O. Bodini, A. Genitrini, F. Peschanski and N. Rolin. In proc. 1st Conference on Algorithms and Discrete Applied Mathematics (CALDAM'15), pp 217-228, 2015.
17. Cuts in increasing trees. [pdf][bib]
O. Bodini and A. Genitrini. In proc. 12th SIAM Meeting on Analytic Algorithmics and Combinatorics (ANALCO'15), pp 66-77, 2015.
16. Pointed versus Singular Boltzmann Samplers. [pdf]
O. Bodini, A. Genitrini, and N. Rolin. Conference without proceedings: Gascom'14.
15. No Shannon effect induced by And/Or trees. [pdf][bib]
A. Genitrini, Bernhard Gittenberger and C. Mailler. In proc. 25th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA'14), Discrete Mathematics and Theoretical Computer Science (HAL), pp 109-120, 2014.
14. Equivalence classes of random Boolean trees and application to the Catalan satisfiability problem. [pdf][bib]
A. Genitrini and C. Mailler. In proc. 11th. Latin American Theoretical INformatics Symposium. (LATIN), volume 8392 of Lecture Notes in Computer Science, pp 466-477, 2014.
13. The Combinatorics of Non-determinism. [pdf][bib]
O. Bodini, A. Genitrini and F. Peschanski. In proc. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'13), Leibniz International Proceedings in Informatics, pp 425-436, 2013.
12. Probabilities of Boolean Functions Given by Random Implicational Formulas. [pdf][bib]
A. Genitrini, B. Gittenberger, V. Kraus and C. Mailler. In Electronic Journal of Combinatorics (EJC), 19, No. 2, P37 (electronic), 2012.
11. Enumeration and Random Generation of Concurrent Computations. [pdf][bib]
O. Bodini, A. Genitrini and F. Peschanski. In proc. 23rd International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA'12), Discrete Mathematics and Theoretical Computer Science, pp 83-96, 2012.
10. In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid. [pdf][bib]
A. Genitrini and J. Kozik. In Annals of Pure and Applied Logic (APAL), 163 No. 7, pp 875-887, 2012.
9. The fraction of large random trees representing a given boolean function in implicational logic. [pdf][bib]
H. Fournier, D. Gardy, A. Genitrini and B. Gittenberger. Random Structures and Algorithms (RSA), 40 No. 3, pp 317-349, 2012.
8. Tautologies over implication with negative literals. [pdf][bib]
H. Fournier, D. Gardy, A. Genitrini and M. Zaionc. In Journal Mathematical Logic Quarterly (MLQ), 56 No. 4, pp 388-396, 2010.
7. No Shannon effect on probability distributions on Boolean functions induced by random expressions. [pdf][bib]
A. Genitrini and B. Gittenberger. In proc. 21st International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA'10), Discrete Mathematics and Theoretical Computer Science, pp 303-316, 2010.
6. Balanced And/Or trees and linear threshold functions. [pdf][bib]
H. Fournier, D. Gardy and A. Genitrini. In proc. 6th SIAM Workshop on Analytic and Combinatorics (ANALCO’09), pp 51-57, 2009.
5. Quantitative comparison of Intuitionistic and Classical logics - full propositional system. [pdf][bib]
A. Genitrini and J. Kozik. In Proc. International Symposium on Logical Foundations of Computer Science (LFCS), volume 5407 of Lecture Notes in Computer Science, pp 280-294, 2009.
4. On the Density and the Structure of the Peirce-like Formulae. [pdf][bib]
A. Genitrini, J. Kozik and G. Matecki. In proc. 5th Colloquium on Mathematics and Computer Science, Discrete Mathematics and Theoretical Computer Science, pp 461-474, 2008.
3. Complexity and Limiting Ratio of Boolean Functions over Implication. [pdf][bib]
H. Fournier, D. Gardy, A. Genitrini and B. Gittenberger. In Proc. 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 5162 of Lecture Notes in Computer Science, pp 347-362, 2008.
2. Intuitionistic vs Classical Tautologies, Quantitative Comparison. [pdf][bib]
A. Genitrini, J. Kozik and M. Zaionc. In Proc. TYPES 2007, volume 4941 of Lecture Notes in Computer Science, pp 100-109, 2008.
1. Classical and intuitionistic logic are asymptotically identical. [pdf][bib]
H. Fournier, D. Gardy, A. Genitrini and M. Zaionc.In Proc. 16th Annual Conference on Computer Science Logic (EACSL),, volume 4646 of Lecture Notes in Computer Science, pp 177-193, 2007.