✦ LIBER ✦

The optimal binary search tree for Andersson's search algorithm

✍ Scribed by David Spuler

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A subquadratic algorithm for constructin

✍ Lawrence L Larmore 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 732 KB

On the costs of optimal and near-optimal

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

Optimal binary search trees with costs d

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

A tree search algorithm for the crew sch

✍ J.E. Beasley; B. Cao 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 871 KB

A tree search algorithm for the p-median

✍ N. Christofides; J.E. Beasley 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 659 KB

The B∗ tree search algorithm—New results

✍ Andrew J. Palay 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 903 KB