Histoires de fichiers
RAIRO. Inform. théor., 12 1 (1978) 49-62
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Lattice Paths and Branched Continued Fractions: An Infinite Sequence of Generalizations of the Stieltjes–Rogers and Thron–Rogers Polynomials, with Coefficientwise Hankel-Total Positivity
Mathias Pétréolle, Alan Sokal and Bao-Xuan ZhuMemoirs of the American Mathematical Society 291 (1450) (2023)
https://doi.org/10.1090/memo/1450
From Dyck Paths to Standard Young Tableaux
Juan B. Gil, Peter R. W. McNamara, Jordan O. Tirrell and Michael D. WeinerAnnals of Combinatorics 24 (1) 69 (2020)
https://doi.org/10.1007/s00026-019-00482-3
Combinatorial aspects of continued fractions
P. FlajoletDiscrete Mathematics 306 (10-11) 992 (2006)
https://doi.org/10.1016/j.disc.2006.03.020
Basic analytic combinatorics of directed lattice paths
Cyril Banderier and Philippe FlajoletTheoretical Computer Science 281 (1-2) 37 (2002)
https://doi.org/10.1016/S0304-3975(02)00007-5
Mathematical Foundations of Computer Science 1995
P. Feinsilver and R. SchottLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1995 969 574 (1995)
https://doi.org/10.1007/3-540-60246-1_162
Une preuve bijective d'une formule de Touchard-Riordan
Jean-Guy PenaudDiscrete Mathematics 139 (1-3) 347 (1995)
https://doi.org/10.1016/0012-365X(94)00140-E
Dynamic algorithms in D.E. Knuth's model: a probabilistic analysis
G. Louchard, B. Randrianarimanana and R. SchottTheoretical Computer Science 93 (2) 201 (1992)
https://doi.org/10.1016/0304-3975(92)90330-I
Analysis of dynamic algorithms in Knuth's model
J. Françon, B. Randrianarimanana and R. SchottTheoretical Computer Science 72 (2-3) 147 (1990)
https://doi.org/10.1016/0304-3975(90)90033-E
Algorithms and Complexity
Jeffrey Scott VITTER and Philippe FLAJOLETAlgorithms and Complexity 431 (1990)
https://doi.org/10.1016/B978-0-444-88071-0.50014-X
Fundamentals of Computation Theory
J. Françon, B. Randrianarimanana and R. SchottLecture Notes in Computer Science, Fundamentals of Computation Theory 380 162 (1989)
https://doi.org/10.1007/3-540-51498-8_16
Automata, Languages and Programming
G. Louchard, B. Randrianarimanana and R. SchottLecture Notes in Computer Science, Automata, Languages and Programming 372 521 (1989)
https://doi.org/10.1007/BFb0035781
CAAP '88
J. Françon, B. Randrianarimanana and R. SchottLecture Notes in Computer Science, CAAP '88 299 72 (1988)
https://doi.org/10.1007/BFb0026097
The analysis of simple list structures
Philippe Flajolet, Claude Puech and Jean VuilleminInformation Sciences 38 (2) 121 (1986)
https://doi.org/10.1016/0020-0255(86)90016-2
Mathematical Foundations of Computer Science 1986
Philippe FlajoletLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1986 233 325 (1986)
https://doi.org/10.1007/BFb0016257
Polynômes Orthogonaux et Applications
Gérard ViennotLecture Notes in Mathematics, Polynômes Orthogonaux et Applications 1171 139 (1985)
https://doi.org/10.1007/BFb0076539
Une preuve combinatoire de la rationalité d'une série génératrice associée aux arbres
Laurent Chottin and Robert CoriRAIRO. Informatique théorique 16 (2) 113 (1982)
https://doi.org/10.1051/ita/1982160201131
Combinatorial aspects of continued fractions
P. FlajoletDiscrete Mathematics 32 (2) 125 (1980)
https://doi.org/10.1016/0012-365X(80)90050-3
Sequence of operations analysis for dynamic data structures
P Flajolet, J Françon and J VuilleminJournal of Algorithms 1 (2) 111 (1980)
https://doi.org/10.1016/0196-6774(80)90020-6
183 (1979)
https://doi.org/10.1109/SFCS.1979.46
Énumération des permutations par nombre de marches
F. PoussinRAIRO. Informatique théorique 13 (3) 251 (1979)
https://doi.org/10.1051/ita/1979130302511
Permutations selon leurs pics, creux, doubles montées et double descentes, nombres d'euler et nombres de Genocchi
Jean Françon and Gérard ViennotDiscrete Mathematics 28 (1) 21 (1979)
https://doi.org/10.1016/0012-365X(79)90182-1