✦ LIBER ✦

Cost-optimal parallel algorithms for constructing 2–3 trees

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

Book ID: 108016306
Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 550 KB
Volume: 11
Category: Article
ISSN: 0743-7315
DOI: 10.1016/0743-7315(91)90050-j

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

An adaptive and cost-optimal parallel al

An adaptive and cost-optimal parallel algorithm for minimum spanning trees

✍ S. G. Akl 📂 Article 📅 1986 🏛 Springer Vienna 🌐 English ⚖ 388 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

Optimal parallel 3-coloring algorithm fo

Optimal parallel 3-coloring algorithm for rooted trees and its applications

✍ Peter Rajčáni 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 358 KB

A Nearly Optimal Parallel Algorithm for

A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs

✍ He, Xin; Yesha, Yaacov 📂 Article 📅 1988 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 715 KB

Fringe analysis of synchronized parallel

Fringe analysis of synchronized parallel insertion algorithms in 2–3 Trees

✍ R. Baeza-Yates; J. Gabarró; X. Messeguer 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 392 KB

Fringe analysis uses the distribution of bottom subtrees or fringe of search trees under the assumption of random insertion of keys, yielding an average case analysis of the fringe. The results in the fringe give upper and lower bounds for several measures for the whole tree. We are interested in t