Department of Computer Science
 
Chair V

 
University of Bonn -> Department of Computer Science -> Chair V
CS-Reports 2003 Copyright 2003 University of Bonn, Department of Computer Science, Abt. V
85246

04.02.2003

A Work-Efficient Algorithm for Constructing Huffman Codes
Marek Karpinski, Lawrence Larmore and Yakov Nekrich
[Download PostScript] [Download PDF]

We present an algorithm for parallel construction of Huffman codes in O(np-1/2log p) time with p processors, improving the previous result of Levcopoulos and Przytycka.

Last Change: 02/04/03 at 09:11:53
 Deutsch
University of Bonn -> Department of Computer Science -> Chair V