✦ LIBER ✦

Constructing Huffman Trees in Parallel

✍ Scribed by Larmore, Lawrence L.; Przytycka, Teresa M.

Book ID: 118178114
Publisher: Society for Industrial and Applied Mathematics
Year: 1995
Tongue: English
Weight: 858 KB
Volume: 24
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539792233245

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A parallel algorithm for constructing mi

A parallel algorithm for constructing minimum spanning trees

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

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

Cost-optimal parallel algorithms for con

Cost-optimal parallel algorithms for constructing 2–3 trees

✍ Bing-Feng Wang; Gen-Huey Chen 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 550 KB

Parallel Construction of (a, b)-Trees

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

Constructal tree-shaped parallel flow he

Constructal tree-shaped parallel flow heat exchangers

✍ V.D. Zimparov; A.K. da Silva; A. Bejan 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 490 KB