Follow
Antoine Genitrini
Antoine Genitrini
Sorbonne UniversitÚ
Verified email at sorbonne-universite.fr
Title
Cited by
Cited by
Year
Classical and intuitionistic logic are asymptotically identical
H Fournier, D Gardy, A Genitrini, M Zaionc
International Workshop on Computer Science Logic, 177-193, 2007
402007
Intuitionistic vs. classical tautologies, quantitative comparison
A Genitrini, J Kozik, M Zaionc
International Workshop on Types for Proofs and Programs, 100-109, 2007
292007
A quantitative study of pure parallel processes
O Bodini, A Genitrini, F Peschanski
arXiv preprint arXiv:1407.1873, 2014
192014
The fraction of large random trees representing a given Boolean function in implicational logic
H Fournier, D Gardy, A Genitrini, B Gittenberger
Random Structures & Algorithms 40 (3), 317-349, 2012
192012
Increasing diamonds
O Bodini, M Dien, X Fontaine, A Genitrini, HK Hwang
LATIN 2016: Theoretical Informatics, 207-219, 2016
152016
Associative and commutative tree representations for Boolean functions
A Genitrini, B Gittenberger, V Kraus, C Mailler
Theoretical Computer Science 570, 70-101, 2015
152015
In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid
A Genitrini, J Kozik
Annals of Pure and Applied Logic 163 (7), 875-887, 2012
142012
Balanced And/Or trees and linear threshold functions
H Fournier, D Gardy, A Genitrini
2009 Proceedings of the Sixth Workshop on Analytic Algorithmics andá…, 2009
142009
Ranked schr÷der trees
O Bodini, A Genitrini, M Naima
2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics andá…, 2019
132019
The combinatorics of non-determinism
O Bodini, A Genitrini, F Peschanski
IARCS Annual Conference on Foundations of Software Technology andá…, 2013
132013
Quantitative comparison of intuitionistic and classical logics-full propositional system
A Genitrini, J Kozik
International Symposium on Logical Foundations of Computer Science, 280-294, 2009
132009
The ordered and colored products in analytic combinatorics: application to the quantitative study of synchronizations in concurrent processes
O Bodini, M Dien, A Genitrini, F Peschanski
2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics andá…, 2017
122017
No Shannon effect on probability distributions on Boolean functions induced by random expressions
A Genitrini, B Gittenberger
Discrete Mathematics and Theoretical Computer Science, 303-316, 2010
122010
Complexity and limiting ratio of Boolean functions over implication
H Fournier, D Gardy, A Genitrini, B Gittenberger
International Symposium on Mathematical Foundations of Computer Science, 347-362, 2008
122008
Entropic uniform sampling of linear extensions in series-parallel posets
O Bodini, M Dien, A Genitrini, F Peschanski
International Computer Science Symposium in Russia, 71-84, 2017
112017
On the number of increasing trees with label repetitions
O Bodini, A Genitrini, B Gittenberger, S Wagner
Discrete Mathematics 343 (8), 111722, 2020
102020
Pointed versus singular Boltzmann samplers: a comparative analysis
O Bodini, A Genitrini, N Rolin
Pure Mathematics and Applications 25 (2), 115-131, 2015
102015
Probabilities of Boolean functions given by random implicational formulas
A Genitrini, B Gittenberger, V Kraus, C Mailler
the electronic journal of combinatorics, P37-P37, 2012
102012
Asymptotic enumeration of compacted binary trees of bounded right height
A Genitrini, B Gittenberger, M Kauers, M Wallner
Journal of Combinatorial Theory, Series A 172, 105177, 2020
92020
Beyond series-parallel concurrent systems: the case of arch processes
O Bodini, M Dien, A Genitrini, A Viola
arXiv preprint arXiv:1803.00843, 2018
92018
The system can't perform the operation now. Try again later.
Articles 1–20