暂无分享,去创建一个
[1] J. Ian Munro,et al. Sorting and Searching in Multisets , 1976, SIAM J. Comput..
[2] David A. Huffman,et al. A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.
[3] David G. Kirkpatrick,et al. The Ultimate Planar Convex Hull Algorithm? , 1986, SIAM J. Comput..
[4] Jan van Leeuwen,et al. On the Construction of Huffman Trees , 1976, ICALP.
[5] Michael Buro,et al. On the Maximum Length of Huffman Codes , 1993, Inf. Process. Lett..
[6] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .
[7] Ruy Luiz Milidiú,et al. Three space-economical algorithms for calculating minimum-redundancy prefix codes , 2001, IEEE Trans. Inf. Theory.
[8] Alistair Moffat,et al. Efficient Construction of Minimum-Redundancy Codes for Large Alphabets , 1998, IEEE Trans. Inf. Theory.
[9] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[10] Neelima Gupta,et al. Distribution-Sensitive Algorithms , 1999, Nord. J. Comput..
[11] Amr Elmasry. Distribution-sensitive set multi-partitioning , 2005 .
[12] Alistair Moffat,et al. Adding compression to a full‐text retrieval system , 1995, Softw. Pract. Exp..