Parallel construction of binary trees with near optimal weighted path length

DOI10.1007/BF01941687zbMath0836.68053MaRDI QIDQ1907235

David G. Kirkpatrick, Teresa M. Przytycka

Publication date: 20 February 1996

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

binary treesCREW processor algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (2)

Parallel construction of binary trees with near optimal weighted path length ⋮ Approximating Huffman codes in parallel

Cites Work

• Unnamed Item
• Upper bounds for sorting integers on random access machines
• Routing, merging, and sorting on parallel models of computation
• Parallel construction of binary trees with near optimal weighted path length
• Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits
• Parallel Merge Sort
• Parallelism in Comparison Problems
• A Method for the Construction of Minimum-Redundancy Codes
• A New Proof of the T-C Algorithm

This page was built for publication: Parallel construction of binary trees with near optimal weighted path length