Free Access
RAIRO. Inform. théor.
Volume 15, Number 3, 1981
Page(s) 183 - 211
Published online 01 February 2017
  1. AHO, HOPCROFT and ULLMAN, The Design andAnalysis of Computer Algorithms, Addison Wesley, 1974. [Zbl: 0326.68005] [Google Scholar]
  2. B. ALLAN and I. MUNRO, Self-Organizing Binary Search Tress, J. Assoc. Comput. Mach., Vol. 25, 1978, pp. 526-535. [MR: 508699] [Zbl: 0388.68060] [Google Scholar]
  3. J. L. BAER, Weight-Balanced Trees, Proc. A.F.I.P.S., Vol. 44, 1975, pp. 467-472. [Google Scholar]
  4. N. BLUM and K. MEHLHORN, On the Average Number of Balancing Operations in Weight-Balanced Trees, Theoretical Computer Science II, 1980, pp. 303-320. [MR: 578600] [Zbl: 0435.68051] [Google Scholar]
  5. K. MEHLHORN, [79], Dynamic Binary Search, S.I.A.M. J. Comput., Vol. 8, No. 2, 1979. pp. 175-198. [MR: 529588] [Zbl: 0408.68056] [Google Scholar]
  6. K. Mehlhorn, Effiziente Algorithmen, Teubner Verlag, Studienücher Informatik, 1977. [MR: 495158] [Zbl: 0357.68041] [Google Scholar]
  7. J. NIEVERGELT and E. M. REINGOLD, Binary Search Trees of Bounded Balance, S.I.A.M. J. Comput., Vol. 2, No. 1, March 1973, pp. 33-43. [MR: 331903] [Zbl: 0262.68012] [Google Scholar]
  8. K. UNTERAUER, Optimierung gewichtetet Binärbäume zur Organisation geordneter dynamischer Dateien, Doktorarbeit, TU München, 1977. [Google Scholar]
  9. K. UNTERAUER, Dynamic weighted Binary Search Trees, Acta Informatica, 1979, pp. 341-362. [MR: 533481] [Zbl: 0396.68042] [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.