✦ LIBER ✦

Parallel Construction of (a, b)-Trees

✍ Scribed by N. Deo; A. Jain; M. Medidi

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 518 KB
Volume: 23
Category: Article
ISSN: 0743-7315
DOI: 10.1006/jpdc.1994.1154

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cost-optimal parallel algorithms for con

Cost-optimal parallel algorithms for constructing B-trees

✍ Wang Biing-Feng; Chen Gen-Huey 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 884 KB

Optimal Parallel Suffix Tree Constructio

Optimal Parallel Suffix Tree Construction

✍ Ramesh Hariharan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 656 KB

An O(m)-work, O(m)-space, O(log 4 m)-time CREW-PRAM algorithm for constructing the suffix tree of a string s of length m drawn from any fixed alphabet set is obtained. This is the first known work and space optimal parallel algorithm for this problem. It can be generalized to a string s drawn from a

A Unified Approach to the Parallel Const

A Unified Approach to the Parallel Construction of Search Trees

✍ S.K. Das; K.B. Min 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 642 KB

A parallel algorithm for constructing mi

A parallel algorithm for constructing minimum spanning trees

✍ Jon Louis Bentley 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 521 KB

Computer trees: a concept for parallel p

Computer trees: a concept for parallel processing

✍ B. Buchberger; J. Fegerl; F. Lichtenberger 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 442 KB

Parallel Shortcutting of Rooted Trees

✍ Mikkel Thorup 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 305 KB

First it is shown that for any rooted tree T with n vertices, and parameter m G n, there is a ''shortcutting'' set S of at most m arcs from the transitive closure Ž . T\* of T such for any ¨, w g T \*, there is a dipath in T j S from ¨to w of length Ž Ž .. Ž O ␣ m, n . An equivalent result has been