Antoine Genitrini

发表

The Combinatorics of Barrier Synchronization

Olivier Bodini, Matthieu Dien, Antoine Genitrini, 2019, Petri Nets.

Beyond series-parallel concurrent systems: the case of arch processes

Alfredo Viola, Olivier Bodini, Matthieu Dien, 2018, AofA.

Statistical Analysis of Non-deterministic Fork-Join Processes

Antoine Genitrini, Frédéric Peschanski, Martin Pépin, 2020, ICTAC.

Binary Decision Diagrams: from Tree Compaction to Sampling

Julien Clément, Antoine Genitrini, J. Clément, 2019, LATIN.

Cuts in Increasing Trees

Olivier Bodini, Antoine Genitrini, O. Bodini, 2015, ANALCO.

On the number of increasing trees with label repetitions

Bernhard Gittenberger, Olivier Bodini, Antoine Genitrini, 2018, Discret. Math..

Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets

Olivier Bodini, Matthieu Dien, Antoine Genitrini, 2017, CSR.

Intuitionistic vs. Classical Tautologies, Quantitative Comparison

Antoine Genitrini, Jakub Kozik, Marek Zaionc, 2007, TYPES.

Ranked Schröder Trees

Olivier Bodini, Antoine Genitrini, Mehdi Naima, 2019, ANALCO.

Associativity for Binary Parallel Processes: A Quantitative Study

Olivier Bodini, Antoine Genitrini, Frédéric Peschanski, 2015, CALDAM.

Probabilities of Boolean Functions given by Random Implicational Formulas

Bernhard Gittenberger, Antoine Genitrini, Cécile Mailler, 2012, Electron. J. Comb..

Asymptotic Enumeration of Compacted Binary Trees pdf

Manuel Kauers, Michael Wallner, Bernhard Gittenberger, 2017, ArXiv.

Generalised and Quotient Models for Random And/Or Trees and Application to Satisfiability

Antoine Genitrini, Cécile Mailler, 2016, Algorithmica.

In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid

Antoine Genitrini, Jakub Kozik, Antoine Genitrini, 2012, Ann. Pure Appl. Log..

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 fraction of large random trees representing a given Boolean function in implicational logic

Danièle Gardy, Bernhard Gittenberger, Hervé Fournier, 2012, Random Struct. Algorithms.

Compaction for two models of logarithmic-depth trees: Analysis and Experiments pdf

Bernhard Gittenberger, Isabella Larcher, Olivier Bodini, 2020, ArXiv.

Increasing Diamonds

Hsien-Kuei Hwang, Olivier Bodini, Matthieu Dien, 2016, LATIN.

Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System

Antoine Genitrini, Jakub Kozik, 2009, LFCS.

Asymptotic enumeration of compacted binary trees of bounded right height

Manuel Kauers, Bernhard Gittenberger, Antoine Genitrini, 2020, J. Comb. Theory, Ser. A.

Balanced And/Or Trees and Linear Threshold Functions

Danièle Gardy, Hervé Fournier, Antoine Genitrini, 2009, ANALCO.

The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes

Olivier Bodini, Matthieu Dien, Antoine Genitrini, 2017, ANALCO.

The Combinatorics of Non-determinism

Olivier Bodini, Antoine Genitrini, Frédéric Peschanski, 2013, FSTTCS.

Associative and commutative tree representations for Boolean functions

Bernhard Gittenberger, Antoine Genitrini, Cécile Mailler, 2015, Theor. Comput. Sci..

Equivalence Classes of Random Boolean Trees and Application to the Catalan Satisfiability Problem

Antoine Genitrini, Cécile Mailler, 2014, LATIN.

A Quantitative Study of Pure Parallel Processes

Olivier Bodini, Antoine Genitrini, Frédéric Peschanski, 2014, Electron. J. Comb..

Full asymptotic expansion for Polya structures pdf

Antoine Genitrini, Antoine Genitrini, 2016, ArXiv.

Tautologies over implication with negative literals

Danièle Gardy, Hervé Fournier, Antoine Genitrini, 2010, Math. Log. Q..

Complexity and Limiting Ratio of Boolean Functions over Implication

Danièle Gardy, Bernhard Gittenberger, Hervé Fournier, 2008, MFCS.

Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency

Olivier Bodini, Matthieu Dien, Antoine Genitrini, 2020, Discret. Math. Theor. Comput. Sci..

Extended boxed product and application to synchronized trees

Olivier Bodini, Antoine Genitrini, Nicolas Rolin, 2017, Electron. Notes Discret. Math..

Ranked Schr\"oder Trees

Olivier Bodini, Antoine Genitrini, Mehdi Naima, 2018, 1808.08376.

Classical and Intuitionistic Logic Are Asymptotically Identical

Danièle Gardy, Hervé Fournier, Antoine Genitrini, 2007, CSL.

Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics

Olivier Bodini, Antoine Genitrini, Alexandros Singh, 2020, CSR.

Compaction for two models of logarithmic‐depth trees: Analysis and experiments pdf

Bernhard Gittenberger, Isabella Larcher, Olivier Bodini, 2020, Random Struct. Algorithms.

Unlabelled ordered DAGs and labelled DAGs: constructive enumeration and uniform random sampling

Alfredo Viola, Antoine Genitrini, Martin Pépin, 2021, LAGOS.

Strict monotonic trees arising from evolutionary processes: Combinatorial and probabilistic study

Olivier Bodini, Antoine Genitrini, Mehdi Naima, 2022, Adv. Appl. Math..

On the density and the structure of the Peirce-like formulae †

Antoine Genitrini, Jakub Kozik, Grzegorz Matecki, 2008 .

No Shannon effect on probability distributions on Boolean functions induced by random expressions

Bernhard Gittenberger, Antoine Genitrini, 2010 .