| |
| Lexicographic unranking algorithms for the Twelvefold Way.[Hal] A. Curiel and A. Genitrini. Under submission. | |
| |
| 45. An iterative approach for counting reduced ordered binary decision diagrams.[arXiv][bib] J. Clément and A. Genitrini. In proc. 48th International Symposium on Mathematical Foundations of Computer Science, (MFCS'23), pp. 36:1--36:15, 2023. | |
| 44. A Combinatorial Study of Async/Await Processes.[hal][bib] M. Dien, A. Genitrini and F. Peschanski. In proc. 19th International Colloquium of Theoretical Aspects of Computing (ICTAC'22), pp. 170-187, 2022. | |
| 43. A Combinatorial Link Between Labelled Graphs and Increasingly Labelled Schröder Trees.[hal][bib] O. Bodini, A. Genitrini and M. Naima. In proc. 15th Latin American Symposium in Theoretical Informatics (LATIN'22), pp 493-509, 2022. | |
| 42. A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space.[hal][bib] A. Genitrini, M. Pépin and F. Peschanski. In Theortical Computer Science, vol. 912, pp. 1-36, 2022. | |
| 41. Compaction for two models of logarithmic-depth trees: Analysis and Experiments. [arXiv][bib] O. Bodini, A. Genitrini, B. Gittenberger, I. Larcher and M. Naima. In Random Structures and Algorithms (RSA), vol. 61 No. 1, pp 31-61, 2022. | |
| 40. Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study. [hal][bib] O. Bodini, A. Genitrini, C. Mailler, M. Naima. In Advances in Applied Mathematics journal, vol. 133, 2022. (42 pages) | |
| 39. Lexicographic unranking of combinations revisited. [pdf][bib] A. Genitrini and M. Pépin. In Algorithms, vol. 14, no. 3, 2021. (25 pages) | |
| 38. Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency. [pdf][bib] O. Bodini, M. Dien, A. Genitrini and F. Peschanski. In Discrete Mathematics and Theoretical Computer Science, vol. 22, no. 3, 2021. (36 pages) | |
| 37. Unlabelled ordered DAGs and labelled DAGs: constructive enumeration and uniform random sampling. [hal][bib] A. Genitrini, M. Pépin and A. Viola. In proc. of the XI Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS'21), pp 468-477, 2020. | |
| 36. Statistical Analysis of Non-Deterministic Fork-join Processes. [hal][bib] A. Genitrini, M. Pépin and F. Peschanski. In proc. 17th International Colloquium of Theoretical Aspects of Computing (ICTAC'20), pp 83-102, 2020. | |
| 35. Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics. [pdf][bib] O. Bodini, A. Genitrini, M. Naima and A. Singh. In proc. 15th International Computer Science Symposium in Russia (CSR'20), pp 155-168, 2020. | |
| 34. Binary Decision Diagrams: from Tree Compaction to Sampling. [pdf][bib] J. Clément A. Genitrini. In proc. 14th Latin American Symposium in Theoretical Informatics (LATIN'20), pp 571-583, 2020. | |
| 33. Asymptotic Enumeration of Compacted Binary Trees of Bounded Right Height. [pdf][bib] A. Genitrini, B. Gittenberger, M. Kauers and M. Wallner. In Journal of Combinatorial Theory, Series A, vol. 172, pp 105177, 2020. (44 pages). | |
| 32. On the Number of Increasing Trees with Label Repetitions. [pdf][bib] O. Bodini, A. Genitrini, B. Gittenberger and S. Wagner. In Discrete Mathematics, vol. 343, no. 8, pp 111722, 2020 (19 pages). | |
| 31. The Combinatorics of Barrier Synchronization. [pdf][bib] O. Bodini, M. Dien, A. Genitrini and F. Peschanski. In proc. 40th International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS 2019), pp 386-405, 2019. | |
| 30. Ranked Schröder trees. [arXiv][bib] O. Bodini, A. Genitrini and M. Naima. In proc. 16th SIAM Meeting on Analytic Algorithmics and Combinatorics (ANALCO'19), pp 13-26, 2019. | |
| 29. Beyond series-parallel concurrent systems: the case of arch processes. [arXiv][bib] O. Bodini, M. Dien, A. Genitrini and A. Viola. In proc. 29th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA'18), pp 14:1-14:14, 2018. | |
| 28. Extended boxed product and application to synchronized trees. [pdf][bib] O. Bodini, A. Genitrini, and N. Rolin. In journal Electronic Notes in Discrete Mathematics, vol. 59, pp 189-202, 2017. | |
| 27. Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets. [pdf][bib] O. Bodini, M. Dien, A. Genitrini and F. Peschanski. In proc. 12th International Computer Science Symposium in Russia (CSR'17), pp 71-84, 2017. | |
| 26. The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes. [pdf][bib] O. Bodini, M. Dien, A. Genitrini and F. Peschanski. In proc. 14th SIAM Meeting on Analytic Algorithmics and Combinatorics (ANALCO'17), pp 16-30, 2017. | |
| 25. The relation between tree size complexity and probability for Boolean functions generated by uniform random trees. [arXiv][bib] V. Daxner, A. Genitrini, B. Gittenberger and C. Mailler. In journal Applicable Analysis and Discrete Mathematics, pp 408-446, vol. 10, no. 2, 2016. | |
| 24. Full asymptotic expansion for Polya structures. [arXiv][bib] A. Genitrini. In proc. 27th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA'16), pp 151-162, 2016. | |
| 23. Generalised and Quotient Models for Random And/Or Trees and Application to Satisfiability. [pdf][bib] A. Genitrini and C. Mailler. In journal Algorithmica, vol. 76, no. 4, pp 1106-1138, 2016. | |
| 22. A quantitative study of pure parallel processes. [pdf][bib] O. Bodini, A. Genitrini and F. Peschanski. In Electronic Journal of Combinatorics (EJC), vol. 23, no. 1, P1.11, 39 pages, (electronic), 2016. | |
| 21. Increasing Diamonds. [pdf][bib] O. Bodini, M. Dien, X. Fontaine, A. Genitrini and H.-K. Hwang. In proc. 12th. Latin American Theoretical INformatics Symposium. (LATIN), pp 207-219, 2016. | |
| 20. Pointed versus Singular Boltzmann Samplers: a Comparative Analysis. [pdf][bib] O. Bodini, A. Genitrini, and N. Rolin. In journal PUre Mathematics and Application, vol. 25, no. 2, pp 115-131, 2015. | |
| 19. Associative and commutative tree representations for Boolean functions. [pdf][bib] A. Genitrini, B. Gittenberger, V. Kraus and C. Mailler. In Theoretical Computer Science Journal, vol 570, pp 70-101, 2015. | |
| 18. Associativity for Binary Parallel Processes: a Quantitative Study. [pdf][bib] O. Bodini, A. Genitrini, F. Peschanski and N. Rolin. In proc. 1st Conference on Algorithms and Discrete Applied Mathematics (CALDAM'15), pp 217-228, 2015. | |
| 17. Cuts in increasing trees. [pdf][bib] O. Bodini and A. Genitrini. In proc. 12th SIAM Meeting on Analytic Algorithmics and Combinatorics (ANALCO'15), pp 66-77, 2015. | |
| 16. Pointed versus Singular Boltzmann Samplers. [pdf] O. Bodini, A. Genitrini, and N. Rolin. Conference without proceedings: Gascom'14. | |
| 15. Equivalence classes of random Boolean trees and application to the Catalan satisfiability problem. [pdf][bib] A. Genitrini and C. Mailler. In proc. 11th. Latin American Theoretical INformatics Symposium. (LATIN), volume 8392 of Lecture Notes in Computer Science, pp 466-477, 2014. | |
| 14. No Shannon effect induced by And/Or trees. [pdf][bib] A. Genitrini, Bernhard Gittenberger and C. Mailler. In proc. 25th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA'14), Discrete Mathematics and Theoretical Computer Science (HAL), pp 109-120, 2014. | |
| 13. The Combinatorics of Non-determinism. [pdf][bib] O. Bodini, A. Genitrini and F. Peschanski. In proc. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'13), Leibniz International Proceedings in Informatics, pp 425-436, 2013. | |
| 12. Probabilities of Boolean Functions Given by Random Implicational Formulas. [pdf][bib] A. Genitrini, B. Gittenberger, V. Kraus and C. Mailler. In Electronic Journal of Combinatorics (EJC), 19, No. 2, P37 (electronic), 2012. | |
| 11. Enumeration and Random Generation of Concurrent Computations. [pdf][bib] O. Bodini, A. Genitrini and F. Peschanski. In proc. 23rd International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA'12), Discrete Mathematics and Theoretical Computer Science, pp 83-96, 2012. | |
| 10. In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid. [pdf][bib] A. Genitrini and J. Kozik. In Annals of Pure and Applied Logic (APAL), 163 No. 7, pp 875-887, 2012. | |
| 9. The fraction of large random trees representing a given boolean function in implicational logic. [pdf][bib] H. Fournier, D. Gardy, A. Genitrini and B. Gittenberger. Random Structures and Algorithms (RSA), vol. 40 No. 3, pp 317-349, 2012. | |
| 8. Tautologies over implication with negative literals. [pdf][bib] H. Fournier, D. Gardy, A. Genitrini and M. Zaionc. In Journal Mathematical Logic Quarterly (MLQ), 56 No. 4, pp 388-396, 2010. | |
| 7. No Shannon effect on probability distributions on Boolean functions induced by random expressions. [pdf][bib] A. Genitrini and B. Gittenberger. In proc. 21st International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA'10), Discrete Mathematics and Theoretical Computer Science, pp 303-316, 2010. | |
| 6. Balanced And/Or trees and linear threshold functions. [pdf][bib] H. Fournier, D. Gardy and A. Genitrini. In proc. 6th SIAM Workshop on Analytic and Combinatorics (ANALCO’09), pp 51-57, 2009. | |
| 5. Quantitative comparison of Intuitionistic and Classical logics - full propositional system. [pdf][bib] A. Genitrini and J. Kozik. In Proc. International Symposium on Logical Foundations of Computer Science (LFCS), volume 5407 of Lecture Notes in Computer Science, pp 280-294, 2009. | |
| 4. On the Density and the Structure of the Peirce-like Formulae. [pdf][bib] A. Genitrini, J. Kozik and G. Matecki. In proc. 5th Colloquium on Mathematics and Computer Science, Discrete Mathematics and Theoretical Computer Science, pp 461-474, 2008. | |
| 3. Complexity and Limiting Ratio of Boolean Functions over Implication. [pdf][bib] H. Fournier, D. Gardy, A. Genitrini and B. Gittenberger. In Proc. 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 5162 of Lecture Notes in Computer Science, pp 347-362, 2008. | |
| 2. Intuitionistic vs Classical Tautologies, Quantitative Comparison. [pdf][bib] A. Genitrini, J. Kozik and M. Zaionc. In Proc. TYPES 2007, volume 4941 of Lecture Notes in Computer Science, pp 100-109, 2008. | |
| 1. Classical and intuitionistic logic are asymptotically identical. [pdf][bib] H. Fournier, D. Gardy, A. Genitrini and M. Zaionc.In Proc. 16th Annual Conference on Computer Science Logic (EACSL), volume 4646 of Lecture Notes in Computer Science, pp 177-193, 2007. |