✦ LIBER ✦

The estimated cost of a search tree on binary words

✍ Scribed by Fedotov, A.; Ryabko, B.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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 probabilistic approach for reducing th

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

On the max-entropy rule for a binary sea

✍ Yasuichi Horibe; Tibor O. H. Nemetz 📂 Article 📅 1979 🏛 Springer-Verlag 🌐 English ⚖ 427 KB