Handbook of Mathematical Functions With Formulas, Graphs, and Mathematical Tables, National Bureau of Standards Applied Mathematics Series, vol.55, 1964. ,
, Compilers, Principles, Techniques, 1986.
Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming, J. Log. Algebr. Program, vol.62, issue.1, pp.1-39, 2005. ,
The asymptotic number of acyclic digraphs, I. Combinatorica, vol.6, issue.1, pp.15-22, 1986. ,
The asymptotic number of acyclic digraphs, II. J. Combin. Theory Ser. B, vol.44, issue.3, pp.363-369, 1988. ,
The ordered and colored products in analytic combinatorics: Application to the quantitative study of synchronizations in concurrent processes, Proceedings of the Meeting on Analytic Algorithmics and Combinatorics, ANALCO'17, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01448695
Lambda terms of bounded unary height, Proceedings of the Meeting on Analytic Algorithmics and Combinatorics, ANALCO '11, pp.23-32, 2011. ,
On the number of unarybinary tree-like structures with restrictions on the unary height, Ann. Comb, vol.22, issue.1, pp.45-91, 2018. ,
Enumeration of generalized BCI lambda-terms, Electr. J. Comb, vol.20, issue.4, p.30, 2013. ,
XML compression via directed acyclic graphs, Theory of Computing Systems, vol.57, issue.4, pp.1322-1371, 2015. ,
Sampling different kinds of acyclic automata using Markov chains, Theoret. Comput. Sci, vol.450, pp.31-42, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00841870
, Release 1.0.13 of 2016-09-16
Variations on the common subexpression problem, J. Assoc. Comput. Mach, vol.27, issue.4, pp.758-771, 1980. ,
Analytic Combinatorics, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00072739
Analytic variations on the common subexpression problem, Automata, languages and programming, vol.443, pp.220-234, 1990. ,
URL : https://hal.archives-ouvertes.fr/inria-00075348
Asymptotic behaviour of the poles of a special generating function for acyclic digraphs, Aequationes Math, vol.70, issue.3, pp.268-278, 2005. ,
Special functions-integral transformsasymptotics-continued fractions, Reprint of the 1977 original, vol.2, 1991. ,
, Ordinary Differential Equations, 1944.
The Concrete Tetrahedron. Texts and Monographs in Symbolic Computation, 2011. ,
Exact enumeration of acyclic deterministic automata, Discrete Applied Mathematics, vol.154, issue.3, pp.537-551, 2006. ,
Counting phylogenetic networks, Ann. Comb, vol.19, issue.1, pp.205-224, 2015. ,
On the shape of a random acyclic digraph, Math. Proc. Cambridge Philos. Soc, vol.106, issue.3, pp.459-465, 1989. ,
Random generation of directed acyclic graphs, Comb01-Euroconference on Combinatorics, Graph Theory and Applications, vol.10, 2001. ,
Generating connected acyclic digraphs uniformly at random, Inform. Process. Lett, vol.90, issue.4, pp.209-213, 2004. ,
Autour de l'évaluation numérique des fonctions D-finies, 2011. ,
Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen, Acta Mathematica, vol.68, issue.1, pp.145-254, 1937. ,
Repeated fringe subtrees in random rooted trees, Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp.78-88, 2015. ,
Enumeration of acyclic digraphs, Proc. Second Chapel Hill Conf. on Combinatorial Mathematics and its Applications, pp.391-399, 1970. ,
Counting labeled acyclic digraphs, New directions in the theory of graphs (Proc. Third Ann Arbor Conf., Univ. Michigan, pp.239-273, 1971. ,
Counting unlabeled acyclic digraphs, Combinatorial Mathematics, V (Proc. Fifth Austral. Conf, vol.622, pp.28-43, 1976. ,
Handbuch der Theorie der linearen Differentialgleichungen. In zwei Bänden, Band I. Reprint. Bibliotheca Mathematica Teubneriana, Band 30, Johnson Reprint Corp, 1968. ,
With a foreword by Gian-Carlo Rota and appendix 1 by Sergey Fomin, Cambridge Studies in Advanced Mathematics, vol.2, 1999. ,
Enumeration of labelled chain graphs and labelled essential directed acyclic graphs, Discrete Math, vol.270, issue.1-3, pp.267-278, 2003. ,
Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs, Graphs Combin, vol.20, issue.3, pp.399-411, 2004. ,
Asymptotic enumeration of extensional acyclic digraphs, Algorithmica, vol.66, issue.4, pp.829-847, 2013. ,
A bijection of plane increasing trees with relaxed binary trees of right height at most one, Theoretical Computer Science, vol.755, pp.1-12, 2019. ,
Asymptotic Expansions for Ordinary Differential Equations, 1987. ,