EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 10 / No R3 (1976) R.A.I.R.O. Informatique théorique, 10 R3 (1976) 35-50 References
Free Access
Issue
R.A.I.R.O. Informatique théorique
Volume 10, Number R3, 1976
Page(s) 35 - 50
DOI https://doi.org/10.1051/ita/197610R300351
Published online 01 February 2017
  1. 1. D. ANDRÉ, Sur les permutations alternées, J. Math. Pures Appl., vol. 7, 1881 p. 167-184. [EuDML: 233984] [Zbl: 13.0152.02] [JFM: 13.0152.02] [Google Scholar]
  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. [Google Scholar]
  3. 3. L. COMTET, Analyse Combinatoire, Paris, P.U.F., 1970. [Zbl: 0221.05002] [Google Scholar]
  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. [MR: 505546] [Zbl: 0325.05007] [Google Scholar]
  5. 5. D. FOATA et M.-P. SCHÜTZENBERGER, Polynômes de Kempner (à paraître). [Google Scholar]
  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. [MR: 272642] [Zbl: 0214.26202] [Google Scholar]
  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). [MR: 434831] [Zbl: 0361.05010] [Google Scholar]
  8. 8. J. FRANÇON, Séminaires de l'I.R.I.A. (Institut de Recherches en Informatique et Automatique, Rocquencourt, France), 1974. [Google Scholar]
  9. 9. D. E. KNUTH, The Art of Computer Programming, vol. 1, Reading, Massachusetts Addison-Wesley, 1969. [Zbl: 0191.18001] [MR: 378456] [Google Scholar]
  10. 10. D. E. KNUTH, The Art of Computer Programming, vol.3, Reading, Massachusetts Addison-Wesley, 1973. [Zbl: 0302.68010] [MR: 445948] [Google Scholar]
  11. 11. W. C. LYNCH, More Combinatorial Properties of Certain Trees, Computer J., vol. 7, 1965, p. 299-302. [MR: 172492] [Zbl: 0136.38801] [Google Scholar]
  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. [MR: 462034] [Zbl: 0282.68008] [Google Scholar]
  13. 13. A. RÉNYI et G. SZEKERES, On the Height of Trees, J. Austral. Math. Soc., vol. 7, 1967 p. 497-507. [MR: 219440] [Zbl: 0153.25802] [Google Scholar]
  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. [MR: 140434] [Zbl: 0097.25201] [Google Scholar]
  15. 15. L. J. GUIBAS, A Principle of Independence for Binary Search Trees, Acta Informatica, vol. 4, 1975, p. 293-298. [MR: 391579] [Zbl: 0321.68030] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.