Approximating Huffman codes in parallel. Berman, P., Karpinski, M., & Nekrich, Y. J. Discrete Algorithms, 5(3):479-490, 2007.
Approximating Huffman codes in parallel. [link]Link  Approximating Huffman codes in parallel. [link]Paper  bibtex   
@article{journals/jda/BermanKN07,
  added-at = {2021-02-16T00:00:00.000+0100},
  author = {Berman, Piotr and Karpinski, Marek and Nekrich, Yakov},
  biburl = {https://www.bibsonomy.org/bibtex/29973dc4bb8b809ba4e07a3183b43b0f5/dblp},
  ee = {https://doi.org/10.1016/j.jda.2006.10.007},
  interhash = {7c49782bac559e4f06254cad56f08a60},
  intrahash = {9973dc4bb8b809ba4e07a3183b43b0f5},
  journal = {J. Discrete Algorithms},
  keywords = {dblp},
  number = 3,
  pages = {479-490},
  timestamp = {2024-04-08T20:30:31.000+0200},
  title = {Approximating Huffman codes in parallel.},
  url = {http://dblp.uni-trier.de/db/journals/jda/jda5.html#BermanKN07},
  volume = 5,
  year = 2007
}

Downloads: 0