Work-Efficient Algorithms For The Construction Of Length-Limited Huffman Codes. Karpinski, M.; Larmore, L. L.; and Nekrich, Y. Parallel Process. Lett., 14(1):99-105, 2004.
Work-Efficient Algorithms For The Construction Of Length-Limited Huffman Codes. [link]Link  Work-Efficient Algorithms For The Construction Of Length-Limited Huffman Codes. [link]Paper  bibtex   
@article{journals/ppl/KarpinskiLN04,
  added-at = {2020-03-24T00:00:00.000+0100},
  author = {Karpinski, Marek and Larmore, Lawrence L. and Nekrich, Yakov},
  biburl = {https://www.bibsonomy.org/bibtex/2dbcb41dafbaaf5fc41e50820dfe806fc/dblp},
  ee = {https://doi.org/10.1142/S012962640400174X},
  interhash = {41427edb3f87b992f03aec3ff603c90c},
  intrahash = {dbcb41dafbaaf5fc41e50820dfe806fc},
  journal = {Parallel Process. Lett.},
  keywords = {dblp},
  number = 1,
  pages = {99-105},
  timestamp = {2020-03-25T11:39:59.000+0100},
  title = {Work-Efficient Algorithms For The Construction Of Length-Limited Huffman Codes.},
  url = {http://dblp.uni-trier.de/db/journals/ppl/ppl14.html#KarpinskiLN04},
  volume = 14,
  year = 2004
}
Downloads: 0