Dynamic weighted binary search trees-Reference-Cited by-同舟云学术

Dynamic weighted binary search trees

Published:1979 Issue:4 Volume:11 Page:341-362
ISSN:0001-5903
Container-title:Acta Informatica
language:en
Short-container-title:Acta Informatica

Author:

Unterauer Karl

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Information Systems,Software

Link

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

Reference15 articles.

1. Adelson-Velskii, G.M., Landis, E.M.: An Algorithm for the Organization of Information. Doklady Akademii Nauk USSR, Moscow, Vol. 16, No. 2, 1962, pp. 263?266; english translation in Soviet Mathematics, Vol. 3, 1259?1263 (1962)

2. Baer, J.-L.: Weight-balanced trees. Proc. AFIPS, Vol. 44, 467?472 (1975)

3. Bayer, P.J.: Improved Bounds on the Costs of Optimal and Balanced Binary Search Trees. M. Sc. thesis, MIT, 1975

4. Bayer, R.: Symmetric binary B-trees: data structure and maintenance algorithms. Acta Informat. 1, 290?306 (1972)

5. Foster, C.C.: Information storage and retrieval using AVL-trees. Proceedings of the 20th National ACM Conference at Cleveland, 1965, pp. 192?205

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

1. A STATIC OPTIMALITY TRANSFORMATION WITH APPLICATIONS TO PLANAR POINT LOCATION;International Journal of Computational Geometry & Applications;2012-08

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

3. A compendium of key search references;ACM SIGIR Forum;1990-11

4. Data Structures;Algorithms and Complexity;1990

5. A subquadratic algorithm for constructing approximately optimal binary search trees;Journal of Algorithms;1987-12