Antoine Genitrini

50 papers B 9C 5Misc 3Journal 24Unranked 7

Year	Rank	Type	Title / Venue / Authors
2025	B	`conf`	Optimal Uniform Shortest Path Sampling. WALCOM Simon Dreyer, Antoine Genitrini, Mehdi Naima
2024	C	`conf`	Lexicographic Unranking Algorithms for the Twelvefold Way. AofA Amaury Curiel, Antoine Genitrini
2023	B	`conf`	An Iterative Approach for Counting Reduced Ordered Binary Decision Diagrams. MFCS Julien Clément, Antoine Genitrini
2022	B	`conf`	A Combinatorial Link Between Labelled Graphs and Increasingly Labelled Schröder Trees. LATIN Olivier Bodini, Antoine Genitrini, Mehdi Naima
2022	C	`conf`	A Combinatorial Study of Async/Await Processes. ICTAC Matthieu Dien, Antoine Genitrini, Frédéric Peschanski
2022	J	`jnl`	A quantitative study of fork-join processes with non-deterministic choice: Application to the statistical exploration of the state-space. Theor. Comput. Sci. Antoine Genitrini, Martin Pépin, Frédéric Peschanski
2022	J	`jnl`	Combinatorics of Reduced Ordered Binary Decision Diagrams: Application to uniform random sampling. CoRR Julien Clément, Antoine Genitrini
2022	J	`jnl`	Compaction for two models of logarithmic-depth trees: Analysis and experiments. Random Struct. Algorithms Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, Isabella Larcher, Mehdi Naima
2022	J	`jnl`	Strict monotonic trees arising from evolutionary processes: Combinatorial and probabilistic study. Adv. Appl. Math. Olivier Bodini, Antoine Genitrini, Cécile Mailler, Mehdi Naima
2021	J	`jnl`	Lexicographic Unranking of Combinations Revisited. Algorithms Antoine Genitrini, Martin Pépin
2021	J	`jnl`	Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency. Discret. Math. Theor. Comput. Sci. Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski
2021	C	`conf`	Unlabelled ordered DAGs and labelled DAGs: constructive enumeration and uniform random sampling. LAGOS Antoine Genitrini, Martin Pépin, Alfredo Viola
2020	J	`jnl`	Asymptotic enumeration of compacted binary trees of bounded right height. J. Comb. Theory A Antoine Genitrini, Bernhard Gittenberger, Manuel Kauers, Michael Wallner
2020	B	`conf`	Binary Decision Diagrams: From Tree Compaction to Sampling. LATIN Julien Clément, Antoine Genitrini
2020	J	`jnl`	Compaction for two models of logarithmic-depth trees: Analysis and Experiments. CoRR Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, Isabella Larcher, Mehdi Naima
2020	Misc	`conf`	Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics. CSR Olivier Bodini, Antoine Genitrini, Mehdi Naima, Alexandros Singh
2020	J	`jnl`	On the number of increasing trees with label repetitions. Discret. Math. Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, Stephan Wagner
2020	C	`conf`	Statistical Analysis of Non-deterministic Fork-Join Processes. ICTAC Antoine Genitrini, Martin Pépin, Frédéric Peschanski
2019	J	`jnl`	Binary Decision Diagrams: from Tree Compaction to Sampling. CoRR Julien Clément, Antoine Genitrini
2019	—	`conf`	Ranked Schröder Trees. ANALCO Olivier Bodini, Antoine Genitrini, Mehdi Naima
2019	B	`conf`	The Combinatorics of Barrier Synchronization. Petri Nets Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski
2019	J	`jnl`	The Combinatorics of Barrier Synchronization. CoRR Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski
2018	C	`conf`	Beyond Series-Parallel Concurrent Systems: The Case of Arch Processes. AofA Olivier Bodini, Matthieu Dien, Antoine Genitrini, Alfredo Viola
2018	J	`jnl`	Beyond series-parallel concurrent systems: the case of arch processes. CoRR Olivier Bodini, Matthieu Dien, Antoine Genitrini, Alfredo Viola
2018	J	`jnl`	Ranked Schröder Trees. CoRR Olivier Bodini, Antoine Genitrini, Mehdi Naima
2017	J	`jnl`	Asymptotic Enumeration of Compacted Binary Trees. CoRR Antoine Genitrini, Bernhard Gittenberger, Manuel Kauers, Michael Wallner
2017	—	`book`	Combinatoire énumérative et analytique en Logique Propositionnelle et en Théorie de la Concurrence : Vers une quantification de l'expressivité des modèles. (Enumerative and Analytic Combinatorics for Propositional Logic and Concurrency Theory : Towards a quantification of the model expressiveness). Antoine Genitrini
2017	Misc	`conf`	Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets. CSR Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski
2017	J	`jnl`	Extended boxed product and application to synchronized trees. Electron. Notes Discret. Math. Olivier Bodini, Antoine Genitrini, Nicolas Rolin
2017	—	`conf`	The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes. ANALCO Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski
2016	J	`jnl`	A Quantitative Study of Pure Parallel Processes. Electron. J. Comb. Olivier Bodini, Antoine Genitrini, Frédéric Peschanski
2016	J	`jnl`	Full asymptotic expansion for Polya structures. CoRR Antoine Genitrini
2016	J	`jnl`	Generalised and Quotient Models for Random And/Or Trees and Application to Satisfiability. Algorithmica Antoine Genitrini, Cécile Mailler
2016	B	`conf`	Increasing Diamonds. LATIN Olivier Bodini, Matthieu Dien, Xavier Fontaine, Antoine Genitrini, Hsien-Kuei Hwang
2015	J	`jnl`	Associative and commutative tree representations for Boolean functions. Theor. Comput. Sci. Antoine Genitrini, Bernhard Gittenberger, Veronika Kraus, Cécile Mailler
2015	—	`conf`	Associativity for Binary Parallel Processes: A Quantitative Study. CALDAM Olivier Bodini, Antoine Genitrini, Frédéric Peschanski, Nicolas Rolin
2015	—	`conf`	Cuts in Increasing Trees. ANALCO Olivier Bodini, Antoine Genitrini
2014	J	`jnl`	A Quantitative Study of Pure Parallel Processes. CoRR Olivier Bodini, Antoine Genitrini, Frédéric Peschanski
2014	B	`conf`	Equivalence Classes of Random Boolean Trees and Application to the Catalan Satisfiability Problem. LATIN Antoine Genitrini, Cécile Mailler
2013	—	`conf`	The Combinatorics of Non-determinism. FSTTCS Olivier Bodini, Antoine Genitrini, Frédéric Peschanski
2012	J	`jnl`	In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid. Ann. Pure Appl. Log. Antoine Genitrini, Jakub Kozik
2012	J	`jnl`	Probabilities of Boolean Functions given by Random Implicational Formulas. Electron. J. Comb. Antoine Genitrini, Bernhard Gittenberger, Veronika Kraus, Cécile Mailler
2012	J	`jnl`	The fraction of large random trees representing a given Boolean function in implicational logic. Random Struct. Algorithms Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger
2010	J	`jnl`	Tautologies over implication with negative literals. Math. Log. Q. Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc
2009	—	`conf`	Balanced And/Or Trees and Linear Threshold Functions. ANALCO Hervé Fournier, Danièle Gardy, Antoine Genitrini
2009	—	`—`	Expressions Booléennes aléatoires: probabilité, complexité et comparaison quantitative de logiques propositionnelles. (Random Boolean expressions: probability, complexity and quantitative comparisons of propositional logics). Antoine Genitrini
2009	Misc	`conf`	Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System. LFCS Antoine Genitrini, Jakub Kozik
2008	B	`conf`	Complexity and Limiting Ratio of Boolean Functions over Implication. MFCS Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger
2007	B	`conf`	Classical and Intuitionistic Logic Are Asymptotically Identical. CSL Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc
2007	—	`conf`	Intuitionistic vs. Classical Tautologies, Quantitative Comparison. TYPES Antoine Genitrini, Jakub Kozik, Marek Zaionc