Bodini, Olivier; Genitrini, Antoine; Gittenberger, Bernhard; Larcher, Isabella; Naima, Mehdi Compaction for two models of logarithmic-depth trees: analysis and experiments. (English) Zbl 1522.05031 Random Struct. Algorithms 61, No. 1, 31-61 (2022). MSC: 05C05 05C10 05A15 68P05 PDFBibTeX XMLCite \textit{O. Bodini} et al., Random Struct. Algorithms 61, No. 1, 31--61 (2022; Zbl 1522.05031) Full Text: DOI arXiv
Dien, Matthieu; Genitrini, Antoine; Peschanski, Frédéric A combinatorial study of async/await processes. (English) Zbl 07719831 Seidl, Helmut (ed.) et al., Theoretical aspects of computing – ICTAC 2022. 19th international colloquium, Tbilisi, Georgia, September 27–29, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13572, 170-187 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. Dien} et al., Lect. Notes Comput. Sci. 13572, 170--187 (2022; Zbl 07719831) Full Text: DOI
Bodini, Olivier; Genitrini, Antoine; Naima, Mehdi A combinatorial link between labelled graphs and increasingly labelled Schröder trees. (English) Zbl 07719363 Castañeda, Armando (ed.) et al., Latin 2022: theoretical informatics. 15th Latin American symposium, Guanajuato, Mexico, November 7–11, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13568, 493-509 (2022). MSC: 68Qxx 68Rxx 68Wxx PDFBibTeX XMLCite \textit{O. Bodini} et al., Lect. Notes Comput. Sci. 13568, 493--509 (2022; Zbl 07719363) Full Text: DOI
Genitrini, Antoine; Pépin, Martin; Peschanski, Frédéric A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space. (English) Zbl 1483.68230 Theor. Comput. Sci. 912, 1-36 (2022). MSC: 68Q85 68R05 68W20 PDFBibTeX XMLCite \textit{A. Genitrini} et al., Theor. Comput. Sci. 912, 1--36 (2022; Zbl 1483.68230) Full Text: DOI HAL
Bodini, Olivier; Genitrini, Antoine; Mailler, Cécile; Naima, Mehdi Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study. (English) Zbl 1478.05132 Adv. Appl. Math. 133, Article ID 102284, 43 p. (2022). MSC: 05C80 05C78 05C05 05A15 05A16 68W40 60E05 92D15 PDFBibTeX XMLCite \textit{O. Bodini} et al., Adv. Appl. Math. 133, Article ID 102284, 43 p. (2022; Zbl 1478.05132) Full Text: DOI HAL
Bodini, Olivier; Dien, Matthieu; Genitrini, Antoine; Peschanski, Frédéric Quantitative and algorithmic aspects of barrier synchronization in concurrency. (English) Zbl 07524075 Discrete Math. Theor. Comput. Sci. 22, No. 3, Paper No. 1, 36 p. (2021). Reviewer: T. C. Mohan (Chennai) MSC: 68Q85 68R05 PDFBibTeX XMLCite \textit{O. Bodini} et al., Discrete Math. Theor. Comput. Sci. 22, No. 3, Paper No. 1, 36 p. (2021; Zbl 07524075) Full Text: Link
Bodini, Olivier; Genitrini, Antoine; Naima, Mehdi; Singh, Alexandros Families of monotonic trees: combinatorial enumeration and asymptotics. (English) Zbl 07603919 Fernau, Henning, Computer science – theory and applications. 15th international computer science symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12159, 155-168 (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{O. Bodini} et al., Lect. Notes Comput. Sci. 12159, 155--168 (2020; Zbl 07603919) Full Text: DOI
Clément, Julien; Genitrini, Antoine Binary decision diagrams: from tree compaction to sampling. (English) Zbl 07600804 Kohayakawa, Yoshiharu (ed.) et al., Latin 2020: theoretical informatics. 14th Latin American symposium, São Paulo, Brazil, January 5–8, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12118, 571-583 (2020). MSC: 68Qxx 68Rxx 68Wxx PDFBibTeX XMLCite \textit{J. Clément} and \textit{A. Genitrini}, Lect. Notes Comput. Sci. 12118, 571--583 (2020; Zbl 07600804) Full Text: DOI arXiv
Genitrini, Antoine; Pépin, Martin; Peschanski, Frédéric Statistical analysis of non-deterministic fork-join processes. (English) Zbl 07369984 Pun, Violet Ka I. (ed.) et al., Theoretical aspects of computing – ICTAC 2020. 17th international colloquium, Macau, China, November 30 – December 4, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12545, 83-102 (2020). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Genitrini} et al., Lect. Notes Comput. Sci. 12545, 83--102 (2020; Zbl 07369984) Full Text: DOI HAL
Bodini, Olivier; Dien, Matthieu; Genitrini, Antoine; Peschanski, Frédéric The combinatorics of barrier synchronization. (English) Zbl 07796234 Donatelli, Susanna (ed.) et al., Application and theory of Petri nets and concurrency. 40th international conference, PETRI NETS 2019, Aachen, Germany, June 23–28, 2019, Proceeding. Cham: Springer. Lect. Notes Comput. Sci. 11522, 386-405 (2019). MSC: 68Q85 68R05 68W05 PDFBibTeX XMLCite \textit{O. Bodini} et al., Lect. Notes Comput. Sci. 11522, 386--405 (2019; Zbl 07796234) Full Text: DOI arXiv
Bodini, Olivier; Dien, Matthieu; Genitrini, Antoine; Viola, Alfredo Beyond series-parallel concurrent systems: the case of arch processes. (English) Zbl 1478.68187 Fill, James Allen (ed.) et al., 29th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms, AofA 2018, June 25–29, 2018, Uppsala, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 110, Article 14, 14 p. (2018). MSC: 68Q85 05A15 PDFBibTeX XMLCite \textit{O. Bodini} et al., LIPIcs -- Leibniz Int. Proc. Inform. 110, Article 14, 14 p. (2018; Zbl 1478.68187) Full Text: DOI arXiv
Bodini, Olivier; Dien, Matthieu; Genitrini, Antoine; Peschanski, Frédéric The ordered and colored products in analytic combinatorics: application to the quantitative study of synchronizations in concurrent processes. (English) Zbl 1429.68145 Martínez, Conrado (ed.) et al., Proceedings of the 14th workshop on analytic algorithmics and combinatorics, ANALCO ’17, Barcelona, Spain, January 16–17, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 16-30 (2017). MSC: 68Q85 68R05 PDFBibTeX XMLCite \textit{O. Bodini} et al., in: Proceedings of the 14th workshop on analytic algorithmics and combinatorics, ANALCO '17, Barcelona, Spain, January 16--17, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 16--30 (2017; Zbl 1429.68145) Full Text: DOI
Bodini, Olivier; Dien, Matthieu; Genitrini, Antoine; Peschanski, Frédéric Entropic uniform sampling of linear extensions in series-parallel posets. (English) Zbl 1489.68174 Weil, Pascal (ed.), Computer science – theory and applications. 12th international computer science symposium in Russia, CSR 2017, Kazan, Russia, June 8–12, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10304, 71-84 (2017). MSC: 68R05 06A07 60C05 68W20 PDFBibTeX XMLCite \textit{O. Bodini} et al., Lect. Notes Comput. Sci. 10304, 71--84 (2017; Zbl 1489.68174) Full Text: DOI
Genitrini, Antoine; Mailler, Cécile Generalised and quotient models for random and/or trees and application to satisfiability. (English) Zbl 1355.68199 Algorithmica 76, No. 4, 1106-1138 (2016). MSC: 68R05 05C05 05C80 06E30 68Q87 PDFBibTeX XMLCite \textit{A. Genitrini} and \textit{C. Mailler}, Algorithmica 76, No. 4, 1106--1138 (2016; Zbl 1355.68199) Full Text: DOI arXiv
Bodini, Olivier; Dien, Matthieu; Fontaine, Xavier; Genitrini, Antoine; Hwang, Hsien-Kuei Increasing diamonds. (English) Zbl 1417.05005 Kranakis, Evangelos (ed.) et al., LATIN 2016: theoretical informatics. 12th Latin American symposium, Ensenada, Mexico, April 11–15, 2016. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9644, 207-219 (2016). MSC: 05A15 68Q85 PDFBibTeX XMLCite \textit{O. Bodini} et al., Lect. Notes Comput. Sci. 9644, 207--219 (2016; Zbl 1417.05005) Full Text: DOI
Bodini, O.; Genitrini, A.; Peschanski, F. A quantitative study of pure parallel processes. (English) Zbl 1329.05066 Electron. J. Comb. 23, No. 1, Research Paper P1.11, 39 p. (2016). MSC: 05C05 05A16 06A07 68N19 PDFBibTeX XMLCite \textit{O. Bodini} et al., Electron. J. Comb. 23, No. 1, Research Paper P1.11, 39 p. (2016; Zbl 1329.05066) Full Text: arXiv Link
Bodini, Olivier; Genitrini, Antoine Cuts in increasing trees. (English) Zbl 1429.68181 Sedgewick, Robert (ed.) et al., Proceedings of the 12th workshop on analytic algorithmics and combinatorics (ANALCO ’15), San Diego, CA, USA, January 4, 2015. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 66-77 (2015). MSC: 68R10 05C05 05C40 68P05 PDFBibTeX XMLCite \textit{O. Bodini} and \textit{A. Genitrini}, in: Proceedings of the 12th workshop on analytic algorithmics and combinatorics (ANALCO '15), San Diego, CA, USA, January 4, 2015. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 66--77 (2015; Zbl 1429.68181) Full Text: DOI
Bodini, Olivier; Genitrini, Antoine; Rolin, Nicolas Pointed versus singular Boltzmann samplers: a comparative analysis. (English) Zbl 1374.68346 PU.M.A., Pure Math. Appl. 25, No. 2, 115-131 (2015). MSC: 68Q87 05A15 60C05 68R05 68W40 PDFBibTeX XMLCite \textit{O. Bodini} et al., PU.M.A., Pure Math. Appl. 25, No. 2, 115--131 (2015; Zbl 1374.68346) Full Text: DOI
Bodini, Olivier; Genitrini, Antoine; Peschanski, Frédéric; Rolin, Nicolas Associativity for binary parallel processes: a quantitative study. (English) Zbl 1432.68155 Ganguly, Sumit (ed.) et al., Algorithms and discrete applied mathematics. First international conference, CALDAM 2015, Kanpur, India, February 8–10, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 8959, 217-228 (2015). MSC: 68Q10 68R05 PDFBibTeX XMLCite \textit{O. Bodini} et al., Lect. Notes Comput. Sci. 8959, 217--228 (2015; Zbl 1432.68155) Full Text: DOI
Genitrini, Antoine; Mailler, Cécile Equivalence classes of random Boolean trees and application to the Catalan satisfiability problem. (English) Zbl 1351.68191 Pardo, Alberto (ed.) et al., LATIN 2014: theoretical informatics. 11th Latin American symposium, Montevideo, Uruguay, March 31 – April 4, 2014. Proceedings. Berlin: Springer (ISBN 978-3-642-54422-4/pbk). Lecture Notes in Computer Science 8392, 466-477 (2014). MSC: 68R05 05C05 05C80 06E30 68Q87 PDFBibTeX XMLCite \textit{A. Genitrini} and \textit{C. Mailler}, Lect. Notes Comput. Sci. 8392, 466--477 (2014; Zbl 1351.68191) Full Text: DOI
Bodini, Olivier; Genitrini, Antoine; Peschanski, Frédéric The combinatorics of non-determinism. (English) Zbl 1359.68080 Seth, Anil (ed.) et al., 33nd international conference on foundations of software technology and theoretical computer science, FSTTCS 2013, Guwahati, India, December 12–14, 2013. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-64-4). LIPIcs – Leibniz International Proceedings in Informatics 24, 425-436 (2013). MSC: 68Q10 68Q85 68R05 PDFBibTeX XMLCite \textit{O. Bodini} et al., LIPIcs -- Leibniz Int. Proc. Inform. 24, 425--436 (2013; Zbl 1359.68080) Full Text: DOI
Bodini, Olivier; Genitrini, Antoine; Peschanski, Frédéric Enumeration and random generation of concurrent computations. (English) Zbl 1296.68101 Broutin, Nicolas (ed.) et al., Proceeding of the 23rd international meeting on probabilistic, combinatorial, and asymptotic methods in the analysis of algorithms (AofA’12), Montreal, Canada, June 18–22, 2012. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 83-96, electronic only (2012). MSC: 68Q85 68Q87 PDFBibTeX XMLCite \textit{O. Bodini} et al., in: Proceeding of the 23rd international meeting on probabilistic, combinatorial, and asymptotic methods in the analysis of algorithms (AofA'12), Montreal, Canada, June 18--22, 2012. Nancy: The Association. Discrete Mathematics \& Theoretical Computer Science (DMTCS). 83--96 (2012; Zbl 1296.68101) Full Text: Link
Genitrini, Antoine; Gittenberger, Bernhard No Shannon effect on probability distributions on Boolean functions induced by random expressions. (English) Zbl 1355.68119 Drmota, Michael (ed.) et al., Proceeding of the 21st international meeting on probabilistic, combinatorial, and asymptotic methods in the analysis of algorithms (AofA’10), Vienna, Austria, June 28 – July 2, 2010. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 303-316 (2010). MSC: 68Q25 06E30 60J80 PDFBibTeX XMLCite \textit{A. Genitrini} and \textit{B. Gittenberger}, in: Proceeding of the 21st international meeting on probabilistic, combinatorial, and asymptotic methods in the analysis of algorithms (AofA'10), Vienna, Austria, June 28 -- July 2, 2010. Nancy: The Association. Discrete Mathematics \& Theoretical Computer Science (DMTCS). 303--316 (2010; Zbl 1355.68119) Full Text: Link
Fournier, Hervé; Gardy, Danièle; Genitrini, Antoine Balanced and/or trees and linear threshold functions. (English) Zbl 1430.68165 Sedgewick, Robert (ed.) et al., Proceedings of the 6th workshop on analytic algorithmics and combinatorics (ANALCO), New York, NY, USA, Januar 3, 2009. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 51-57 (2009). MSC: 68R05 68Q10 68Q87 PDFBibTeX XMLCite \textit{H. Fournier} et al., in: Proceedings of the 6th workshop on analytic algorithmics and combinatorics (ANALCO), New York, NY, USA, Januar 3, 2009. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 51--57 (2009; Zbl 1430.68165) Full Text: DOI Link