| Classical and intuitionistic logic are asymptotically identical H Fournier, D Gardy, A Genitrini, M Zaionc Computer Science Logic: 21st International Workshop, CSL 2007, 16th Annual …, 2007 | 41 | 2007 |
| Intuitionistic vs. classical tautologies, quantitative comparison A Genitrini, J Kozik, M Zaionc Types for Proofs and Programs: International Conference, TYPES 2007 …, 2008 | 30 | 2008 |
| 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 | 19 | 2012 |
| A quantitative study of pure parallel processes O Bodini, A Genitrini, F Peschanski arXiv preprint arXiv:1407.1873, 2014 | 18 | 2014 |
| Increasing diamonds O Bodini, M Dien, X Fontaine, A Genitrini, HK Hwang LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, Ensenada …, 2016 | 15 | 2016 |
| Associative and commutative tree representations for Boolean functions A Genitrini, B Gittenberger, V Kraus, C Mailler Theoretical Computer Science 570, 70-101, 2015 | 15 | 2015 |
| 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 | 15 | 2012 |
| The combinatorics of non-determinism O Bodini, A Genitrini, F Peschanski IARCS Annual Conference on Foundations of Software Technology and …, 2013 | 13 | 2013 |
| 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 | 13 | 2009 |
| 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 | 13 | 2009 |
| 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 | 12 | 2020 |
| Ranked schröder trees O Bodini, A Genitrini, M Naima 2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and …, 2019 | 12 | 2019 |
| 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 | 12 | 2017 |
| No Shannon effect on probability distributions on Boolean functions induced by random expressions A Genitrini, B Gittenberger Discrete Mathematics & Theoretical Computer Science, 2010 | 12 | 2010 |
| Entropic uniform sampling of linear extensions in series-parallel posets O Bodini, M Dien, A Genitrini, F Peschanski Computer Science–Theory and Applications: 12th International Computer …, 2017 | 11 | 2017 |
| Complexity and limiting ratio of Boolean functions over implication H Fournier, D Gardy, A Genitrini, B Gittenberger Mathematical Foundations of Computer Science 2008: 33rd International …, 2008 | 11 | 2008 |
| On the number of increasing trees with label repetitions O Bodini, A Genitrini, B Gittenberger, S Wagner Discrete Mathematics 343 (8), 111722, 2020 | 10 | 2020 |
| Pointed versus singular Boltzmann samplers: a comparative analysis O Bodini, A Genitrini, N Rolin Pure Mathematics and Applications 25 (2), 115-131, 2015 | 10 | 2015 |
| 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 | 10 | 2012 |
| Lexicographic unranking of combinations revisited A Genitrini, M Pépin Algorithms 14 (3), 97, 2021 | 9 | 2021 |
