Improving time and space efficiency in generalized binary search trees-Reference-Cited by-同舟云学术

Improving time and space efficiency in generalized binary search trees

Published:1987-09 Issue:5 Volume:24 Page:583-594
ISSN:0001-5903
Container-title:Acta Informatica
language:en
Short-container-title:Acta Informatica

Author:

Cunto Walter,Gascon Jose Luis

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00263296.pdf

Reference15 articles.

1. Adel'son-Vel'skii, G.M., Landins, E.M.: An Algorithm for the Organization of Information. Doklady Akademia Nauk USSR 146, 263–266 (1962)

2. Bell, C.J.: An Investigation into the Principles of the Classification and Analysis on an Automatic Digital Computer. Doctoral Thesis, Leeds University 1965

3. Bentley, J.L.: Multidimensional Binary Search Trees Use for Associative Searching. Commun ACM 18, 509–517 (1975)

4. Cunto, W., Lau, G.: Generalised Multidimensional Trees. TECH-REP CSC 87-02 Centro Cientifico IBM de Venezuela

5. Eisenbarth, B., Ziviani, N., Gonnet, G.H., Melhorn, K., Wood, D.: The Theory of Fringe Analysis and its Application to 2–3 Trees and B-trees. Inf. Control 55, 125–174 (1984)

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An asymptotic theory for Cauchy–Euler differential equations with applications to the analysis of algorithms;Journal of Algorithms;2002-07

2. Phase changes in randomm-ary search trees and generalized quicksort;Random Structures and Algorithms;2001

3. On rotations in fringe-balanced binary trees;Information Processing Letters;1998-01

4. Optimal binary search trees;Theoretical Computer Science;1997-11

5. Fringe analysis revisited;ACM Computing Surveys;1995-03