Abstract
We discuss the use of tree-structures for finding efficient solutions for the well-known dictionary problem and generalizations thereof. In doing so, we present a number of known techniques together with recent developments. In particular, we mention recent results concerning trees of very small height suitable for implementing dictionaries, results concerning the non-uniform dictionary problem and new results on one-sided AVL trees.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Adelson-Velskii, G.M., Landis, E.M., An algorithm for the organization of information (Russian), Doklady Akad. Nauk, SSSR 146 (1962) 263–266.
Aho, A.V., Hopcroft, J.E., Ullman, J.D., The design and analysis of computer algorithms, Addison-Wesley, Reading (1974)
Baer, J.L., Weight-balanced trees, AFIPS-Proceedings, vol. 44 (1975) 467–472.
Bayer, R., McCreight, E., Organization and Maintenance of Large Ordered Indexes. Acta Informatica 1 (1972) 173–189.
Bayer, R., Symmetric B-trees, Acta Informatica 1 (1972) 290–306.
Hirschberg, D.S., An insertion technique for one-sided height-balanced trees. Comm. ACM 19, 8 (Aug. 1976) 471–473.
Hu, T.C., Tucker, A.C., Optimum binary search trees. SIAM J. Appl. Math., 21:4 (1971) 514–532.
Knuth, D.E., The art of computer programming, I, III. Addison-Wesley (1967 and 1973).
Maurer, H.A., Datenstrukturen und Programmierverfahren. Teubner, Stuttgart (1974).
Maurer, H.A., Data structures and programming techniques. Prentice-Hall, Englewood Cliffs (1977).
Maurer, H.A., Wood, D., Zur Manipulation von Zahlenmengen. Angewandte Informatik 4 (1976) 143–149.
Maurer, H.A., Ottmann, Th., Six, H.-W., Implementing dictionaries using binary trees of very small height. Information Processing Letters 5 (1976) 11–14.
Maurer, H.A., Ottmann, Th., Six, H.-W., Manipulation of number sets using balanced trees. Applied Computer Science, vol. 4 Carl Hanser, München (1976) 9–37.
Mehlhorn, K., Nearly optimal binary search trees. Acta Informatica 5 (1975) 287–295.
Mehlhorn, K., Dynamic binary search trees. Fourth international Colloquium on Automata, Languages and Programming, Turku (1977).
Nievergelt, J., Reingold, E.M., Binary trees of bounded balance. SIAM Journal of Computing 2 (1973) 33–43.
Ottmann, Th., Six, H.-W., Eine neue Klasse von ausgeglichenen Binärbäumen. Angewandte Informatik 8 (1976) 395–400.
Ottmann, Th., Six, H.-W., Wood, D., Right-brother-trees. Report 60 Institut fuer Angewandte Informatik und Formale Beschreibungsverfahren, Universitaet Karlsruhe, 75 Karlsruhe, W-Germany.
Ottmann, Th., Wood, D., Deletion in onse-sided height balanced search trees. Report: McMaster University, Hamilton, Department of Mathematics, Hamilton, Ontario, Canada (1977).
Ottmann, Th., Six, H.-W., Wood, D., On the correspondence between AVL trees and brother trees. Report 61 Institut fuer Ángewandte Informatik und Formale Beschreibungsverfahren, Universitaet Karlsruhe, 75 Karlsruhe, W-Germany (1977).
van Leeuwen, J., The complexity of data organization. Mathematical Centre Tracts 81 (1976) 37–147.
Wirth, N., Algorithmen und Datenstrukturen, Teubner, 70 Stuttgart, W-Germany (1975).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maurer, H.A., Ottmann, T. (1977). Tree-structures for set manipulation problems. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_131
Download citation
DOI: https://doi.org/10.1007/3-540-08353-7_131
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08353-5
Online ISBN: 978-3-540-37285-1
eBook Packages: Springer Book Archive