✦ LIBER ✦

The cost of offline binary search tree algorithms and the complexity of the request sequence

✍ Scribed by Jussi Kujala; Tapio Elomaa

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The estimated cost of a search tree on b

✍ Fedotov, A.; Ryabko, B. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 112 KB

Algorithms and time complexity of the re

✍ Chunmei Liu; Legand Burge; Ajoni Blake 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 461 KB

On the costs of optimal and near-optimal

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

New lower bounds on the cost of binary s

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

Least upper bound on the cost of optimum

✍ T. C. Hu; K. C. Tan 📂 Article 📅 1972 🏛 Springer-Verlag 🌐 English ⚖ 201 KB

Analysis of the standard deletion algori

✍ Joseph Culberson; J. Ian Munro 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 868 KB