✦ LIBER ✦

Some average measures in m-ary search trees

✍ Scribed by Ricardo A. Baeza-Yates

Book ID: 113163140
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 318 KB
Volume: 25
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(87)90215-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the average internal path length ofm-

On the average internal path length ofm-ary search trees

✍ Hosam M. Mahmoud 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 265 KB

Self-Adjusting k-ary Search Trees

✍ M. Sherk 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 994 KB

We present an online self-adjusting \(k\)-ary search tree, the \(k\)-splay tree, as a generalization of the binary splay tree. We prove a \(k\)-ary analogue of Sleator and Tarjan's splay tree access lemma using a considerably more complicated argument based on their technique. This lemma is used to

Some average performance measures for th

Some average performance measures for theB-tree

✍ William E. Wright 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 549 KB

Agent search in uniform b-ary trees: Mul

Agent search in uniform b-ary trees: Multiple goals and unequal costs

✍ Pallab Dasgupta; P.P. Chakrabarti; S.C. DeSarkar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 570 KB

The Random Multisection Problem, Travell

The Random Multisection Problem, Travelling Waves and the Distribution of the Height of m-Ary Search Trees

✍ Brigitte Chauvin; Michael Drmota 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 268 KB

Average case analysis of region search i

Average case analysis of region search in balanced k-d trees

✍ Y.V. Silva-Filho 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 564 KB