Antoine Genitrini

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 32

Top Topics

Equivalence Class

Binary Decision Diagrams

Uniform Sampling

Top Venues

Publications

Amaury Curiel, Antoine Genitrini
Lexicographic Unranking Algorithms for the Twelvefold Way. AofA (2024)
Julien Clément, Antoine Genitrini
An Iterative Approach for Counting Reduced Ordered Binary Decision Diagrams. MFCS (2023)
Antoine Genitrini, Martin Pépin, Frédéric Peschanski
A quantitative study of fork-join processes with non-deterministic choice: Application to the statistical exploration of the state-space. Theor. Comput. Sci. 912 (2022)
Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, Isabella Larcher, Mehdi Naima
Compaction for two models of logarithmic-depth trees: Analysis and experiments. Random Struct. Algorithms 61 (1) (2022)
Matthieu Dien, Antoine Genitrini, Frédéric Peschanski
A Combinatorial Study of Async/Await Processes. ICTAC (2022)
Olivier Bodini, Antoine Genitrini, Cécile Mailler, Mehdi Naima
Strict monotonic trees arising from evolutionary processes: Combinatorial and probabilistic study. Adv. Appl. Math. 133 (2022)
Olivier Bodini, Antoine Genitrini, Mehdi Naima
A Combinatorial Link Between Labelled Graphs and Increasingly Labelled Schröder Trees. LATIN (2022)
Julien Clément, Antoine Genitrini
Combinatorics of Reduced Ordered Binary Decision Diagrams: Application to uniform random sampling. CoRR (2022)
Antoine Genitrini, Martin Pépin
Lexicographic Unranking of Combinations Revisited. Algorithms 14 (3) (2021)
Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski
Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency. Discret. Math. Theor. Comput. Sci. 22 (3) (2021)
Antoine Genitrini, Martin Pépin, Alfredo Viola
Unlabelled ordered DAGs and labelled DAGs: constructive enumeration and uniform random sampling. LAGOS (2021)
Antoine Genitrini, Bernhard Gittenberger, Manuel Kauers, Michael Wallner
Asymptotic enumeration of compacted binary trees of bounded right height. J. Comb. Theory, Ser. A 172 (2020)
Olivier Bodini, Antoine Genitrini, Mehdi Naima, Alexandros Singh
Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics. CSR (2020)
Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, Stephan Wagner
On the number of increasing trees with label repetitions. Discret. Math. 343 (8) (2020)
Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, Isabella Larcher, Mehdi Naima
Compaction for two models of logarithmic-depth trees: Analysis and Experiments. CoRR (2020)
Antoine Genitrini, Martin Pépin, Frédéric Peschanski
Statistical Analysis of Non-deterministic Fork-Join Processes. ICTAC (2020)
Julien Clément, Antoine Genitrini
Binary Decision Diagrams: From Tree Compaction to Sampling. LATIN (2020)
Julien Clément, Antoine Genitrini
Binary Decision Diagrams: from Tree Compaction to Sampling. CoRR (2019)
Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski
The Combinatorics of Barrier Synchronization. Petri Nets (2019)
Olivier Bodini, Antoine Genitrini, Mehdi Naima
Ranked Schröder Trees. ANALCO (2019)
Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski
The Combinatorics of Barrier Synchronization. CoRR (2019)
Olivier Bodini, Matthieu Dien, Antoine Genitrini, Alfredo Viola
Beyond series-parallel concurrent systems: the case of arch processes. CoRR (2018)
Olivier Bodini, Antoine Genitrini, Mehdi Naima
Ranked Schröder Trees. CoRR (2018)
Olivier Bodini, Matthieu Dien, Antoine Genitrini, Alfredo Viola
Beyond Series-Parallel Concurrent Systems: The Case of Arch Processes. AofA (2018)
Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski
The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes. ANALCO (2017)
Olivier Bodini, Antoine Genitrini, Nicolas Rolin
Extended boxed product and application to synchronized trees. Electron. Notes Discret. Math. 59 (2017)
Antoine Genitrini, Bernhard Gittenberger, Manuel Kauers, Michael Wallner
Asymptotic Enumeration of Compacted Binary Trees. CoRR (2017)
Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski
Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets. CSR (2017)
Olivier Bodini, Matthieu Dien, Xavier Fontaine, Antoine Genitrini, Hsien-Kuei Hwang
Increasing Diamonds. LATIN (2016)
Antoine Genitrini, Cécile Mailler
Generalised and Quotient Models for Random And/Or Trees and Application to Satisfiability. Algorithmica 76 (4) (2016)
Antoine Genitrini
Full asymptotic expansion for Polya structures. CoRR (2016)
Olivier Bodini, Antoine Genitrini, Frédéric Peschanski
A Quantitative Study of Pure Parallel Processes. Electron. J. Comb. 23 (1) (2016)
Antoine Genitrini, Bernhard Gittenberger, Veronika Kraus, Cécile Mailler
Associative and commutative tree representations for Boolean functions. Theor. Comput. Sci. 570 (2015)
Olivier Bodini, Antoine Genitrini
Cuts in Increasing Trees. ANALCO (2015)
Olivier Bodini, Antoine Genitrini, Frédéric Peschanski, Nicolas Rolin
Associativity for Binary Parallel Processes: A Quantitative Study. CALDAM (2015)
Antoine Genitrini, Cécile Mailler
Equivalence Classes of Random Boolean Trees and Application to the Catalan Satisfiability Problem. LATIN (2014)
Olivier Bodini, Antoine Genitrini, Frédéric Peschanski
A Quantitative Study of Pure Parallel Processes. CoRR (2014)
Olivier Bodini, Antoine Genitrini, Frédéric Peschanski
The Combinatorics of Non-determinism. FSTTCS (2013)
Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger
The fraction of large random trees representing a given Boolean function in implicational logic. Random Struct. Algorithms 40 (3) (2012)
Antoine Genitrini, Jakub Kozik
In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid. Ann. Pure Appl. Log. 163 (7) (2012)
Antoine Genitrini, Bernhard Gittenberger, Veronika Kraus, Cécile Mailler
Probabilities of Boolean Functions given by Random Implicational Formulas. Electron. J. Comb. 19 (2) (2012)
Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc
Tautologies over implication with negative literals. Math. Log. Q. 56 (4) (2010)
Hervé Fournier, Danièle Gardy, Antoine Genitrini
Balanced And/Or Trees and Linear Threshold Functions. ANALCO (2009)
Antoine Genitrini, Jakub Kozik
Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System. LFCS (2009)
Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger
Complexity and Limiting Ratio of Boolean Functions over Implication. MFCS (2008)
Antoine Genitrini, Jakub Kozik, Marek Zaionc
Intuitionistic vs. Classical Tautologies, Quantitative Comparison. TYPES (2007)
Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc
Classical and Intuitionistic Logic Are Asymptotically Identical. CSL (2007)