Antoine Genitrini

According to our database, Antoine Genitrini authored at least 41 papers between 2007 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

An Iterative Approach for Counting Reduced Ordered Binary Decision Diagrams.

Julien Clément, Antoine Genitrini

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

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

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

Combinatorics of Reduced Ordered Binary Decision Diagrams: Application to uniform random sampling.

Julien Clément, Antoine Genitrini

CoRR, 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

A Combinatorial Link Between Labelled Graphs and Increasingly Labelled Schröder Trees.

Olivier Bodini, Antoine Genitrini, Mehdi Naima

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

A Combinatorial Study of Async/Await Processes.

Matthieu Dien, Antoine Genitrini, Frédéric Peschanski

Proceedings of the Theoretical Aspects of Computing - ICTAC 2022, 2022

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

Lexicographic Unranking of Combinations Revisited.

Antoine Genitrini, Martin Pépin

Algorithms, 2021

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

Antoine Genitrini, Martin Pépin, Alfredo Viola

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020

Asymptotic enumeration of compacted binary trees of bounded right height.

Antoine Genitrini, Bernhard Gittenberger, Manuel Kauers, Michael Wallner

J. Comb. Theory, Ser. A, 2020

On the number of increasing trees with label repetitions.

Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, Stephan Wagner

Discret. Math., 2020

Binary Decision Diagrams: From Tree Compaction to Sampling.

Julien Clément, Antoine Genitrini

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Statistical Analysis of Non-deterministic Fork-Join Processes.

Antoine Genitrini, Martin Pépin, Frédéric Peschanski

Proceedings of the Theoretical Aspects of Computing - ICTAC 2020 - 17th International Colloquium, Macau, China, November 30, 2020

Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics.

Olivier Bodini, Antoine Genitrini, Mehdi Naima, Alexandros Singh

Proceedings of the Computer Science - Theory and Applications, 2020

2019

The Combinatorics of Barrier Synchronization.

Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2019

Ranked Schröder Trees.

Olivier Bodini, Antoine Genitrini, Mehdi Naima

Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

2018

Beyond Series-Parallel Concurrent Systems: The Case of Arch Processes.

Olivier Bodini, Matthieu Dien, Antoine Genitrini, Alfredo Viola

Proceedings of the 29th International Conference on Probabilistic, 2018

2017

Extended boxed product and application to synchronized trees.

Olivier Bodini, Antoine Genitrini, Nicolas Rolin

Electron. Notes Discret. Math., 2017

Asymptotic Enumeration of Compacted Binary Trees.

Antoine Genitrini, Bernhard Gittenberger, Manuel Kauers, Michael Wallner

CoRR, 2017

Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets.

Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski

Proceedings of the Computer Science - Theory and Applications, 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

Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 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. (Enumerative and Analytic Combinatorics for Propositional Logic and Concurrency Theory : Towards a quantification of the model expressiveness).

Antoine Genitrini

, 2017

2016

Full asymptotic expansion for Polya structures.

Antoine Genitrini

CoRR, 2016

A Quantitative Study of Pure Parallel Processes.

Olivier Bodini, Antoine Genitrini, Frédéric Peschanski

Electron. J. Comb., 2016

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

Antoine Genitrini, Cécile Mailler

Algorithmica, 2016

Increasing Diamonds.

Olivier Bodini, Matthieu Dien, Xavier Fontaine, Antoine Genitrini, Hsien-Kuei Hwang

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015

Associative and commutative tree representations for Boolean functions.

Antoine Genitrini, Bernhard Gittenberger, Veronika Kraus, Cécile Mailler

Theor. Comput. Sci., 2015

Associativity for Binary Parallel Processes: A Quantitative Study.

Olivier Bodini, Antoine Genitrini, Frédéric Peschanski, Nicolas Rolin

Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

Cuts in Increasing Trees.

Olivier Bodini, Antoine Genitrini

Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015

2014

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

Antoine Genitrini, Cécile Mailler

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013

The Combinatorics of Non-determinism.

Olivier Bodini, Antoine Genitrini, Frédéric Peschanski

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

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

Probabilities of Boolean Functions given by Random Implicational Formulas.

Antoine Genitrini, Bernhard Gittenberger, Veronika Kraus, Cécile Mailler

Electron. J. Comb., 2012

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

Antoine Genitrini, Jakub Kozik

Ann. Pure Appl. Log., 2012

2010

Tautologies over implication with negative literals.

Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc

Math. Log. Q., 2010

2009

Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System.

Antoine Genitrini, Jakub Kozik

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

Balanced And/Or Trees and Linear Threshold Functions.

Hervé Fournier, Danièle Gardy, Antoine Genitrini

Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, 2009

2008

Complexity and Limiting Ratio of Boolean Functions over Implication.

Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007

Intuitionistic vs. Classical Tautologies, Quantitative Comparison.

Antoine Genitrini, Jakub Kozik, Marek Zaionc

Proceedings of the Types for Proofs and Programs, International Conference, 2007

Classical and Intuitionistic Logic Are Asymptotically Identical.

Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc

Proceedings of the Computer Science Logic, 21st International Workshop, 2007