Parallelized Huffman and Hu-Tucker searching

DOI10.1109/18.312175MaRDI QIDQ4308786zbMATH OpenOpenAlexFDO

Authors Julia Abrahams

Publication date 18 April 1995

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.312175

zbMATH Keywords

parallel algorithmforestHuffman algorithmHu-Tucker algorithm

Mathematics Subject Classification ID

Trees (05C05) Searching and sorting (68P10) Source coding (94A29) Distributed algorithms (68W15)

Cited in

(5)

• Parallel algorithms for Burrows-Wheeler compression and decompression
• A space-efficient Huffman decoding algorithm and its parallelism
• Optimal binary search trees
• Operations research applications of dichotomous search
• Constructing Huffman Trees in Parallel

This page was built for publication: Parallelized Huffman and Hu-Tucker searching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4308786)