Free Access
| Issue |
RAIRO. Inform. théor.
Volume 16, Number 1, 1982
|
|
|---|---|---|
| Page(s) | 51 - 71 | |
| DOI | https://doi.org/10.1051/ita/1982160100511 | |
| Published online | 01 February 2017 | |
- 1. G. M. ADELSON-VELSKII and E. M. LANDIS, An Algorithm for the Organization of Information, Dokl. Akad. Nauk S.S.S.R., Vol. 146, 1962, pp. 263-266 (Russian). English translation in Soviet Math. Dokl., Vol. 3, 1962, pp. 1259-1263. [MR: 156719] [Google Scholar]
- 2. A. V. AHO, J. E. HOPCROFT and J. D. ULLMAN, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974. [MR: 413592] [Zbl: 0326.68005] [Google Scholar]
- 3. R. BAYER, Symmetric Binary B-trees Data Structure and Maintenance Algorithms, Acta Informatica, Vol. 1, 1972, pp. 290-306. [MR: 323192] [Zbl: 0233.68009] [Google Scholar]
- 4. N. BLUM and K. MEHLHORM, Mittlere Anzahl von Rebalancierungoperationen in Gewichtsbalancierten Bäumen, 4th GI Conference on Theoretical Computer Science, Aachen 1979, Lecture Notes in Computer Science, Vol. 67, pp. 67-78, Springer, Berlin, Heidelberg, New York. [MR: 568093] [Zbl: 0399.05022] [Google Scholar]
- 5. P. L. KARLTON, S. H. FULLER, R. E. SCROGGS and E. B. KAEHLER, Performance of Height-Balanced Trees, Com. A.C.M. 19, Vol. 1, 1976, pp. 23-28. [Zbl: 0317.68044] [Google Scholar]
- 6. D. E. KNUTH, The Art of Computer Programming, Vol. 1, Fundamental Algorithms, Addison-Wesley, Reading, Mass., 1968, 1973. [Zbl: 0191.17903] [MR: 378456] [Google Scholar]
- 7. D. E. KNUTH, The Art of Computer Programming, Vol. 3, Sorting and Searching, Addison-Wesley, Reading, Mass., 1973. [MR: 445948] [Zbl: 0302.68010] [Google Scholar]
- 8. J. NIEVERGELT and E. M. Reingold, Binary Search Trees of Bounded Balance, S.I.A.M. J. Comput., Vol. 2, 1973, pp. 33-43. [MR: 331903] [Zbl: 0262.68012] [Google Scholar]
- 9. H. J. OLIVIÉ, A New Class of Balanced Search Trees: Half-Balanced Binary Searc Trees, Technical Report 80-02, IHAM, Paardenmarkt 94, B-2000 Antwerp, Belgium, 1980. [Zbl: 0489.68056] [Google Scholar]
- 10. H. J. OLIVIÉ, A Study of Balanced Binary Trees and Balanced One-Two Trees, Ph. D. Thesis, Dept. of Mathematics, U.I.A., University of Antwerp, Belgium, 1980. [Zbl: 0422.68029] [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.