Approximating Huffman codes in parallel (Q2466011): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2006.10.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038490901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved deterministic parallel integer sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards optimal parallel bucket sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybridsort revisited and parallelized / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel construction of binary trees with near optimal weighted path length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Huffman Trees in Parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3786400 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism in Comparison Problems / rank
 
Normal rank

Revision as of 14:03, 27 June 2024

scientific article
Language Label Description Also known as
English
Approximating Huffman codes in parallel
scientific article

    Statements

    Identifiers