Free Access
Issue
RAIRO. Inform. théor.
Volume 19, Number 2, 1985
Page(s) 137 - 164
DOI https://doi.org/10.1051/ita/1985190201371
Published online 01 February 2017
  1. W. F. BEAUSOLEIL, D. T. BROWN and B. E. PHELPS, Magnetic Bubble Memory Organization, IBM Journal of Research and Development, vol. 16, 1972, pp. 587-591.
  2. G. BONGIOVANNI and C. K. WONG, Tree Search in Major/Minor Loop Magnetic Bubble Memories IEEE Transactions on Computers, C-30, 1981, pp. 537-545. [MR: 635988] [Zbl: 0461.68067]
  3. P. I. BONYHARD and T. J. NELSON, Dynamic Data Reallocation in Bubble Memories, The Bell System Technical Journal, Vol. 52, 1973, pp. 307-317.
  4. A. K. CHANDRA and C. K. WONG, The Movement and Permutation of Columns in Magnetic Bubble Lattice Files, IEEE Transactions on Computers, C-27, 1979, pp. 8-15. [Zbl: 0388.68023]
  5. K. M. CHUNG, F. LUCCIO and C. K. WONG, A Tree Storage Scheme for Magnetic Bubble Memories, IEEE Transactions on Computers, C-29, 1980, pp. 553-562. [MR: 581617]
  6. K. M. CHUNG, F. LUCCIO and C. K. WONG, A New Permutation Algorithm for Bubble Memories, Information Processing Letters, Vol. 10, 1980. pp. 226-230. [MR: 585388] [Zbl: 0443.68050]
  7. R. E. FAIRLEY, Random Entry Searching of Binary Trees, University of Colorado, Boulder, Computer Science Report CU-CS-035-73, 1973.
  8. P. FLAJOLET, Analyse d'Algorithms de Manipulation d'Arbres et de Fichiers, Cahiers du B.U.R.O., Nos. 34-35, Paris, 1981. [EuDML: 272546]
  9. P. FLAJOLET and A. ODLYZKO, The Average Height of Binary Trees and Other Simple Trees, Journal of Computer and System Sciences, Vol. 25, 1982, pp. 171-213. [MR: 680517] [Zbl: 0499.68027]
  10. J. FRANCON, Combinatoire des Structures de Données, Doctoral dissertation, Université de Strasbourg, 1979.
  11. D. E. KNUTH, The Art of Computer Programming, Vol. I: Fundamental Algorithms, Addison-Wesley Publishing Co., Reading, Mass., 1968. [Zbl: 0191.17903] [MR: 378456]
  12. J. MÜHLBACHER, Private communication, 1982.
  13. A. L. ROSENBERG, Data Encoding and Their Costs, Acta Informatica, Vol. 9, 1978, pp. 273-292. [MR: 502168] [Zbl: 0434.68048]
  14. A. L. ROSENBERG and L. SNYDER, Bounds on the Costs of Data Encodings, Mathematical Systems Theory, Vol. 12, 1978, pp. 9-39. [MR: 510619] [Zbl: 0403.68018]
  15. T. A. STANDISH, Data Structure Techniques, Addison-Wesley Publishing Co., Reading, Mass., 1980.
  16. V. K. VAISHNAVI and D. WOOD, Encoding Search Trees in Lists, International Journal of Computer Mathematics, Vol. 10, 1982, pp. 237-246. [MR: 647042] [Zbl: 0481.68030]
  17. J. VUILLEMIN, A Unifying Look at Data Structures, Communications of the ACM, 28, 1980, pp. 229-239. [MR: 567151] [Zbl: 0434.68047]
  18. C. K. WONG, Algorithmic Studies in Mass Storage Systems, Springer-Verlag, Berlin, Heidelberg; New York, 1983. [MR: 708721] [Zbl: 0537.68102]

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.