Publications 2007-2026

• 2026
  • O. Bodini, A. Genitrini, Kh. Nurligareev : “Growing binary trees”, GASCom on random generation of combinatorial structures, Malosco, Italy (2026)
  • J. Clement, A. Genitrini : “Counting Reduced Ordered Binary Decision Diagrams With Respect to Size”, ACM Transactions on Computational Logic, (Association for Computing Machinery) (2026)
  • S. Dreyer, A. Genitrini, M. Naima : “Asymptotic Enumeration of Labeled Triangle-Free Graphs through the Combinatorics of Directed Acyclic Graphs of Shortest Paths”, (2026)
  • A. Curiel, A. Genitrini : “Lexicographic unranking algorithms for the Twentyfold Way”, (2026)
  • O. Bodini, A. Genitrini, Kh. Nurligareev : “The Distribution of the Deepest Leaves in Binary Trees”, (2026)
• 2025
  • S. Dreyer, A. Genitrini, M. Naima : “Optimal Uniform Shortest Path Sampling”, WALCOM: Algorithms and Computation, vol. 15411, Lecture Notes in Computer Science, Chengdu, China, pp. 160-179, (Springer Nature Singapore) (2025)
  • N. Appel, J. Bourdon, N. Bousquet, J. Cohen, A. Genitrini, P. Georgeon, Y. Grandvalet, K. Jaffrès‑Runser, A. Legrand, D. Markham, A. Muscholl, A. Paparrizou, L. Paulevé, M. Poss, M. Gradinariu Potop‑Butucaru, J.‑F. Raymond, R. Rouvoy, Y. Sallent, P. Senellart, Th. Seiller, Y.‑Q. Song, A. Tchana, H. Waeselynck : “Section 06 Sciences de l’information : fondements de l’informatique, calculs, algorithmes, représentations, exploitations: Rapport de conjoncture 2024”, 1-20 pages (2025)
• 2024
  • A. Curiel, A. Genitrini : “Lexicographic Unranking Algorithms for the Twelvefold Way”, 35^th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024), vol. 302, Leibniz International Proceedings in Informatics (LIPIcs), Bath, United Kingdom, pp. 17:1-17:14, (Schloss Dagstuhl -- Leibniz-Zentrum fur Informatik) (2024)
• 2023
  • J. Clement, A. Genitrini : “An Iterative Approach for Counting Reduced Ordered Binary Decision Diagrams”, 48^th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), vol. 272, Leibniz International Proceedings in Informatics (LIPIcs), Bordeaux, France, pp. 36:1-36:15, (Schloss Dagstuhl - Leibniz-Zentrum für Informatik), (ISBN: 978-3-95977-292-1) (2023)
• 2022
  • M. Dien, A. Genitrini, F. Peschanski : “A Combinatorial Study of Async/Await Processes”, The 19^th International Colloquium on Theoretical Aspects of Computing, vol. 13572, Lecture Notes in Computer Science, Tbilisi, Georgia, pp. 170-187, (Springer) (2022)
  • A. Genitrini, M. Naima, O. Bodini : “A combinatorial link between labelled graphs and increasingly labelled Schröder trees”, The 15^th Latin American Theoretical Informatics Symposium, vol. 13568, Lecture Notes in Computer Science, Guanajuato, Mexico, pp. 493-509, (Springer) (2022)
  • A. Genitrini, M. Pépin, F. Peschanski : “A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space”, Theoretical Computer Science, vol. 912, pp. 1-36, (Elsevier) (2022)
  • O. Bodini, A. Genitrini, B. Gittenberger, I. Larcher, M. Naima : “Compaction for two models of logarithmic-depth trees: Analysis and Experiments”, Random Structures and Algorithms, vol. 61 (1), pp. 31-61, (Wiley) (2022)
  • O. Bodini, A. Genitrini, C. Mailler, M. Naima : “Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study”, Advances in Applied Mathematics, vol. 133, pp. 102284, (Elsevier) (2022)
• 2021
  • A. Genitrini, M. Pépin : “Lexicographic unranking of combinations revisited”, Algorithms, vol. 14 (3), pp. 97, (MDPI) (2021)
  • O. Bodini, M. Dien, A. Genitrini, F. Peschanski : “Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency”, Discrete Mathematics and Theoretical Computer Science, vol. vol. 22 no. 3, Computational Logic and Applications (CLA'19) (3), Computational Logic and Applications (CLA'19), (DMTCS) (2021)
  • A. Genitrini, M. Pépin, A. Viola : “Unlabelled ordered DAGs and labelled DAGs: constructive enumeration and uniform random sampling”, Procedia Computer Science, vol. 195, Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, Sao Paulo, Brazil, pp. 468-477, (Elsevier) (2021)
• 2020
  • A. Genitrini, M. Pépin, F. Peschanski : “Statistical Analysis of Non-Deterministic Fork-Join Processes”, Theoretical Aspects of Computing - ICTAC 2020 - 17^th International Colloquium, vol. 12545, Lecture Notes in Computer Science, Macau, China, pp. 83-102, (Springer) (2020)
  • O. Bodini, A. Genitrini, B. Gittenberger, S. Wagner : “On the number of increasing trees with label repetitions”, Discrete Mathematics, vol. 343 (8), pp. 111722, (Elsevier) (2020)
  • O. Bodini, A. Genitrini, M. Naima, A. Singh : “Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics”, Computer Science - Theory and Applications - 15^th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020, Proceedings, vol. 12159, Lecture Notes in Computer Science, Yekaterinburg, Russian Federation, pp. 155-168, (Springer), (ISBN: 978-3-030-50025-2) (2020)
  • A. Genitrini, B. Gittenberger, M. Kauers, M. Wallner : “Asymptotic enumeration of compacted binary trees of bounded right height”, Journal of Combinatorial Theory, Series A, vol. 172, pp. 105177, (Elsevier) (2020)
  • J. Clement, A. Genitrini : “Binary Decision Diagrams: from Tree Compaction to Sampling”, LATIN 2020: Theoretical Informatics, LATIN 2020: Theoretical Informatics, Sao Polo, Brazil (2020)
  • C. Donnot, A. Genitrini, Y. Herida : “Unranking Combinations Lexicographically: an efficient new strategy compared with others”, (2020)
• 2019
  • O. Bodini, A. Genitrini, M. Naima : “Ranked Schröder Trees”, ANALCO 2019 - 16^th Workshop on Analytic Algorithmics and Combinatorics, San Diego, CA, United States, pp. 13-26, (Society for Industrial and Applied Mathematics) (2019)
  • O. Bodini, M. Dien, A. Genitrini, F. Peschanski : “The Combinatorics of Barrier Synchronization”, PETRI NETS 2019 - 40^th International Conference on Application and Theory of Petri Nets and Concurrency, vol. 11522, Lecture Notes in Computer Science, Aachen, Germany, pp. 386-405 (2019)
• 2018
  • O. Bodini, M. Dien, A. Genitrini, A. Viola : “Beyond series-parallel concurrent systems: the case of arch processes”, 29^th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018), vol. 110, Leibniz International Proceedings in Informatics (LIPIcs), Uppsala, Sweden, pp. 14:1-14:14 (2018)
• 2017
  • A. Genitrini : “Combinatoire énumérative et analytique en Logique Propositionnelle et en théorie de la Concurrence”, habilitation à diriger des recherches, soutenance 22/09/2017 (2017)
  • O. Bodini, A. Genitrini, N. Rolin : “Extended boxed product and application to synchronized trees”, Electronic Notes in Discrete Mathematics, vol. 59, pp. 189-202, (Elsevier) (2017)
  • O. Bodini, M. Dien, A. Genitrini, F. Peschanski : “The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes”, 2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), Barcelone, Spain, pp. 16-30 (2017)
  • O. Bodini, M. Dien, A. Genitrini, F. Peschanski : “Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets”, Computer Science Symposium in Russia, Kazan, Russian Federation (2017)
• 2016
  • V. Daxner, A. Genitrini, B. Gittenberger, C. Mailler : “THE RELATION BETWEEN TREE SIZE COMPLEXITY AND PROBABILITY FOR BOOLEAN FUNCTIONS GENERATED BY UNIFORM RANDOM TREES”, Applicable Analysis and Discrete Mathematics, vol. 10 (2), pp. 408-446, (Department of Applied Mathematics, University of Belgrade) (2016)
  • O. Bodini, M. Dien, X. Fontaine, A. Genitrini, H.‑K. Hwang : “Increasing Diamonds”, 12^th. Latin American Theoretical INformatics Symposium, Ensenada, Mexico (2016)
  • A. Genitrini, C. Mailler : “Generalised and Quotient Models for Random And/Or Trees and Application to Satisfiability”, Algorithmica, vol. 1, pp. 1-33, (Springer Verlag) (2016)
  • A. Genitrini : “Full asymptotic expansion for Polya structures”, 27^th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Krakow, Poland (2016)
  • O. Bodini, A. Genitrini, F. Peschanski : “A Quantitative Study of Pure Parallel Processes”, The Electronic Journal of Combinatorics, vol. 23 (1), pp. p1.11, (Open Journal Systems) (2016)
• 2015
  • A. Genitrini, B. Gittenberger, V. Kraus, C. Mailler : “Associative and commutative tree representations for Boolean functions”, Theoretical Computer Science, vol. 570, pp. 70-101, (Elsevier) (2015)
  • O. Bodini, A. Genitrini, F. Peschanski, N. Rolin : “Associativity for Binary Parallel Processes: a Quantitative Study”, Algorithms and Discrete Applied Mathematics, vol. 8959, Lecture Notes in Computer Science, Kanpur, India, pp. 217-228, (Springer) (2015)
  • O. Bodini, A. Genitrini : “Cuts in Increasing Trees”, 2015 the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), San Diego, CA, United States, pp. 66-77 (2015)
  • O. Bodini, A. Genitrini, N. Rolin : “Pointed versus Singular Boltzmann Samplers: a Comparative Analysis”, Pure mathematics and applications, vol. 25 (2), pp. 115-131, (De Gruyter Poland) (2015)
• 2014
  • A. Genitrini, B. Gittenberger, C. Mailler : “No Shannon Effect Induced by And/Or Trees”, The 25^th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2014, vol. BA, DMTCS, Paris, France, pp. 109-120 (2014)
  • O. Bodini, A. Genitrini, N. Rolin : “Pointed versus Singular Boltzmann Samplers”, 9^th edition of the conference GASCom on random generation of combinatorial structures (GASCom'14), Bertinoro, Italy (2014)
  • A. Genitrini, C. Mailler : “Equivalence Classes of Random Boolean Trees and Application to the Catalan Satisfiability Problem”, LATIN 2014: Theoretical Informatics, vol. 8392, Lecture Notes in Computer Science, Montevideo, Uruguay, pp. 466-477, (Springer), (ISBN: 978-3-642-54422-4) (2014)
• 2013
  • O. Bodini, A. Genitrini, F. Peschanski : “The Combinatorics of Non-determinism”, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 24, Leibniz International Proceedings in Informatics, Guwahati, India, pp. 425-436 (2013)
• 2012
  • A. Genitrini, J. Kozik : “In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid”, Annals of Pure and Applied Logic, vol. 163 (7), pp. 875-887, (Elsevier Masson) (2012)
  • O. Bodini, A. Genitrini, F. Peschanski : “Enumeration and Random Generation of Concurrent Computations”, Discrete Mathematics and Theoretical Computer Science, vol. DMTCS Proceedings vol. AQ, 23^rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12), DMTCS Proceedings, Montreal, Canada, pp. 83-96, (Discrete Mathematics and Theoretical Computer Science) (2012)
  • A. Genitrini, B. Gittenberger, V. Kraus, C. Mailler : “Probabilities of Boolean Functions Given by Random Implicational Formulas”, The Electronic Journal of Combinatorics, vol. 19 (2), pp. p37, (Open Journal Systems) (2012)
  • H. Fournier, D. Gardy, A. Genitrini, B. Gittenberger : “The fraction of large random trees representing a given Boolean function in implicational logic”, Random Structures and Algorithms, vol. 40 (3), pp. 317-349, (Wiley) (2012)
• 2010
  • A. Genitrini, B. Gittenberger : “No Shannon effect on probability distributions on Boolean functions induced by random expressions.”, Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings, M. Drmota, B. Gittenberger (Eds.), Autriche, pp. 303-316, (DMTCS) (2010)
  • H. Fournier, D. Gardy, A. Genitrini : “Balanced And/Or trees and linear threshold functions.”, Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2009, C. Martinez, R. Sedgewick (Eds.), \'Etats-Unis, pp. 51-57, (SIAM) (2010)
• 2009
  • A. Genitrini, J. Kozik, G. Matecki : “On the Density and the Structure of the Peirce-like Formulae.”, Proceedings of 5^th Colloquium on Mathematics and Computer Science, DMTCS Proceedings, Roesler (Ed.), Allemagne, pp. 461-474, (DMTCS) (2009)
  • A. Genitrini, J. Kozik : “Quantitative comparison of Intuitionistic and Classical logics - full propositional system.”, Proceedings of International Symposium on Logical Foundations of Computer Science, vol. 5407, LNCS, Artemov Nerode (Ed.), \'Etats-Unis, pp. 280-294, (Springer) (2009)
• 2008
  • H. Fournier, D. Gardy, A. Genitrini, B. Gittenberger : “Complexity and Limiting Ratio of Boolean Functions over Implication.”, Proceedings of 33^rd International Symposium on Mathematical Foundations of Computer Science, vol. 5162, LNCS, Ochmanski Tyszkiewicz (Ed.), Pologne, pp. 347-362, (Springer) (2008)
  • A. Genitrini, J. Kozik, M. Zaionc : “Intuitionistic vs Classical Tautologies, Quantitative Comparison.”, Types for Proofs ans Programs, vol. 4941, LNCS, S. Miculan (Ed.), Italie, pp. 100-109, (Springer) (2008)
• 2007
  • H. Fournier, D. Gardy, A. Genitrini, M. Zaionc : “Classical and intuitionistic logic are asymptotically identical.”, Proceedings of 16^th Annual Conference on Computer Science Logic, vol. 4646, LNCS, Duparc Henzinger (Ed.), Suisse, pp. 177-193, (Springer) (2007)