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

Jean Françon

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1976)

  • Volume: 10, Issue: R3, page 35-50
  • ISSN: 0988-3754

How to cite

top

Françon, Jean. "Arbres binaires de recherche : propriétés combinatoires et applications." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 10.R3 (1976): 35-50. <http://eudml.org/doc/92037>.

@article{Françon1976,
author = {Françon, Jean},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
language = {fre},
number = {R3},
pages = {35-50},
publisher = {EDP-Sciences},
title = {Arbres binaires de recherche : propriétés combinatoires et applications},
url = {http://eudml.org/doc/92037},
volume = {10},
year = {1976},
}

TY - JOUR
AU - Françon, Jean
TI - Arbres binaires de recherche : propriétés combinatoires et applications
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1976
PB - EDP-Sciences
VL - 10
IS - R3
SP - 35
EP - 50
LA - fre
UR - http://eudml.org/doc/92037
ER -

References

top
  1. 1. D. ANDRÉ, Sur les permutations alternées, J. Math. Pures Appl., vol. 7, 1881 p. 167-184. Zbl13.0152.02JFM13.0152.02
  2. 2. W. H. BURGE, An Analysis of a Tree Sorting Method and Some Properties of a Set of Trees, First U.S.A.-Japan Computer Conference, 1972. 
  3. 3. L. COMTET, Analyse Combinatoire, Paris, P.U.F., 1970. Zbl0221.05002
  4. 4. D. FOATA, La série génératrice exponentielle dans les problèmes d'énumération Les Presses de l'Université de Montréal, Montréal, 1974. Zbl0325.05007MR505546
  5. 5. D. FOATA et M.-P. SCHÜTZENBERGER, Polynômes de Kempner (à paraître). 
  6. 6. D. FOATA et M.-P. SCHÜTZENBERGER, Théorie des polynômes eulérien. Lectures Notes in Math., n° 138, Berlin, Springer-Verlag, 1970. Zbl0214.26202MR272642
  7. 7. D. FOATA et V. STREHL, Euler Numbers and Variations of Permutations, Atti del Colloquio sulle teorie combinatorie, Roma, Accademia dei Lincei, septembre 1973 (à paraître). Zbl0361.05010MR434831
  8. 8. J. FRANÇON, Séminaires de l'I.R.I.A. (Institut de Recherches en Informatique et Automatique, Rocquencourt, France), 1974. 
  9. 9. D. E. KNUTH, The Art of Computer Programming, vol. 1, Reading, Massachusetts Addison-Wesley, 1969. Zbl0191.18001MR378456
  10. 10. D. E. KNUTH, The Art of Computer Programming, vol.3, Reading, Massachusetts Addison-Wesley, 1973. Zbl0302.68010MR445948
  11. 11. W. C. LYNCH, More Combinatorial Properties of Certain Trees, Computer J., vol. 7, 1965, p. 299-302. Zbl0136.38801MR172492
  12. 12. E. M. PALMER, M. A. RAHIMI et R. W. ROBINSON, Efficiency of a Binary Comparison Storage Technique, Journal of the A.C.M., vol. 21, 1974, p. 376-384. Zbl0282.68008MR462034
  13. 13. A. RÉNYI et G. SZEKERES, On the Height of Trees, J. Austral. Math. Soc., vol. 7, 1967 p. 497-507. Zbl0153.25802MR219440
  14. 14. J. RIORDAN, The Enumeration of Trees by Height and Diameter, I.B.M. J. Research and Development, vol. 4, 1960, p. 473-478. Zbl0097.25201MR140434
  15. 15. L. J. GUIBAS, A Principle of Independence for Binary Search Trees, Acta Informatica, vol. 4, 1975, p. 293-298. Zbl0321.68030MR391579

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.