A space-efficient Huffman decoding algorithm and its parallelism (Q1583590): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Parallelism in random access machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Memory efficient and high-speed search Huffman coding / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Method for the Construction of Minimum-Redundancy Codes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4004140 / rank | |||
Normal rank | |||
Latest revision as of 16:55, 30 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A space-efficient Huffman decoding algorithm and its parallelism |
scientific article |
Statements
A space-efficient Huffman decoding algorithm and its parallelism (English)
0 references
31 October 2000
0 references
CREW PRAM
0 references
Huffman tree
0 references
