Abstract
A new data structure for the dictionary problem is presented. Updates are performed in Γ(log n) time in the worst case and the number of comparisons per operation is ⌈log n + 1 + ∈⌉, where ε is an arbitrary positive constant.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G. M. Adelson-Velski and E. M. Landis. An algorithm for the organization of information. Dokladi Akademia Nauk SSSR, 146(2), 162.
A. Andersson. Binary search trees of almost optimal height. tech. report, Department of Computer Science, Lund University, 1988.
R. Bayer. Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Informatica, 1(4), 1972.
H. A. Mauer, Th. Ottman, and H. W. Six. Implementing dictionaries using binary trees of very small height. Information Processing Letters, 5(1), 1976.
J. Nievergelt and E. M. Reingold. Binary trees of bounded balance. SIAM Journal on Computing, 2(1), 1973.
J. van Leeuwen and M. H. Overmars. Stratified balanced search trees. Acta Informatica, 18, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andersson, A. (1989). Optimal bounds on the dictionary problem. In: Djidjev, H. (eds) Optimal Algorithms. OA 1989. Lecture Notes in Computer Science, vol 401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51859-2_10
Download citation
DOI: https://doi.org/10.1007/3-540-51859-2_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51859-4
Online ISBN: 978-3-540-46831-8
eBook Packages: Springer Book Archive