zbMATH — the first resource for mathematics

A new data structure for representing sorted lists. (English) Zbl 0481.68061

68P10 Searching and sorting
68P05 Data structures
Full Text: DOI
[1] Bayer, R.: Symmetric Binary B-trees: Data structures and maintenance algorithms. Acta Informat. 1, 290-306 (1972) · Zbl 0233.68009
[2] Bayer, R., McCreight, E.: Organization and maintenance of large ordered indizes. Acta Informat. 1, 173-189 (1972) · Zbl 0226.68008
[3] Bayer, R., Schkolnik, M.: Concurrency of operations on B-trees. Acta Informat. 9, 1-21 (1977) · Zbl 0357.68029
[4] Blum, N., Mehlhorn, K.: On the average number of rebalancing steps in weight-balanced trees. Theor. Comput. Sci. 11, 303-320 (1980) · Zbl 0435.68051
[5] Brown, M.R., Tarjan, R.E.: Design and analysis of a data structure for representing sorted lists. SIAM J. Comput. 9, 594-614 (1980) · Zbl 0446.68047
[6] Guibas, L.J., Sedgewick, R.: A dichromatic framework for balanced trees. Proc. 19th Annual Symposium on Foundations of Computer Science. Ann Arbor: IEEE Computer Socienty, pp. 8-21 (1978)
[7] Guibas, L., McCreight, E., Plass, M, Roberts, J.: A new representation for linear lists. 9th ACM Symposium on Theory of Computing Boulder, pp. 49-60 (1977)
[8] Huddleston, S.: Robust balancing in B-trees. PhD Dissertation, Computer Science Department, University of Washington, Seattle, 1981 · Zbl 0457.68075
[9] Huddleston, S., Mehlhorn, K.: Robust balancing in B-trees. 5th GI-Conference on Theoretical Informatics 1981, Karlsruhe, LNCS 104, 234-244 (1981) · Zbl 0457.68075
[10] Maier, D., Salveter, S.C.: Hysterical B-trees. Technical Report 79/007, Dept. of Computer Science, State University of New York at Stony Brook, November 1979
[11] Mehlhorn, K.: Effiziente Algorithmen. Teubner-Verlag, Studienb├╝cher Informatik 1977
[12] Mehlhorn, K.: Sorting presorted files. 4th GI-Conference on Theoretical Computer Science 1979, Aachen, Lecture Notes in Computer Science Vol. 67, pp. 199-212. Berlin-Heidelberg-New York: Springer 1979
[13] Mehlhorn, K.: Searching, sorting and information theory. MFCS 79, Lecture Notes in Computer Science Vol. 74, pp. 131-145. Berlin-Heidelberg-New York: Springer 1981
[14] Willard, D.E.: The super-B-tree algorithm. Harvard Aiken Computation Laboratory Report 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.