Get started
Author

Antoine Genitrini

Classical and Intuitionistic Logic Are Asymptotically Identical
2007 · Hervé Fournier, Danièle Gardy, et al. · Lecture notes in computer science · 26
Lexicographic Unranking of Combinations Revisited
2021 · Antoine Genitrini, Martin Pépin · Algorithms · 24
PDF
Intuitionistic vs. Classical Tautologies, Quantitative Comparison
2008 · Antoine Genitrini, Jakub Kozik, et al. · Springer eBooks · 23
Asymptotic enumeration of compacted binary trees of bounded right height
2019 · Antoine Genitrini, Bernhard Gittenberger, et al. · Journal of Combinatorial Theory Series A · 16
The fraction of large random trees representing a given Boolean function in implicational logic
2011 · Hervé Fournier, Danièle Gardy, et al. · Random Structures and Algorithms · 14
PDF
A Quantitative Study of Pure Parallel Processes
2016 · O. Bodini, A. Genitrini, et al. · The Electronic Journal of Combinatorics · 13
PDF
Associative and commutative tree representations for Boolean functions
2015 · Antoine Genitrini, Bernhard Gittenberger, et al. · Theoretical Computer Science · 13
Increasing Diamonds
2016 · Olivier Bodini, Matthieu Dien, et al. · Lecture notes in computer science · 12
PDF
Ranked Schröder Trees
2019 · Olivier Bodini, Antoine Genitrini, et al. · Society for Industrial and Applied Mathematics eBooks · 11
PDF
On the number of increasing trees with label repetitions
2019 · Olivier Bodini, Antoine Genitrini, et al. · Discrete Mathematics · 10
The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes
2017 · Olivier Bodini, Matthieu Dien, et al. · 10
PDF
Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets
2017 · Olivier Bodini, Matthieu Dien, et al. · Lecture notes in computer science · 10
PDF
Probabilities of Boolean Functions given by Random Implicational Formulas
2012 · Antoine Genitrini, Bernhard Gittenberger, et al. · The Electronic Journal of Combinatorics · 10
PDF
The Combinatorics of Non-determinism
2013 · Bodini, Olivier, Genitrini, Antoine, et al. · HAL · 9
PDF
In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid
2011 · Antoine Genitrini, Jakub Kozik · Annals of Pure and Applied Logic · 9
Balanced And/Or trees and linear threshold functions
2009 · Hervé Fournier, Danièle Gardy, et al. · Workshop on Analytic Algorithmics and Combinatorics (ANALCO) · 9
Pointed versus singular Boltzmann samplers: a comparative analysis
2015 · Olivier Bodini, Antoine Genitrini, et al. · Pure mathematics and applications · 8
PDF
Enumeration and Random Generation of Concurrent Computations
2012 · Olivier Bodini, Antoine Genitrini, et al. · Discrete Mathematics & Theoretical Computer Science · 7
PDF
Tautologies over implication with negative literals
2010 · Hervé Fournier, Danièle Gardy, et al. · Mathematical logic quarterly · 7
Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System
2008 · Antoine Genitrini, Jakub Kozik · Lecture notes in computer science · 7
Beyond Series-Parallel Concurrent Systems: The Case of Arch Processes
2018 · Bodini, Olivier, Dien, Matthieu, et al. · arXiv (Cornell University) · 6
PDF
Complexity and Limiting Ratio of Boolean Functions over Implication
2008 · Hervé Fournier, Danièle Gardy, et al. · Lecture notes in computer science · 6
Strict monotonic trees arising from evolutionary processes: Combinatorial and probabilistic study
2021 · Olivier Bodini, Antoine Genitrini, et al. · Advances in Applied Mathematics · 5
The Combinatorics of Barrier Synchronization
2019 · Olivier Bodini, Matthieu Dien, et al. · Lecture notes in computer science · 5
PDF
No Shannon effect on probability distributions on Boolean functions induced by random expressions
2010 · Antoine Genitrini, Bernhard Gittenberger · Discrete Mathematics & Theoretical Computer Science · 5
PDF
Works count: 70
Citation count: 330
H-index: 10
I10-index: 13
Year
Topic
Type