✦ LIBER ✦

Onk-Dimensional Balanced Binary Trees

✍ Scribed by Vijay K. Vaishnavi

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 510 KB
Volume: 52
Category: Article
ISSN: 0022-0000
DOI: 10.1006/jcss.1996.0025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On rotations in fringe-balanced binary t

On rotations in fringe-balanced binary trees

✍ Hosam M. Mahmoud 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 451 KB

We employ a P6lya urn to model rotations in a random fringe-balanced binary search tree. We show that asymptotically the number of rotations to construct a tree of size n has a normal distribution with mean +n and variance sn. Exact results for mean and variance are developed in the process. @ 1998

Interval Routing onk-Trees

✍ Lata Narayanan; Naomi Nishimura‡ 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 400 KB

Onk-ary spanning trees of tournaments

✍ Lu, Xiaoyun; Wang, Da-Wei; Chang, Gerard J.; Lin, In-Jen; Wong, C. K. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB

It is well known that every tournament contains a Hamiltonian path, which can be restated as that every tournament contains a unary spanning tree. The purpose of this article is to study the general problem of whether a tournament contains a k-ary spanning tree. In particular, we prove that, for any

General Balanced Trees

✍ Arne Andersson 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 117 KB

We show that, in order to achieve efficient maintenance of a balanced binary search tree, no shape restriction other than a logarithmic height is required. The obtained class of trees, general balanced trees, may be maintained at a logarithmic amortized cost with no balance information stored in the

Stratified balanced search trees

✍ Jan Leeuwen; Mark H. Overmars 📂 Article 📅 1983 🏛 Springer-Verlag 🌐 English ⚖ 731 KB

Embedding Large Complete Binary Trees in

Embedding Large Complete Binary Trees in Hypercubes with Load Balancing

✍ Kemal Efe 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 211 KB

In the next section we present basic definitions and notations where the criterion of optimality is defined and related to the concept of ''normal'' algorithms. In Section 3 we present an optimal embedding method that balances the processor loads. In Section 4 we present a nonoptimal embedding metho