✦ LIBER ✦

Least upper bound on the cost of optimum binary search trees

✍ Scribed by T. C. Hu; K. C. Tan

Publisher: Springer-Verlag
Year: 1972
Tongue: English
Weight: 201 KB
Volume: 1
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00289510

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New lower bounds on the cost of binary s

New lower bounds on the cost of binary search trees

✍ Roberte De Prisco; Alfredo De Santis 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 674 KB

On the costs of optimal and near-optimal

On the costs of optimal and near-optimal binary search trees

✍ Brian Allen 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 347 KB

Optimal binary search trees with costs d

Optimal binary search trees with costs depending on the access paths

✍ Jayme L. Szwarcfiter; Gonzalo Navarro; Ricardo Baeza-Yates; Joı&#x0301;sa de 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 169 KB

An upper bound on the Ramsey number of t

An upper bound on the Ramsey number of trees

✍ András Gyárfás; Zsolt Tuza 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 66 KB

On the characterization of least upper b

On the characterization of least upper bound norms in matrix space

✍ Josef Stoer 📂 Article 📅 1964 🏛 Springer-Verlag 🌐 English ⚖ 473 KB

On the complexity of branch-and-bound se

On the complexity of branch-and-bound search for random trees

✍ Luc Devroye; Carlos Zamora-Cura 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 256 KB 👁 2 views

Let T be a b-ary tree of height n, which has independent, non-negative, n identically distributed random variables associated with each of its edges, a model previously considered by Karp, Pearl, McDiarmid, and Provan. The value of a node is the sum of all the edge values on its path to the root. Co