EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 19 / No 2 (1985) RAIRO. Inform. théor., 19 2 (1985) 179-195 References
Free Access
Issue
RAIRO. Inform. théor.
Volume 19, Number 2, 1985
Page(s) 179 - 195
DOI https://doi.org/10.1051/ita/1985190201791
Published online 01 February 2017
  1. [AHU 74] A. V. AHO, J. E. HOPCROFT et J. D. ULLMAN, The Design and Analysis of Algorithms, Addison-Wesley, Reading, Mass, 1974. [Zbl: 0326.68005] [Google Scholar]
  2. [COM 70] L. COMTET, Analyse combinatoire, vol. 1, 2, Presses Universitaires de France, Paris, 1970. [MR: 262087] [Zbl: 0221.05002] [Google Scholar]
  3. [FLA 79] P. FLAJOLET, Analyse d'algorithmes de manipulation d'arbres et de fichiers, Thèse, Université de Paris-Sud, Paris, 1979. [Google Scholar]
  4. [FRA 79] J. FRANÇON, Combinatoire des structures de données, Thèse, Faculté des Sciences de Strasbourg, 1979. [Google Scholar]
  5. [FVV 78] J. FRANÇON, G. VIENNOT et J. VUILLEMIN, Description and Analysis of an Efficient Priority Queue Representation, Proc. of 19th I.E.E.E. Symp. on Found. of Comp. Sc., 1979. [MR: 539825] [Google Scholar]
  6. [HV 78] E. HOROWITZ et S. SAHNI, Fundamentals of Computer Algorithms, Computer Science Press, Potomac, Maryland, 1978. [MR: 603626] [Zbl: 0442.68022] [Google Scholar]
  7. [KNO 77] G. D. KNOTT, A Numbering System for Binary Trees, Comm. of A.C.M., vol. 20, n° 2, 1977, p. 113-115. [Zbl: 0345.68025] [Google Scholar]
  8. [LIU 80] C. L. LIU, Generation of k-ary trees in Actes du 5e coll. de Lille sur les Arbres en Algèbre et en Programmation, Lille, 1980, p. 45-53; également Rapport n° 27, I.N.R.I.A., Rocquencourt, 1980. [MR: 620174] [Zbl: 0461.05020] [Google Scholar]
  9. [PRO 80] A. PROSKUROWSKI, On the Generation of Binary Trees, J. A.C.M., vol. 27, n° 1, 1980, p. 1-2. [MR: 554275] [Google Scholar]
  10. [REM 80] J. L. RÉMY, Construction, évaluation et amélioration systématiques de structures de données, R.A.I.R.O. Informatique théorique, vol. 14, n° 1, 1980, p. 83-118. [EuDML: 92119] [Zbl: 0434.68050] [Google Scholar]
  11. [REM 80 b] J. L. RÉMY, Un procédé itératif de dénombrement d'arbres binaires et son application à leur génération aléatoire, Actes des 3es Journées de la RCP Complexité, Nice 1980et Rapport 80-P-053, C.R.I.N. 1980. [Google Scholar]
  12. [ROT 75] D. ROTEM, On a Correspondence between Binary Trees and a Certain Type of Permutation, Information Processing Letters, vol. 4, n° 1, 1975, p. 58-61. [MR: 388841] [Zbl: 0323.05006] [Google Scholar]
  13. [RV 78] D. ROTEM et Y. L. VAROL, Generation of Binary Trees from Ballot Sequences, J. A.C.M., vol. 25, n° 3, 1978, p. 396-404. [MR: 495167] [Zbl: 0379.68029] [Google Scholar]
  14. [SF 80] M. SOLOMON et R. A. FINKEL, A Note on Enumerating Binary Trees, J. A.C.M., vol. 27, n° 1, 1980, p. 3-5. [MR: 554276] [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.