Worst-case optimal insertion and deletion methods for decomposable searching problems. (English) Zbl 0459.68026


68P10 Searching and sorting
Full Text: DOI Link


[1] Bentley, J.L., Decomposable searching problems, Information processing lett., 8, 5, 244-251, (1979) · Zbl 0404.68067
[2] Kirkpatrick, D.G., Optimal search in planar subdivisions, (1979), Dept. of Computer Science, UBC Vancouver, Canada, preprint
[3] Lueker, G.S., A transformation for adding range restriction capability to dynamic data structures for decomposable searching problems, ()
[4] Maurer, H.A.; Ottman, Th., Dynamic solutions of decomposable searching problems, Bericht 33, (1979), Inst. für Informationsverarbeit TU Graz
[5] Mehlhorn, K., Lowerbounds on the efficiency of static to dynamic transformations of data structures, ()
[6] Mehlhorn, K.; Overmars, M.H., Optimal dynamization of decomposable searching problems, Information processing lett., 12, 2, 93-98, (1981) · Zbl 0463.68056
[7] Overmars, M.H., Dynamization of order decomposable set problems, (), (To appear in J. Algorithms.) · Zbl 0474.68083
[8] Overmars, M.H., Transforming semi-dynamic data structures into dynamic structures, (1981), (in preparation) · Zbl 0543.68046
[9] Overmars, M.H.; van Leeuwen, J., Two general methods for dynamizing decomposable searching problems, Computing, 26, 155-166, (1981) · Zbl 0454.68060
[10] Overmars, M.H.; van Leeuwen, J., Dynamizations of decomposable searching problems yielding good worst-case bounds, (), 224-233
[11] Saxe, J.B.; Bentley, J.L., Transforming static data structures to dynamic structures, Proc. 20th annual IEEE symposium on foundations of computer science, 148-168, (1979)
[12] Shamos, M.I., Computational geometry, (), (to be published) · Zbl 0759.68037
[13] van Leeuwen, J.; Maurer, H.A., Dynamic systems of static data structures, Bericht 42, (1980), Inst. für Informationsverarbeit TU Graz
[14] van Leeuwen, J.; Wood, D., Dynamization of decomposable searching problems, Information processing lett., 10, 2, 51-56, (1980)
[15] Willard, D.E., The super B-tree algorithm, (1979), Aiken Computer Laboratory, Harvard University Cambridge, U.S.A, TR-03-79
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.