✦ LIBER ✦

A Best Possible Bound for The Weighted Path Length of Binary Search Trees

✍ Scribed by Mehlhorn, Kurt

Book ID: 118170117
Publisher: Society for Industrial and Applied Mathematics
Year: 1977
Tongue: English
Weight: 366 KB
Volume: 6
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0206017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds on the weighted path length of bi

Bounds on the weighted path length of binary trees

✍ J. Nievergelt; J. Pradels; C.K. Wong; P.C. Yue 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 708 KB

ISA [k] trees: A class of binary search

ISA [k] trees: A class of binary search trees with minimal or near minimal internal path length

✍ Faris N. Abuali; Roger L. Wainwright 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 786 KB

The analysis of a fringe heuristic for b

The analysis of a fringe heuristic for binary search trees

✍ Patricio V Poblete; J.Ian Munro 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 569 KB

Efficient Parallel Algorithms for Optima

Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network

✍ Biing-Feng Wang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 128 KB

In this paper, we propose efficient parallel algorithms on the EREW PRAM for optimally locating in a tree network a path-shaped facility and a tree-shaped facility of a specified length. Edges in the tree network have arbitrary positive lengths. Two optimization criteria are considered: minimum ecce

A bound on the length of a random deriva

A bound on the length of a random derivation-search tree in general multi-premise calculi

✍ Yu. N. Kur'erov 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 408 KB

A probabilistic approach for reducing th

A probabilistic approach for reducing the search cost in binary decision trees

✍ Rontogiannis, A.; Dimopoulos, N.J. 📂 Article 📅 1995 🏛 Institute of Electrical and Electronics Engineers ⚖ 764 KB