✦ LIBER ✦

The binary identification problem for weighted trees

✍ Scribed by Cicalese, Ferdinando; Jacobs, Tobias; Laber, Eduardo; Valentim, Caio

Book ID: 119375347
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 323 KB
Volume: 459
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.06.023

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Weighted Binary Trees for Concurrent Sea

Weighted Binary Trees for Concurrent Searching

✍ David Cohen; Michael L. Fredman 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 225 KB

A traditional cost measure for binary search trees is given by weighted path length, which measures the expected cost of a single random search. In this paper, we investigate a generalization, the k-cost, which is suitable for applications involving independent parallel processors each utilizing a c

The M-Matrix Group Generalized Inverse P

The M-Matrix Group Generalized Inverse Problem for Weighted Trees

✍ Kirkland, Stephen J.; Neumann, Michael 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 221 KB

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

The best choice problem for posets; colo

The best choice problem for posets; colored complete binary trees

✍ Kaźmierczak, Wojciech 📂 Article 📅 2014 🏛 Springer US 🌐 English ⚖ 379 KB

A Best Possible Bound for The Weighted P

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

✍ Mehlhorn, Kurt 📂 Article 📅 1977 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 366 KB

New algorithms for the LCA problem and t

New algorithms for the LCA problem and the binary tree reconstruction problem

✍ Zhaofang Wen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 580 KB