Antoine Genitrini

Publications


52 documents

Journal articles17 document

  • Antoine Genitrini, Martin Pépin, Frederic Peschanski. A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space. Theoretical Computer Science, 2022, 912, pp.1-36. ⟨10.1016/j.tcs.2022.01.014⟩. ⟨hal-03201618⟩
  • Olivier Bodini, Antoine Genitrini, Cécile Mailler, Mehdi Naima. Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study. Advances in Applied Mathematics, 2022, 133, pp.102284. ⟨10.1016/j.aam.2021.102284⟩. ⟨hal-02865198v2⟩
  • Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, Isabella Larcher, Mehdi Naima. Compaction for two models of logarithmic-depth trees: Analysis and Experiments. Random Structures and Algorithms, 2022, 61 (1), pp.31-61. ⟨hal-03371646⟩
  • Antoine Genitrini, Martin Pépin. Lexicographic unranking of combinations revisited. Algorithms, 2021, 14 (3), pp.97. ⟨10.3390/a14030097⟩. ⟨hal-03040740v2⟩
  • Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski. Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency. Discrete Mathematics and Theoretical Computer Science, In press, Computational Logic and Applications (CLA’19), vol. 22 no. 3, Computational Logic and Applications (CLA’19) (3), ⟨10.46298/dmtcs.5820⟩. ⟨hal-02301925v4⟩
  • Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, Stephan Wagner. On the number of increasing trees with label repetitions. Discrete Mathematics, 2020, 343 (8), pp.111722. ⟨10.1016/j.disc.2019.111722⟩. ⟨hal-02554861⟩
  • Antoine Genitrini, Bernhard Gittenberger, Manuel Kauers, Michael Wallner. Asymptotic enumeration of compacted binary trees of bounded right height. Journal of Combinatorial Theory, Series A, 2020, 172, pp.105177. ⟨10.1016/j.jcta.2019.105177⟩. ⟨hal-02554860⟩
  • Olivier Bodini, Antoine Genitrini, Nicolas Rolin. Extended boxed product and application to synchronized trees. Electronic Notes in Discrete Mathematics, 2017, 59, pp.189–202. ⟨10.1016/j.endm.2017.05.014⟩. ⟨hal-01331220⟩
  • Veronika Daxner, Antoine Genitrini, Bernhard Gittenberger, Cecile Mailler. The relation between tree size complexity and probability for boolean functions generated by uniform random trees. Applicable Analysis and Discrete Mathematics, 2016, 10 (2), pp.408-446. ⟨10.2298/AADM160715015D⟩. ⟨hal-01476145⟩
  • Antoine Genitrini, Cecile Mailler. Generalised and Quotient Models for Random And/Or Trees and Application to Satisfiability. Algorithmica, 2016, 1, pp.1-33. ⟨10.1007/s00453-016-0113-3⟩. ⟨hal-01329255⟩
  • Olivier Bodini, Antoine Genitrini, Fréderic Peschanski. A Quantitative Study of Pure Parallel Processes. The Electronic Journal of Combinatorics, 2016, 23 (1), pp.P1.11. ⟨hal-01284220⟩
  • Antoine Genitrini, Bernhard Gittenberger, Veronika Kraus, Cécile Mailler. Associative and commutative tree representations for Boolean functions. Theoretical Computer Science, 2015, 570, pp.70-101. ⟨10.1016/j.tcs.2014.12.025⟩. ⟨hal-01122776⟩
  • Olivier Bodini, Antoine Genitrini, Nicolas Rolin. Pointed versus Singular Boltzmann Samplers: a Comparative Analysis. Pure mathematics and applications , 2015, 25 (2), pp.115-131. ⟨10.1515/puma-2015-0012⟩. ⟨hal-01329257⟩
  • Antoine Genitrini, Jakub Kozik. In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid. Annals of Pure and Applied Logic, 2012, 163 (7), pp.875-887. ⟨10.1016/j.apal.2011.09.011⟩. ⟨hal-00618303⟩
  • Antoine Genitrini, Bernhard Gittenberger, Veronika Kraus, Cécile Mailler. Probabilities of Boolean Functions Given by Random Implicational Formulas. The Electronic Journal of Combinatorics, 2012, 19 (2), pp.P37. ⟨hal-00699960⟩
  • Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger. The fraction of large random trees representing a given Boolean function in implicational logic. Random Structures and Algorithms, 2012, 40 (3), pp.317–349. ⟨hal-00551234⟩
  • Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc. Tautologies over implication with negative literals. Mathematical Logic Quarterly, 2010, 56 (4), pp.388-396. ⟨10.1002/malq.200810053⟩. ⟨hal-00530496⟩

Conference papers30 document

  • Simon Dreyer, Antoine Genitrini, Mehdi Naima. Optimal Uniform Shortest Path Sampling. 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Feb 2025, Chengdu, China. pp.160-179, ⟨10.1007/978-981-96-2845-2_11⟩. ⟨hal-04669060v3⟩
  • Amaury Curiel, Antoine Genitrini. Lexicographic Unranking Algorithms for the Twelvefold Way. 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024), Jun 2024, Bath, United Kingdom. pp.17:1–17:14, ⟨10.4230/LIPIcs.AofA.2024.17⟩. ⟨hal-04411470v3⟩
  • Julien Clément, Antoine Genitrini. An Iterative Approach for Counting Reduced Ordered Binary Decision Diagrams. 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), Aug 2023, Bordeaux, France. pp.36:1–36:15, ⟨10.4230/LIPIcs.MFCS.2023.36⟩. ⟨hal-03871300⟩
  • Antoine Genitrini, Mehdi Naima, Olivier Bodini. A combinatorial link between labelled graphs and increasingly labelled Schröder trees. The 15th Latin American Theoretical Informatics Symposium, Nov 2022, Guanajuato, Mexico. pp.493–509, ⟨10.1007/978-3-031-20624-5_30⟩. ⟨hal-03680342v2⟩
  • Matthieu Dien, Antoine Genitrini, Frederic Peschanski. A Combinatorial Study of Async/Await Processes. The 19th International Colloquium on Theoretical Aspects of Computing, Sep 2022, Tbilisi, Georgia. pp.170-187, ⟨10.1007/978-3-031-17715-6_12⟩. ⟨hal-03767986⟩
  • Antoine Genitrini, Martin Pépin, Alfredo Viola. Unlabelled ordered DAGs and labelled DAGs: constructive enumeration and uniform random sampling. The XI Latin and American Algorithms, Graphs and Optimization Symposium, May 2021, Sao Paulo, Brazil. pp.468-477, ⟨10.1016/j.procs.2021.11.057⟩. ⟨hal-03029381v3⟩
  • Antoine Genitrini, Martin Pépin, Frédéric Peschanski. Statistical Analysis of Non-Deterministic Fork-Join Processes. Theoretical Aspects of Computing – ICTAC 2020 – 17th International Colloquium, Nov 2020, Macau, China. pp.83-102, ⟨10.1007/978-3-030-64276-1_5⟩. ⟨hal-02659801v2⟩
  • Olivier Bodini, Antoine Genitrini, Mehdi Naima, Alexandros Singh. Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics. 15th International Computer Science Symposium, Jun 2020, Yekaterinburg, Russia. pp.155-168, ⟨10.1007/978-3-030-50026-9_11⟩. ⟨hal-03033670⟩
  • Julien Clément, Antoine Genitrini. Binary Decision Diagrams: from Tree Compaction to Sampling. 14th Latin American Theoretical Informatics Symposium, May 2020, Sao Polo, Brazil. ⟨10.1007/978-3-030-61792-9_45⟩. ⟨hal-02632657⟩
  • Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frederic Peschanski. The Combinatorics of Barrier Synchronization. PETRI NETS 2019 – 40th International Conference on Application and Theory of Petri Nets and Concurrency, Jun 2019, Aachen, Germany. pp.386-405, ⟨10.1007/978-3-030-21571-2_21⟩. ⟨hal-02163607⟩
  • Olivier Bodini, Antoine Genitrini, Mehdi Naima. Ranked Schröder Trees. ANALCO 2019 – 16th Workshop on Analytic Algorithmics and Combinatorics, Jan 2019, San Diego, CA, United States. pp.13-26, ⟨10.1137/1.9781611975505.2⟩. ⟨hal-02073631⟩
  • Olivier Bodini, Antoine Genitrini, Matthieu Dien, Alfredo Viola. Beyond series-parallel concurrent systems: the case of arch processes. 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018), Jun 2018, Uppsala, Sweden. pp.14:1–14:14, ⟨10.4230/LIPIcs.AofA.2018.14⟩. ⟨hal-02073611⟩
  • Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski. The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes. 14th Workshop on Analytic Algorithmics and Combinatorics (ANALCO17), Jan 2017, Barcelone, Spain. pp.16 – 30, ⟨10.1137/1.9781611974775.2⟩. ⟨hal-01448695⟩
  • Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski. Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets. Computer Science Symposium in Russia, 2017, Kazan, Russia. ⟨hal-01476189⟩
  • Antoine Genitrini. Full asymptotic expansion for Polya structures. 27th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Jul 2016, Krakow, Poland. ⟨hal-01331217⟩
  • Olivier Bodini, Matthieu Dien, Xavier Fontaine, Antoine Genitrini, Hsien-Kuei Hwang. Increasing Diamonds. 12th. Latin American Theoretical INformatics Symposium, Apr 2016, Ensenada, Mexico. ⟨10.1007/978-3-662-49529-2_16⟩. ⟨hal-01331227⟩
  • Olivier Bodini, Antoine Genitrini, Frédéric Peschanski, Nicolas Rolin. Associativity for Binary Parallel Processes: a Quantitative Study. Algorithms and Discrete Applied Mathematics, Feb 2015, Kanpur, India. pp.217-228, ⟨10.1007/978-3-319-14974-5_21⟩. ⟨hal-01215886⟩
  • Olivier Bodini, Antoine Genitrini. Cuts in Increasing Trees. 2015 the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), Jan 2015, San Diego, CA, United States. pp.66-77, ⟨10.1137/1.9781611973761.6⟩. ⟨hal-01215715⟩
  • Olivier Bodini, Antoine Genitrini, Nicolas Rolin. Pointed versus Singular Boltzmann Samplers. 9th edition of the conference GASCom on random generation of combinatorial structures (GASCom’14), Jun 2014, Bertinoro, Italy. ⟨hal-01217224⟩
  • Antoine Genitrini, Bernhard Gittenberger, Cécile Mailler. No Shannon Effect Induced by And/Or Trees. The 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2014, Jun 2014, Paris, France. pp.109-120. ⟨hal-01217252⟩
  • Antoine Genitrini, Cécile Mailler. Equivalence Classes of Random Boolean Trees and Application to the Catalan Satisfiability Problem. International Symposium on Latin American Theoretical Informatics, LATIN 2014, Mar 2014, Montevideo, Uruguay. pp.466-477, ⟨10.1007/978-3-642-54423-1_41⟩. ⟨hal-01217466⟩
  • Olivier Bodini, Antoine Genitrini, Frédéric Peschanski. The Combinatorics of Non-determinism. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2013, Guwahati, India. pp.425-436, ⟨10.4230/LIPIcs.FSTTCS.2013.425⟩. ⟨hal-01216553⟩
  • Olivier Bodini, Antoine Genitrini, Frédéric Peschanski. Enumeration and Random Generation of Concurrent Computations. 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA’12), Jun 2012, Montreal, Canada. pp.83-96, ⟨10.46298/dmtcs.2986⟩. ⟨hal-01197236⟩
  • Antoine Genitrini, Bernhard Gittenberger. No Shannon effect on probability distributions on Boolean functions induced by random expressions. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA’10), 2010, Vienna, Austria. pp.303-316, ⟨10.46298/dmtcs.2784⟩. ⟨hal-01185582⟩
  • Antoine Genitrini, Jakub Kozik. Quantitative comparison of Intuitionistic and Classical logics – full propositional system. International Symposium on Logical Foundations of Computer Science, 2009, Deerfield Beach, United States. pp.280-294. ⟨hal-00530515⟩
  • Hervé Fournier, Danièle Gardy, Antoine Genitrini. Balanced And/Or trees and linear threshold functions. 6th SIAM Workshop on Analytic and Combinatorics, 2008, New York, United States. pp.51-57. ⟨hal-00530512⟩
  • Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger. Complexity and Limiting Ratio of Boolean Functions over Implication.. 33rd International Symposium on Mathematical Foundations of Computer Science, 2008, Torun, Poland. pp.347-362. ⟨hal-00530525⟩
  • Antoine Genitrini, Jakub Kozik, Grzegorz Matecki. On the density and the structure of the Peirce-like formulae. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. pp.461-474, ⟨10.46298/dmtcs.3584⟩. ⟨hal-01194671⟩
  • Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc. Classical and intuitionistic logic are asymptotically identical. 16th Annual Conference on Computer Science Logic, 2007, Lausanne, Switzerland. pp.177-193. ⟨hal-00530534⟩
  • Antoine Genitrini, Jakub Kozik, Marek Zaionc. Intuitionistic vs Classical Tautologies, Quantitative Comparison. TYPES 2007, 2007, Cividale del Friuli, Italy. pp.100-109. ⟨hal-00530530⟩

Preprints, Working Papers2 document

  • Julien Clément, Antoine Genitrini. Counting Reduced Ordered Binary Decision Diagrams With Respect to Size. 2025. ⟨hal-05183438⟩
  • Cyann Donnot, Antoine Genitrini, Yassine Herida. Unranking Combinations Lexicographically: an efficient new strategy compared with others. 2020. ⟨hal-02462764⟩

Reports1 document

  • Nathalie Appel, Jérémie Bourdon, Nicolas Bousquet, Johanne Cohen, Antoine Genitrini, et al.. Section 06 Sciences de l’information : fondements de l’informatique, calculs, algorithmes, représentations, exploitations. CNRS. 2025, pp.1-20. ⟨hal-05238890⟩

HDR thesis1 document

  • Antoine Genitrini. Combinatoire énumérative et analytique en Logique Propositionnelle et en Théorie de la Concurrence : Vers une quantification de l’expressivité des modèles. Algorithme et structure de données [cs.DS]. Sorbonne Université, 2017. ⟨tel-02073648⟩

Logiciel1 document


Powered by HAL logo