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:

Arbres binaires de recherche : propriétés combinatoires et applications

Jean Françon

R.A.I.R.O. Informatique théorique, 10 R3 (1976) 35-50

Published online: 2017-02-01

DOI: https://doi.org/10.1051/ita/197610R300351

This article has been cited by the following article(s):

Search costs in quadtrees and singularity perturbation asymptotics

P. Flajolet and T. Lafforgue
Discrete & Computational Geometry 12 (2) 151 (1994)
https://doi.org/10.1007/BF02574372

CAAP '92

François Bergeron, Philippe Flajolet and Bruno Salvy
Lecture Notes in Computer Science, CAAP '92 581 24 (1992)
https://doi.org/10.1007/3-540-55251-0_2

Exact and asymptotic distributions in digital and binary search trees

G. Louchard
RAIRO - Theoretical Informatics and Applications 21 (4) 479 (1987)
https://doi.org/10.1051/ita/1987210404791

Combinatoire énumérative

Pierre Leroux and Gérard X. Viennot
Lecture Notes in Mathematics, Combinatoire énumérative 1234 210 (1986)
https://doi.org/10.1007/BFb0072518

Alternating permutations and modified Ghandi-polynomials

Volker Strehl
Discrete Mathematics 28 (1) 89 (1979)
https://doi.org/10.1016/0012-365X(79)90188-2

Automata, Languages and Programming

Faith E. Fich and J. A. Brzozowski
Lecture Notes in Computer Science, Automata, Languages and Programming 71 230 (1979)
https://doi.org/10.1007/3-540-09510-1_18

On the analysis of algorithms for trees

Jean Françon
Theoretical Computer Science 4 (2) 155 (1977)
https://doi.org/10.1016/0304-3975(77)90034-2