Mehlhorn, Kurt Lower bounds on the efficiency of transforming static data structures into dynamic structures. (English) Zbl 0482.68057 Math. Syst. Theory 15, 1-16 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 3 Documents MSC: 68P10 Searching and sorting 68Q25 Analysis of algorithms and problem complexity 68P05 Data structures Keywords:dynamization; decomposable searching problem; optimality Citations:Zbl 0463.68056 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Math. Syst. Theory 15, 1--16 (1981; Zbl 0482.68057) Full Text: DOI References: [1] J. L. Bentley, ”Decomposable Searching Problems,”Information Processing Letters 8 (5), 244–251 (1979). · Zbl 0404.68067 [2] K. Mehlhorn and M. H. Overmars, Optimal Dynamization of Decomposable Searching Problems, FB 10, Universität des Saarlandes, Techn. Report No. A 80/15, to appear in Information Processing Letters. · Zbl 0463.68056 [3] M. H. Overmars and v. Leeuwen, Two general methods for dynamizing decomposable searching problems, Techn. Report University of Utrecht, RUU-SC-79–10, Nov. 79. [4] J. L. Bentley and J. B. Saxe, Decomposable Searching Problems I. Static-to-Dynamic Transformation, Journal of Algorithms 1, 301–358 (1980). · Zbl 0461.68065 [5] J. van Leeuwen and D. Wood, Dynamization of Decomposable Searching Problems, Information Processing Letters 10, 51–56 (1980). [6] D. E. Willard, Balanced Forests ofk-d Trees as a Dynamic Data Structure, Harvard Aiken Computer Lab. Report, TR-23–78. 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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.