✦ LIBER ✦

Cost-optimal parallel algorithms for constructing B-trees

✍ Scribed by Wang Biing-Feng; Chen Gen-Huey

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 884 KB
Volume: 81
Category: Article
ISSN: 0020-0255
DOI: 10.1016/0020-0255(94)90089-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 parallel algorithm for constructing mi

A parallel algorithm for constructing minimum spanning trees

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

Parallel Construction of (a, b)-Trees

✍ N. Deo; A. Jain; M. Medidi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 518 KB

Exact algorithms for minimum routing cos

Exact algorithms for minimum routing cost trees

✍ Matteo Fischetti; Giuseppe Lancia; Paolo Serafini 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 260 KB

Parallel algorithms for tree traversals

✍ N.C. Kalra; P.C.P. Bhatt 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 382 KB

A subquadratic algorithm for constructin

A subquadratic algorithm for constructing approximately optimal binary search trees

✍ Lawrence L Larmore 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 732 KB