Classical and Intuitionistic Logic Are Asymptotically Identical. - Hervé Fournier; Danièle Gardy; Antoine Genitrini; Marek Zaionc (CSL, 2007)

Intuitionistic vs. Classical Tautologies, Quantitative Comparison. - Antoine Genitrini; Jakub Kozik; Marek Zaionc (TYPES, 2007)

Complexity and Limiting Ratio of Boolean Functions over Implication. - Hervé Fournier; Danièle Gardy; Antoine Genitrini; Bernhard Gittenberger (MFCS, 2008)

Balanced And/Or Trees and Linear Threshold Functions. - Hervé Fournier; Danièle Gardy; Antoine Genitrini (ANALCO, 2009)

Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System. - Antoine Genitrini; Jakub Kozik (LFCS, 2009)

Tautologies over implication with negative literals. - Hervé Fournier; Danièle Gardy; Antoine Genitrini; Marek Zaionc (Math. Log. Q., 2010)

In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid. - Antoine Genitrini; Jakub Kozik (Ann. Pure Appl. Log., 2012)

Probabilities of Boolean Functions given by Random Implicational Formulas. - Antoine Genitrini; Bernhard Gittenberger; Veronika Kraus; Cécile Mailler (Electron. J. Comb., 2012)

The fraction of large random trees representing a given Boolean function in implicational logic. - Hervé Fournier; Danièle Gardy; Antoine Genitrini; Bernhard Gittenberger (Random Struct. Algorithms, 2012)

The Combinatorics of Non-determinism. - Olivier Bodini; Antoine Genitrini; Frédéric Peschanski (FSTTCS, 2013)

Equivalence Classes of Random Boolean Trees and Application to the Catalan Satisfiability Problem. - Antoine Genitrini; Cécile Mailler (LATIN, 2014)

Cuts in Increasing Trees. - Olivier Bodini; Antoine Genitrini (ANALCO, 2015)

Associativity for Binary Parallel Processes: A Quantitative Study. - Olivier Bodini; Antoine Genitrini; Frédéric Peschanski; Nicolas Rolin (CALDAM, 2015)

Associative and commutative tree representations for Boolean functions. - Antoine Genitrini; Bernhard Gittenberger; Veronika Kraus; Cécile Mailler (Theor. Comput. Sci., 2015)

Increasing Diamonds. - Olivier Bodini; Matthieu Dien; Xavier Fontaine; Antoine Genitrini; Hsien-Kuei Hwang (LATIN, 2016)

Generalised and Quotient Models for Random And/Or Trees and Application to Satisfiability. - Antoine Genitrini; Cécile Mailler (Algorithmica, 2016)

A Quantitative Study of Pure Parallel Processes. - Olivier Bodini; Antoine Genitrini; Frédéric Peschanski (Electron. J. Comb., 2016)

Full asymptotic expansion for Polya structures. - Antoine Genitrini (CoRR, 2016)

Combinatoire énumérative et analytique en Logique Propositionnelle et en Théorie de la Concurrence : Vers une quantification de l'expressivité des modèles. (Enumerative and Analytic Combinatorics for Propositional Logic and Concurrency Theory : Towards a quantification of the model expressiveness). - Antoine Genitrini (2017)

The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes. - Olivier Bodini; Matthieu Dien; Antoine Genitrini; Frédéric Peschanski (ANALCO, 2017)

Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets. - Olivier Bodini; Matthieu Dien; Antoine Genitrini; Frédéric Peschanski (CSR, 2017)

Asymptotic Enumeration of Compacted Binary Trees. - Antoine Genitrini; Bernhard Gittenberger; Manuel Kauers; Michael Wallner 001 (CoRR, 2017)

Extended boxed product and application to synchronized trees. - Olivier Bodini; Antoine Genitrini; Nicolas Rolin (Electron. Notes Discret. Math., 2017)

Beyond Series-Parallel Concurrent Systems: The Case of Arch Processes. - Olivier Bodini; Matthieu Dien; Antoine Genitrini; Alfredo Viola (AofA, 2018)

Ranked Schröder Trees. - Olivier Bodini; Antoine Genitrini; Mehdi Naima (ANALCO, 2019)

The Combinatorics of Barrier Synchronization. - Olivier Bodini; Matthieu Dien; Antoine Genitrini; Frédéric Peschanski (Petri Nets, 2019)

Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics. - Olivier Bodini; Antoine Genitrini; Mehdi Naima; Alexandros Singh (CSR, 2020)

Statistical Analysis of Non-deterministic Fork-Join Processes. - Antoine Genitrini; Martin Pépin; Frédéric Peschanski (ICTAC, 2020)

Binary Decision Diagrams: From Tree Compaction to Sampling. - Julien Clément 001; Antoine Genitrini (LATIN, 2020)

On the number of increasing trees with label repetitions. - Olivier Bodini; Antoine Genitrini; Bernhard Gittenberger; Stephan Wagner 003 (Discret. Math., 2020)

Asymptotic enumeration of compacted binary trees of bounded right height. - Antoine Genitrini; Bernhard Gittenberger; Manuel Kauers; Michael Wallner 001 (J. Comb. Theory A, 2020)

Unlabelled ordered DAGs and labelled DAGs: constructive enumeration and uniform random sampling. - Antoine Genitrini; Martin Pépin; Alfredo Viola (LAGOS, 2021)

Lexicographic Unranking of Combinations Revisited. - Antoine Genitrini; Martin Pépin (Algorithms, 2021)

Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency. - Olivier Bodini; Matthieu Dien; Antoine Genitrini; Frédéric Peschanski (Discret. Math. Theor. Comput. Sci., 2021)

A Combinatorial Study of Async/Await Processes. - Matthieu Dien; Antoine Genitrini; Frédéric Peschanski (ICTAC, 2022)

A Combinatorial Link Between Labelled Graphs and Increasingly Labelled Schröder Trees. - Olivier Bodini; Antoine Genitrini; Mehdi Naima (LATIN, 2022)

Strict monotonic trees arising from evolutionary processes: Combinatorial and probabilistic study. - Olivier Bodini; Antoine Genitrini; Cécile Mailler; Mehdi Naima (Adv. Appl. Math., 2022)

Combinatorics of Reduced Ordered Binary Decision Diagrams: Application to uniform random sampling. - Julien Clément 001; Antoine Genitrini (CoRR, 2022)

Compaction for two models of logarithmic-depth trees: Analysis and experiments. - Olivier Bodini; Antoine Genitrini; Bernhard Gittenberger; Isabella Larcher; Mehdi Naima (Random Struct. Algorithms, 2022)

A quantitative study of fork-join processes with non-deterministic choice: Application to the statistical exploration of the state-space. - Antoine Genitrini; Martin Pépin; Frédéric Peschanski (Theor. Comput. Sci., 2022)

An Iterative Approach for Counting Reduced Ordered Binary Decision Diagrams. - Julien Clément 001; Antoine Genitrini (MFCS, 2023)

Lexicographic Unranking Algorithms for the Twelvefold Way. - Amaury Curiel; Antoine Genitrini (AofA, 2024)

Set Partition Unranking. - Amaury Curiel; Antoine Genitrini (DROPS Artifacts, 2024)

Optimal Uniform Shortest Path Sampling. - Simon Dreyer; Antoine Genitrini; Mehdi Naima (WALCOM, 2025)