✦ LIBER ✦

Optimum ordered bi-weighted binary trees

✍ Scribed by Man-tak Shing

Book ID: 113162574
Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 289 KB
Volume: 17
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(83)90071-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimum binary search trees

✍ Donald E. Knuth 📂 Article 📅 1972 🏛 Springer-Verlag 🌐 English ⚖ 39 KB

Optimum binary search trees

✍ D. E. Knuth 📂 Article 📅 1971 🏛 Springer-Verlag 🌐 English ⚖ 510 KB

Restructuring ordered binary trees

✍ William Evans; David Kirkpatrick 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 384 KB

Optimum domination in weighted trees

✍ K.S. Natarajan; Lee J. White 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 572 KB

Dynamic weighted binary search trees

✍ Karl Unterauer 📂 Article 📅 1979 🏛 Springer-Verlag 🌐 English ⚖ 673 KB

Weighted Binary Trees for Concurrent Sea

Weighted Binary Trees for Concurrent Searching

✍ David Cohen; Michael L. Fredman 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 225 KB

A traditional cost measure for binary search trees is given by weighted path length, which measures the expected cost of a single random search. In this paper, we investigate a generalization, the k-cost, which is suitable for applications involving independent parallel processors each utilizing a c