Approximating Huffman codes in parallel. Berman, P., Karpinski, M., & Nekrich, Y. J. Discrete Algorithms, 5(3):479-490, 2007. 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
{"_id":"GeSeTiyBzBjDANkcM","bibbaseid":"berman-karpinski-nekrich-approximatinghuffmancodesinparallel-2007","authorIDs":["tMZWAHYFLsA3GH2EL"],"author_short":["Berman, P.","Karpinski, M.","Nekrich, Y."],"bibdata":{"bibtype":"article","type":"article","added-at":"2021-02-16T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Berman"],"firstnames":["Piotr"],"suffixes":[]},{"propositions":[],"lastnames":["Karpinski"],"firstnames":["Marek"],"suffixes":[]},{"propositions":[],"lastnames":["Nekrich"],"firstnames":["Yakov"],"suffixes":[]}],"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","bibtex":"@article{journals/jda/BermanKN07,\n added-at = {2021-02-16T00:00:00.000+0100},\n author = {Berman, Piotr and Karpinski, Marek and Nekrich, Yakov},\n biburl = {https://www.bibsonomy.org/bibtex/29973dc4bb8b809ba4e07a3183b43b0f5/dblp},\n ee = {https://doi.org/10.1016/j.jda.2006.10.007},\n interhash = {7c49782bac559e4f06254cad56f08a60},\n intrahash = {9973dc4bb8b809ba4e07a3183b43b0f5},\n journal = {J. Discrete Algorithms},\n keywords = {dblp},\n number = 3,\n pages = {479-490},\n timestamp = {2024-04-08T20:30:31.000+0200},\n title = {Approximating Huffman codes in parallel.},\n url = {http://dblp.uni-trier.de/db/journals/jda/jda5.html#BermanKN07},\n volume = 5,\n year = 2007\n}\n\n","author_short":["Berman, P.","Karpinski, M.","Nekrich, Y."],"key":"journals/jda/BermanKN07","id":"journals/jda/BermanKN07","bibbaseid":"berman-karpinski-nekrich-approximatinghuffmancodesinparallel-2007","role":"author","urls":{"Link":"https://doi.org/10.1016/j.jda.2006.10.007","Paper":"http://dblp.uni-trier.de/db/journals/jda/jda5.html#BermanKN07"},"keyword":["dblp"],"metadata":{"authorlinks":{"nekrich, y":"https://bibbase.org/show?bib=http%3A%2F%2Fwww.bibsonomy.org%2Fbib%2Fauthor%2Fyakov%20nekrich%3Fitems=1000&msg=embed"}},"downloads":0},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/yakov nekrich?items=1000","creationDate":"2020-05-16T22:41:00.843Z","downloads":0,"keywords":["dblp"],"search_terms":["approximating","huffman","codes","parallel","berman","karpinski","nekrich"],"title":"Approximating Huffman codes in parallel.","year":2007,"dataSources":["f7XsgZohqQ3Rphbct"]}