Work-Efficient Algorithms For The Construction Of Length-Limited Huffman Codes. Karpinski, M., Larmore, L. L., & Nekrich, Y. Parallel Process. Lett., 14(1):99-105, 2004. 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
{"_id":"vX9hhmC2iLhiTT6bo","bibbaseid":"karpinski-larmore-nekrich-workefficientalgorithmsfortheconstructionoflengthlimitedhuffmancodes-2004","authorIDs":["tMZWAHYFLsA3GH2EL"],"author_short":["Karpinski, M.","Larmore, L. L.","Nekrich, Y."],"bibdata":{"bibtype":"article","type":"article","added-at":"2020-03-24T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Karpinski"],"firstnames":["Marek"],"suffixes":[]},{"propositions":[],"lastnames":["Larmore"],"firstnames":["Lawrence","L."],"suffixes":[]},{"propositions":[],"lastnames":["Nekrich"],"firstnames":["Yakov"],"suffixes":[]}],"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","bibtex":"@article{journals/ppl/KarpinskiLN04,\n added-at = {2020-03-24T00:00:00.000+0100},\n author = {Karpinski, Marek and Larmore, Lawrence L. and Nekrich, Yakov},\n biburl = {https://www.bibsonomy.org/bibtex/2dbcb41dafbaaf5fc41e50820dfe806fc/dblp},\n ee = {https://doi.org/10.1142/S012962640400174X},\n interhash = {41427edb3f87b992f03aec3ff603c90c},\n intrahash = {dbcb41dafbaaf5fc41e50820dfe806fc},\n journal = {Parallel Process. Lett.},\n keywords = {dblp},\n number = 1,\n pages = {99-105},\n timestamp = {2020-03-25T11:39:59.000+0100},\n title = {Work-Efficient Algorithms For The Construction Of Length-Limited Huffman Codes.},\n url = {http://dblp.uni-trier.de/db/journals/ppl/ppl14.html#KarpinskiLN04},\n volume = 14,\n year = 2004\n}\n\n","author_short":["Karpinski, M.","Larmore, L. L.","Nekrich, Y."],"key":"journals/ppl/KarpinskiLN04","id":"journals/ppl/KarpinskiLN04","bibbaseid":"karpinski-larmore-nekrich-workefficientalgorithmsfortheconstructionoflengthlimitedhuffmancodes-2004","role":"author","urls":{"Link":"https://doi.org/10.1142/S012962640400174X","Paper":"http://dblp.uni-trier.de/db/journals/ppl/ppl14.html#KarpinskiLN04"},"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"}}},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/yakov nekrich?items=1000","creationDate":"2020-05-16T22:41:00.654Z","downloads":0,"keywords":["dblp"],"search_terms":["work","efficient","algorithms","construction","length","limited","huffman","codes","karpinski","larmore","nekrich"],"title":"Work-Efficient Algorithms For The Construction Of Length-Limited Huffman Codes.","year":2004,"dataSources":["f7XsgZohqQ3Rphbct"]}