default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntoine Genitrini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c23]Amaury Curiel, Antoine Genitrini:
Lexicographic Unranking Algorithms for the Twelvefold Way. AofA 2024: 17:1-17:14- 2023
- [c22]Julien Clément, Antoine Genitrini:
An Iterative Approach for Counting Reduced Ordered Binary Decision Diagrams. MFCS 2023: 36:1-36:15 - 2022
- [j15]Olivier Bodini, Antoine Genitrini, Cécile Mailler
, Mehdi Naima:
Strict monotonic trees arising from evolutionary processes: Combinatorial and probabilistic study. Adv. Appl. Math. 133: 102284 (2022) - [j14]Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, Isabella Larcher, Mehdi Naima:
Compaction for two models of logarithmic-depth trees: Analysis and experiments. Random Struct. Algorithms 61(1): 31-61 (2022) - [j13]Antoine Genitrini, Martin Pépin, Frédéric Peschanski:
A quantitative study of fork-join processes with non-deterministic choice: Application to the statistical exploration of the state-space. Theor. Comput. Sci. 912: 1-36 (2022) - [c21]Matthieu Dien, Antoine Genitrini, Frédéric Peschanski:
A Combinatorial Study of Async/Await Processes. ICTAC 2022: 170-187 - [c20]Olivier Bodini, Antoine Genitrini, Mehdi Naima:
A Combinatorial Link Between Labelled Graphs and Increasingly Labelled Schröder Trees. LATIN 2022: 493-509 - [i9]Julien Clément, Antoine Genitrini:
Combinatorics of Reduced Ordered Binary Decision Diagrams: Application to uniform random sampling. CoRR abs/2211.04938 (2022) - 2021
- [j12]Antoine Genitrini, Martin Pépin:
Lexicographic Unranking of Combinations Revisited. Algorithms 14(3): 97 (2021) - [j11]Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski:
Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency. Discret. Math. Theor. Comput. Sci. 22(3) (2021) - [c19]Antoine Genitrini, Martin Pépin, Alfredo Viola:
Unlabelled ordered DAGs and labelled DAGs: constructive enumeration and uniform random sampling. LAGOS 2021: 468-477 - 2020
- [j10]Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, Stephan Wagner:
On the number of increasing trees with label repetitions. Discret. Math. 343(8): 111722 (2020) - [j9]Antoine Genitrini, Bernhard Gittenberger, Manuel Kauers, Michael Wallner:
Asymptotic enumeration of compacted binary trees of bounded right height. J. Comb. Theory A 172: 105177 (2020) - [c18]Olivier Bodini, Antoine Genitrini, Mehdi Naima, Alexandros Singh:
Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics. CSR 2020: 155-168 - [c17]Antoine Genitrini, Martin Pépin, Frédéric Peschanski:
Statistical Analysis of Non-deterministic Fork-Join Processes. ICTAC 2020: 83-102 - [c16]Julien Clément, Antoine Genitrini:
Binary Decision Diagrams: From Tree Compaction to Sampling. LATIN 2020: 571-583 - [i8]Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, Isabella Larcher, Mehdi Naima:
Compaction for two models of logarithmic-depth trees: Analysis and Experiments. CoRR abs/2005.12997 (2020)
2010 – 2019
- 2019
- [c15]Olivier Bodini, Antoine Genitrini, Mehdi Naima:
Ranked Schröder Trees. ANALCO 2019: 13-26 - [c14]Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski:
The Combinatorics of Barrier Synchronization. Petri Nets 2019: 386-405 - [i7]Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski:
The Combinatorics of Barrier Synchronization. CoRR abs/1907.04243 (2019) - [i6]Julien Clément, Antoine Genitrini:
Binary Decision Diagrams: from Tree Compaction to Sampling. CoRR abs/1907.06743 (2019) - 2018
- [c13]Olivier Bodini, Matthieu Dien, Antoine Genitrini, Alfredo Viola:
Beyond Series-Parallel Concurrent Systems: The Case of Arch Processes. AofA 2018: 14:1-14:14 - [i5]Olivier Bodini, Matthieu Dien, Antoine Genitrini, Alfredo Viola:
Beyond series-parallel concurrent systems: the case of arch processes. CoRR abs/1803.00843 (2018) - [i4]Olivier Bodini, Antoine Genitrini, Mehdi Naima:
Ranked Schröder Trees. CoRR abs/1808.08376 (2018) - 2017
- [b1]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. (Enumerative and Analytic Combinatorics for Propositional Logic and Concurrency Theory : Towards a quantification of the model expressiveness). UPMC, Paris, France, 2017 - [j8]Olivier Bodini, Antoine Genitrini, Nicolas Rolin:
Extended boxed product and application to synchronized trees. Electron. Notes Discret. Math. 59: 189-202 (2017) - [c12]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. ANALCO 2017: 16-30 - [c11]Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski:
Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets. CSR 2017: 71-84 - [i3]Antoine Genitrini, Bernhard Gittenberger, Manuel Kauers, Michael Wallner:
Asymptotic Enumeration of Compacted Binary Trees. CoRR abs/1703.10031 (2017) - 2016
- [j7]Antoine Genitrini, Cécile Mailler:
Generalised and Quotient Models for Random And/Or Trees and Application to Satisfiability. Algorithmica 76(4): 1106-1138 (2016) - [j6]Olivier Bodini, Antoine Genitrini, Frédéric Peschanski:
A Quantitative Study of Pure Parallel Processes. Electron. J. Comb. 23(1): 1 (2016) - [c10]Olivier Bodini, Matthieu Dien, Xavier Fontaine, Antoine Genitrini, Hsien-Kuei Hwang:
Increasing Diamonds. LATIN 2016: 207-219 - [i2]Antoine Genitrini:
Full asymptotic expansion for Polya structures. CoRR abs/1605.00837 (2016) - 2015
- [j5]Antoine Genitrini, Bernhard Gittenberger, Veronika Kraus, Cécile Mailler:
Associative and commutative tree representations for Boolean functions. Theor. Comput. Sci. 570: 70-101 (2015) - [c9]Olivier Bodini, Antoine Genitrini:
Cuts in Increasing Trees. ANALCO 2015: 66-77 - [c8]Olivier Bodini, Antoine Genitrini, Frédéric Peschanski, Nicolas Rolin:
Associativity for Binary Parallel Processes: A Quantitative Study. CALDAM 2015: 217-228 - 2014
- [c7]Antoine Genitrini, Cécile Mailler:
Equivalence Classes of Random Boolean Trees and Application to the Catalan Satisfiability Problem. LATIN 2014: 466-477 - [i1]Olivier Bodini, Antoine Genitrini, Frédéric Peschanski:
A Quantitative Study of Pure Parallel Processes. CoRR abs/1407.1873 (2014) - 2013
- [c6]Olivier Bodini, Antoine Genitrini, Frédéric Peschanski:
The Combinatorics of Non-determinism. FSTTCS 2013: 425-436 - 2012
- [j4]Antoine Genitrini, Jakub Kozik:
In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid. Ann. Pure Appl. Log. 163(7): 875-887 (2012) - [j3]Antoine Genitrini, Bernhard Gittenberger, Veronika Kraus, Cécile Mailler:
Probabilities of Boolean Functions given by Random Implicational Formulas. Electron. J. Comb. 19(2): 37 (2012) - [j2]Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger:
The fraction of large random trees representing a given Boolean function in implicational logic. Random Struct. Algorithms 40(3): 317-349 (2012) - 2010
- [j1]Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc:
Tautologies over implication with negative literals. Math. Log. Q. 56(4): 388-396 (2010)
2000 – 2009
- 2009
- [c5]Hervé Fournier, Danièle Gardy, Antoine Genitrini:
Balanced And/Or Trees and Linear Threshold Functions. ANALCO 2009: 51-57 - [c4]Antoine Genitrini, Jakub Kozik:
Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System. LFCS 2009: 280-294 - 2008
- [c3]Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger:
Complexity and Limiting Ratio of Boolean Functions over Implication. MFCS 2008: 347-362 - 2007
- [c2]Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc:
Classical and Intuitionistic Logic Are Asymptotically Identical. CSL 2007: 177-193 - [c1]Antoine Genitrini, Jakub Kozik, Marek Zaionc:
Intuitionistic vs. Classical Tautologies, Quantitative Comparison. TYPES 2007: 100-109
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-23 21:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
